# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1048353 | 2024-08-08T07:02:22 Z | 김은성(#11035) | Make them Meet (EGOI24_makethemmeet) | C++17 | 42 ms | 7448 KB |
#include <bits/stdc++.h> using namespace std; vector<int> graph[109]; vector<vector<int> > moves; int n, color[109]; 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=0; i<n; i++){ for(j=i+1; j<n; j++){ for(k=0; k<n; k++){ if(k==i || k==j) color[k] = 0; else color[k]= k+1; } make_move(); make_move(); } } answer(); return 0; for(i=1; i<n; i++){ for(j=i+1; j<n; j++){ for(k=0; k<n; k++){ if(k==0 || k==i) color[k] = 2; else color[k]= 1; } make_move(); for(k=0; k<n; k++){ if(k==0 || k==j) color[k] = 2; else color[k]= 1; } make_move(); for(k=0; k<n; k++){ if(k==0 || k==j) color[k] = 2; else color[k]= 1; } make_move(); for(k=0; k<n; k++){ if(k==0 || k==i) color[k] = 2; else color[k]= 1; } make_move(); } } answer(); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 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 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 464 KB | Output is correct |
6 | Partially correct | 1 ms | 604 KB | Partially correct |
7 | Partially correct | 3 ms | 860 KB | Partially correct |
8 | Partially correct | 6 ms | 1112 KB | Partially correct |
9 | Partially correct | 42 ms | 7448 KB | Partially correct |
# | 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 | 344 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 | 344 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 | - |