oj.uz

Submission #1053354

# Submission time Handle Problem Language Result Execution time Memory
1053354 2024-08-11T10:53:14 Z Ludissey Make them Meet (EGOI24_makethemmeet) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
#define int long long
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
using namespace std;
int N,M,Q;
signed main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    cin >> N >> M;
    vector<pair<int,int>> ed(M);
    for (int i = 0; i < M; i++)
    {
        cin >> ed[i].first >> ed[i].second;
        if(ed[i].first>ed[i].second) swap(ed[i].first,ed[i].second);
    }
    sort(all(ed));
    for (int i = 0; i < N+1; i++) {
        if(i<N-1){
            for (int j = 0; j < N; j++)
            {
                if(j==i||j==i+1) cout << 0 << ' ';
                else cout << j+1 << ' ';
            }
            cout << '\n';
        }
        if(i>1){
            for (int j = 0; j < N; j++)
            {
                if(j==i-1||j==i-2) cout << 0 << ' ';
                else cout << j+1 << ' ';
            }
            if(i<N) cout << '\n';
        }
    }
    return 0;
}

Subtask #1
0.0 / 10.0

# 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 -

Subtask #2
0.0 / 13.0

# 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 -

Subtask #3
0.0 / 11.0

# 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 -

Subtask #4
0.0 / 36.0

# 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 -

Subtask #5
0.0 / 30.0

# 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 -