# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1048396 | 2024-08-08T07:19:30 Z | 김은성(#11035) | Make them Meet (EGOI24_makethemmeet) | C++17 | 0 ms | 348 KB |
#include <bits/stdc++.h> using namespace std; vector<int> graph[109]; vector<vector<int> > moves; int n, color[109]; void reset(){ for(int i=0; i<n; i++) color[i] = i+1; } void make_move(){ vector<int> temp; for(int i=0; i<n; i++) temp.push_back(color[i]); moves.push_back(temp); } void answer(){ printf("%d\n", moves.size()); for(vector<int> u: moves){ for(int v: u) printf("%d ", v); printf("\n"); } } int main(){ int m, i, j, k, u, v; scanf("%d %d", &n, &m); for(i=1; i<=m; i++){ scanf("%d %d", &u, &v); graph[u].push_back(v); graph[v].push_back(u); } for(i=1; i<n; i++){ reset(); color[0] = color[i] = i; make_move(); make_move(); } reset(); for(i=0; i<n; i++) color[i] = 0; answer(); return 0; } /* for(i=1; i<n; i++){ for(k=0; k<n; k++){ color[k]= k+1; } bool ch[109] = {0, }; vector<int> vec; for(j=0; j<n; j++){ if(!ch[j]){ for(int j2 = j; !ch[j2]; j2 = (j2 + i) % n){ //printf("j2=%d\n", j2); vec.push_back(j2); ch[j2]= 1; } } } for(k=0; k<n; k++){ color[k]= k+1; } for(j=0; j<vec.size()-1; j+=2){ color[vec[j]] = color[(vec[j] + i) % n] = vec[j]+1; } make_move(); make_move(); for(k=0; k<n; k++){ color[k]= k+1; } for(j=1; j<vec.size()-1; j+=2){ color[vec[j]] = color[(vec[j] + i) % n] = vec[j]+1; } make_move(); make_move(); for(k=0; k<n; k++){ color[k]= k+1; } for(j=vec.size()-1; j<=vec.size()-1; j+=2){ color[vec[j]] = color[(vec[j] + i) % n] = vec[j]+1; } make_move(); make_move(); } answer(); return 0; */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | If people start at 0 and 2, then they can avoid each other |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | If people start at 0 and 2, then they can avoid each other |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | If people start at 1 and 2, then they can avoid each other |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | If people start at 0 and 2, then they can avoid each other |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | If people start at 0 and 2, then they can avoid each other |
3 | Halted | 0 ms | 0 KB | - |