# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
472160 | 2021-09-13T08:34:15 Z | BidoTeima | Nadan (COCI18_nadan) | C++17 | 4 ms | 1356 KB |
/// isA AC #include <bits/stdc++.h> using namespace std; using ll = long long; void ACPLS(){ #ifndef ONLINE_JUDGE freopen("output.txt","w",stdout); freopen("input.txt","r",stdin); #endif ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } #define tc int tttttt;cin>>tttttt;while(tttttt--) #define sumrange(l,r,arr) (l==0?arr[r]:arr[r]-arr[l-1]) int main(){ ACPLS(); int k,n; cin>>k>>n; vector<int>v; v.push_back(k); bool vis[(int)1e6+5]={0}; vis[k]=1; while((int)v.size()<n){ for(int i = 0; i < (int)v.size(); i++){ int x = v[i]; for(int j = 1e6/n+n; j >= 1 && (int)v.size()<n; j--){ if(x>j&&x!=2*j&&vis[x-j]==0&&vis[j]==0){ v[i]=x-j; v.push_back(j); vis[x]=0; vis[x-j]=1; vis[j]=1; } } } } for(auto i:v) cout<<i<<'\n'; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 1356 KB | Output isn't correct |
2 | Incorrect | 3 ms | 1356 KB | Output isn't correct |
3 | Incorrect | 3 ms | 1356 KB | Output isn't correct |
4 | Incorrect | 3 ms | 1228 KB | Output isn't correct |
5 | Incorrect | 3 ms | 1264 KB | Output isn't correct |
6 | Incorrect | 3 ms | 1356 KB | Output isn't correct |
7 | Incorrect | 3 ms | 1356 KB | Output isn't correct |
8 | Incorrect | 3 ms | 1228 KB | Output isn't correct |
9 | Incorrect | 4 ms | 1228 KB | Output isn't correct |
10 | Incorrect | 3 ms | 1356 KB | Output isn't correct |