# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1058632 | 2024-08-14T11:38:44 Z | user736482 | Make them Meet (EGOI24_makethemmeet) | C++17 | 1 ms | 348 KB |
#include<bits/stdc++.h> using namespace std; long long a,b,c,t,n,x,y,m; vector<int>v1,v2; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cin>>n>>m; for(int i=0;i<m;i++){ cin>>a>>b; if(a!=i || b!=i+1) while(1) a=2137;} for(int i=0;i<n;i++){ v1.push_back(i/2); v2.push_back((i+1)/2); } for(int i=0;i<600;i++){ if(i&1) for(int j=0;j<v1.size();j++) cout<<v1[j]<<" "; else for(int j=0;j<v2.size();j++) cout<<v2[j]<<" "; cout<<"\n"; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | If people start at 0 and 1, then they can avoid each other |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | If people start at 0 and 1, then they can avoid each other |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | If people start at 0 and 1, then they can avoid each other |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | If people start at 0 and 1, then they can avoid each other |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | If people start at 0 and 1, then they can avoid each other |
2 | Halted | 0 ms | 0 KB | - |