oj.uz

Submission #205211

# Submission time Handle Problem Language Result Execution time Memory
205211 2020-02-28T10:19:04 Z egekabas Meetings (JOI19_meetings) C++14
0 / 100
 64 ms 556 KB 
#include <bits/stdc++.h>
#include "meetings.h"
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long   ll;
typedef unsigned long long   ull;
typedef long double ld;
typedef pair<ll, ll>    pll;
typedef pair<ull, ull>    pull;
typedef pair<int, int>  pii;
typedef pair<ld, ld>  pld;
int p[2009];
void calc(int root, vector<int> all){
    if(all.size() <= 1) return;
    vector<pair<vector<int>, int>> groups;
    for(auto u : all){
        if(u == root) continue;
        int put = 0;
        for(auto &v : groups){
            int tmp = Query(root, u, v.ss);
            if(tmp == root) continue;
            put = 1;
            v.ss = tmp;
            v.ff.pb(u);
        }
        if(put == 0){
            groups.pb({{u}, u});
        }
    }
    for(auto v : groups){
        p[v.ss] = root;
        calc(v.ss, v.ff);
    }
        
}

void Solve(int n){
    vector<int> all;
    for(int i = 0; i < n; ++i)
        all.pb(i);
    calc(0, all);
    for(int i = 1; i < n; ++i)
        Bridge(min(i, p[i]), max(i, p[i]));
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Incorrect 4 ms 376 KB Wrong Answer [1]
7 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Incorrect 4 ms 376 KB Wrong Answer [1]
7 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Incorrect 4 ms 376 KB Wrong Answer [1]
7 Halted 0 ms 0 KB -

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 64 ms 556 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -