| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1232469 | yixuan19 | Make them Meet (EGOI24_makethemmeet) | C++20 | 0 ms | 328 KiB |
#include <iostream>
using namespace std;
int main(){
int N, M, start, end;
cin >> N >> M;
for (int i = 0; i < M; ++i){
cin >> start >> end;
}
cout<<3<<endl;
for (int i = 0; i < N; ++i){
cout<<1<<' ';
}
cout<<'\n';
cout<<1<<' ';
cout<<1<<' ';
for (int i = 0; i < N-2; ++i){
cout<<2<<' ';
}
cout<<'\n';
for (int i = 0; i < N; ++i){
cout<<1<<' ';
}
cout<<'\n';
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
