Submission #1354368

#TimeUsernameProblemLanguageResultExecution timeMemory
1354368sallyCarnival (EGOI23_carnival)C++20
23 / 100
45 ms1396 KiB
#include<iostream>
#include<vector>
#include<cstring>
using namespace std;
const int mx = 1005;
bool ok[mx][mx];
int main() {
    int N;
    cin>>N;
    memset(ok, true, sizeof(ok));
    for(int i=1; i<N; i++) {
        for(int j=i; j>=1; j--) {
            int c;
            cin>>c;
            if(j<=i/2) {
                ok[i][c] = false;
                ok[c][i] = false;
            }
        }
    }
    vector<int> ans(N);
    int now = 0;
    for(int i=1; i<N; i+=2) ans[i] = now++;
    for(int i=0; i<N; i+=2) ans[i] = now++;
    for(int x: ans) cout<<x<<' ';
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...