oj.uz

Submission #374976

# Submission time Handle Problem Language Result Execution time Memory
374976 2021-03-08T17:38:16 Z BartolM Meetings (JOI19_meetings) C++17
100 / 100
 724 ms 1024 KB 
#include "meetings.h"
#include <bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;

const int INF=0x3f3f3f3f;
const int N=2005;

int n, uk;
int bio[N];

#define DEBUG 0
void upit(int x, int y) {
    #if DEBUG
        printf("%d <-> %d\n", x, y);
    #endif
    Bridge(min(x, y), max(x, y));
}

void rek(vector <int> v) {
    if (v.size()==1) return;

    for (int x:v) bio[x]=0;
    random_shuffle(v.begin(), v.end());
    int l=v[0], r=v[1];

    vector <int> v_l, v_r;
    v_l.pb(l); v_r.pb(r);
    bio[l]=bio[r]=1;

    for (int x:v) {
        if (x==l || x==r || bio[x]) continue;
        int y=Query(x, l, r);
        if (y==l) v_l.pb(x);
        else if (y==r) v_r.pb(x);
        else {
            if (v_l.size()<v_r.size()) {
                v_l.pb(x), bio[x]=1;
                l=y;
                if (y!=x) v_l.pb(y), bio[y]=1;
            }
            else {
                v_r.pb(x), bio[x]=1;
                r=y;
                if (y!=x) v_r.pb(y), bio[y]=1;;
            }
        }
    }
    upit(l, r);
    rek(v_l); rek(v_r);
}

void Solve(int nn) {
    n=nn;
    srand(time(0));
    vector <int> poc;
    for (int i=0; i<n; ++i) poc.pb(i);
    rek(poc);
}
/*
5
0 1
0 2
1 3
1 4
*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 9 ms 492 KB Output is correct
28 Correct 7 ms 364 KB Output is correct
29 Correct 11 ms 492 KB Output is correct
30 Correct 7 ms 364 KB Output is correct
31 Correct 8 ms 364 KB Output is correct
32 Correct 7 ms 492 KB Output is correct
33 Correct 12 ms 492 KB Output is correct
34 Correct 10 ms 492 KB Output is correct
35 Correct 12 ms 492 KB Output is correct
36 Correct 7 ms 364 KB Output is correct
37 Correct 9 ms 492 KB Output is correct
38 Correct 10 ms 492 KB Output is correct
39 Correct 8 ms 492 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 604 ms 780 KB Output is correct
2 Correct 620 ms 1004 KB Output is correct
3 Correct 724 ms 1004 KB Output is correct
4 Correct 685 ms 876 KB Output is correct
5 Correct 565 ms 836 KB Output is correct
6 Correct 611 ms 748 KB Output is correct
7 Correct 444 ms 748 KB Output is correct
8 Correct 543 ms 876 KB Output is correct
9 Correct 493 ms 876 KB Output is correct
10 Correct 525 ms 876 KB Output is correct
11 Correct 495 ms 876 KB Output is correct
12 Correct 555 ms 748 KB Output is correct
13 Correct 505 ms 852 KB Output is correct
14 Correct 552 ms 748 KB Output is correct
15 Correct 528 ms 1004 KB Output is correct
16 Correct 700 ms 1004 KB Output is correct
17 Correct 442 ms 900 KB Output is correct
18 Correct 523 ms 876 KB Output is correct
19 Correct 477 ms 876 KB Output is correct
20 Correct 598 ms 748 KB Output is correct
21 Correct 585 ms 908 KB Output is correct
22 Correct 674 ms 900 KB Output is correct
23 Correct 584 ms 876 KB Output is correct
24 Correct 605 ms 876 KB Output is correct
25 Correct 567 ms 1004 KB Output is correct
26 Correct 544 ms 880 KB Output is correct
27 Correct 611 ms 748 KB Output is correct
28 Correct 556 ms 1004 KB Output is correct
29 Correct 446 ms 916 KB Output is correct
30 Correct 529 ms 1024 KB Output is correct
31 Correct 550 ms 876 KB Output is correct
32 Correct 608 ms 876 KB Output is correct
33 Correct 547 ms 1004 KB Output is correct
34 Correct 7 ms 364 KB Output is correct
35 Correct 7 ms 364 KB Output is correct
36 Correct 8 ms 492 KB Output is correct
37 Correct 7 ms 364 KB Output is correct
38 Correct 7 ms 364 KB Output is correct
39 Correct 8 ms 492 KB Output is correct
40 Correct 8 ms 492 KB Output is correct
41 Correct 9 ms 492 KB Output is correct
42 Correct 10 ms 492 KB Output is correct
43 Correct 9 ms 364 KB Output is correct
44 Correct 8 ms 492 KB Output is correct
45 Correct 9 ms 492 KB Output is correct
46 Correct 8 ms 492 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 1 ms 364 KB Output is correct
53 Correct 1 ms 364 KB Output is correct
54 Correct 1 ms 364 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 1 ms 364 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 1 ms 364 KB Output is correct
62 Correct 0 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 0 ms 364 KB Output is correct
67 Correct 1 ms 364 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 0 ms 364 KB Output is correct
70 Correct 0 ms 364 KB Output is correct
71 Correct 0 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct