Submission #1574853
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> pp; typedef pair<ll,ll> pll; void read(int& x){ scanf("%d",&x); } void read(ll& x){ scanf("%lld",&x); } template<typename T,typename... Args> void read(T& a,Args&... b){ read(a); read(b...); } #define all(x) (x).begin(),(x).end() #define pb push_back #define x first #define y second int last; vector<int> ans; void F(int t){ for(int i=1; i<=t; ++i) ans.pb(last+i); for(int i=1; i<=t; ++i) ans.pb(last+i); last += t; } int main() { ll targ; cin>>targ; for(int i=1;; ++i){ ll t=targ+i; if(__builtin_popcount(t) <= i){ queue<int>bits; for(int j=60; 0<=j; --j) if(1&(t>>j)) bits.push(j); while(int(bits.size()) < i){ int x=bits.front(); bits.pop(); if(x == 0){ bits.push(x); continue; } bits.push(x-1); bits.push(x-1); } while(bits.size()){ F(bits.front()); bits.pop(); } if(ans.size() > 200u){ ans.clear(); continue; } cout << ans.size() << endl; for(int x:ans) cout << x << ' '; break; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Tautonym Puzzle |
User | Namnamseo |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1143 Byte |
Status | TLE |
Exec Time | 2103 ms |
Memory | 1528 KB |
Compile Error
./Main.cpp: In function ‘void read(int&)’: ./Main.cpp:6:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] void read(int& x){ scanf("%d",&x); } ^ ./Main.cpp: In function ‘void read(ll&)’: ./Main.cpp:7:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] void read(ll& x){ scanf("%lld",&x); } ^
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 1000 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt |
All | 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 1 ms | 256 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
01.txt | TLE | 2103 ms | 1400 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | TLE | 2103 ms | 1400 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | TLE | 2103 ms | 1400 KB |
08.txt | TLE | 2103 ms | 1528 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | TLE | 2103 ms | 1400 KB |
12.txt | AC | 1 ms | 256 KB |
13.txt | TLE | 2103 ms | 1400 KB |
14.txt | AC | 1 ms | 256 KB |
15.txt | TLE | 2103 ms | 892 KB |
16.txt | AC | 1 ms | 256 KB |
17.txt | AC | 1 ms | 256 KB |
18.txt | TLE | 2103 ms | 892 KB |
19.txt | TLE | 2103 ms | 1400 KB |
20.txt | TLE | 2103 ms | 892 KB |
21.txt | TLE | 2103 ms | 1400 KB |
22.txt | AC | 1 ms | 256 KB |
23.txt | TLE | 2103 ms | 1400 KB |
24.txt | TLE | 2103 ms | 892 KB |
25.txt | AC | 1 ms | 256 KB |
26.txt | TLE | 2103 ms | 1400 KB |
27.txt | TLE | 2103 ms | 892 KB |
28.txt | AC | 1 ms | 256 KB |
29.txt | TLE | 2103 ms | 1400 KB |
30.txt | TLE | 2103 ms | 1400 KB |