oj.uz

답안 #1064703

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1064703 2024-08-18T17:04:43 Z sunboi Make them Meet (EGOI24_makethemmeet) C++17
24 / 100
 5 ms 604 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
 
 signed main(){
    int n, m; cin >> n >> m;
    for (int i = 0; i < m; i++){
        int a, b; cin >> a >> b;
    }
    
    cout << 600 << endl;

        for (int i = 0; i < 600; i++){
            
            if (i % 2){
                for (int j = 1; j <= n; j++){
                    cout << j / 2 << ' ';
                }
            }else{
                for (int j = 0; j < n; j++){
                    cout << j / 2 << ' ';
                }
            }
            
            cout << endl;
        }
    
    
    
    
    
 }

Subtask #1
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB If people start at 0 and 2, then they can avoid each other
3 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 5 ms 604 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 4 ms 592 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 3 ms 348 KB Output is correct

Subtask #4
0.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB If people start at 0 and 2, then they can avoid each other
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB If people start at 0 and 2, then they can avoid each other
3 Halted 0 ms 0 KB -