oj.uz

Submission #126838

# Submission time Handle Problem Language Result Execution time Memory
126838 2019-07-08T13:56:13 Z zoooma13 Meetings (JOI19_meetings) C++14
0 / 100
 2000 ms 10260 KB 
#include "bits/stdc++.h"
#include "meetings.h"
//#include "grader.cpp"
using namespace std;

#define MAX_N 2003

int comm_anc[MAX_N][MAX_N];
set <int> anc[MAX_N] ,sbtree[MAX_N];

void Solve(int N) {
    for(int u=1; u<N; u++)
    for(int v=u+1; v<N; v++){
        int o = comm_anc[v][u] = comm_anc[u][v] = Query(0 ,u ,v);
        sbtree[o].insert(u) ,sbtree[o].insert(v);
        anc[v].insert(o) ,anc[u].insert(o);
    }

    for(int i=1; i<N; i++){
        pair <int ,int> mi = {1e9 ,-1};
        for(auto&u : anc[i])
            if(u != i)
                mi = min(mi ,make_pair((int)sbtree[u].size() ,u));
        assert(mi.second != -1);
        Bridge(min(i ,mi.second) ,max(i ,mi.second));
        //cout << i << ' ' << mi.second << endl;
    }
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 636 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Runtime error 4 ms 936 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 636 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Runtime error 4 ms 936 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 636 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Runtime error 4 ms 936 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3009 ms 10260 KB Time limit exceeded
2 Halted 0 ms 0 KB -