oj.uz

Submission #917156

# Submission time Handle Problem Language Result Execution time Memory
917156 2024-01-27T10:33:41 Z guagua0407 Meetings (JOI19_meetings) C++17
100 / 100
 868 ms 2680 KB 
#include "meetings.h"
#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(),x.end()
mt19937 rng(time(NULL));

int gen(int x){
    return abs((int)rng())%x;
}
int R;
int n;

bool comp(int a,int b){
    return Query(R,a,b)==a;
}

void go(int root,vector<int> vec){
    if((int)vec.size()==1) return;
    vector<vector<int>> p(n);
    int x=vec[gen((int)vec.size())];
    while(x==root){
        x=vec[gen((int)vec.size())];
    }
    //cout<<root<<' '<<x<<'\n';
    for(auto v:vec){
        if(v==x or v==root) continue;
        int q=Query(root,v,x);
        p[q].push_back(v);
    }
    vector<int> tmp;
    for(auto v:vec){
        if(v==root or v==x or p[v].empty()) continue;
        tmp.push_back(v);
    }
    R=root;
    sort(all(tmp),comp);
    vector<int> tmp2;
    tmp2.push_back(root);
    tmp2.insert(tmp2.end(),all(tmp));
    tmp2.push_back(x);
    /*cout<<"list: ";
    for(auto v:tmp2){
        cout<<v<<' ';
    }
    cout<<'\n';*/
    for(int i=0;i<(int)tmp2.size()-1;i++){
        Bridge(min(tmp2[i],tmp2[i+1]),max(tmp2[i],tmp2[i+1]));
    }
    p[root].push_back(root);
    p[x].push_back(x);
    /*cout<<"check"<<'\n';
    for(auto v:tmp2){
        cout<<v<<'\n';
        for(auto u:p[v]){
            cout<<u<<' ';
        }
        cout<<'\n';
    }
    cout<<'\n';*/
    for(auto v:tmp2){
        go(v,p[v]);
    }
}

void Solve(int N){
    n=N;
    vector<int> vec(n);
    for(int i=0;i<n;i++){
        vec[i]=i;
    }
    go(0,vec);
}

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 1580 KB Output is correct
2 Correct 229 ms 1524 KB Output is correct
3 Correct 243 ms 1432 KB Output is correct
4 Correct 262 ms 1468 KB Output is correct
5 Correct 187 ms 1176 KB Output is correct
6 Correct 179 ms 1312 KB Output is correct
7 Correct 385 ms 2000 KB Output is correct
8 Correct 461 ms 2356 KB Output is correct
9 Correct 452 ms 2680 KB Output is correct
10 Correct 471 ms 2516 KB Output is correct
11 Correct 533 ms 2484 KB Output is correct
12 Correct 251 ms 1252 KB Output is correct
13 Correct 129 ms 1400 KB Output is correct
14 Correct 278 ms 1760 KB Output is correct
15 Correct 297 ms 1976 KB Output is correct
16 Correct 329 ms 1716 KB Output is correct
17 Correct 457 ms 2464 KB Output is correct
18 Correct 224 ms 1904 KB Output is correct
19 Correct 256 ms 1680 KB Output is correct
20 Correct 271 ms 1836 KB Output is correct
21 Correct 374 ms 1852 KB Output is correct
22 Correct 251 ms 1644 KB Output is correct
23 Correct 230 ms 1712 KB Output is correct
24 Correct 284 ms 1884 KB Output is correct
25 Correct 267 ms 1724 KB Output is correct
26 Correct 235 ms 1588 KB Output is correct
27 Correct 259 ms 1772 KB Output is correct
28 Correct 543 ms 2536 KB Output is correct
29 Correct 437 ms 2528 KB Output is correct
30 Correct 447 ms 2576 KB Output is correct
31 Correct 529 ms 2676 KB Output is correct
32 Correct 868 ms 1232 KB Output is correct
33 Correct 534 ms 1360 KB Output is correct
34 Correct 5 ms 600 KB Output is correct
35 Correct 5 ms 344 KB Output is correct
36 Correct 4 ms 600 KB Output is correct
37 Correct 4 ms 600 KB Output is correct
38 Correct 3 ms 344 KB Output is correct
39 Correct 4 ms 600 KB Output is correct
40 Correct 7 ms 576 KB Output is correct
41 Correct 9 ms 600 KB Output is correct
42 Correct 9 ms 600 KB Output is correct
43 Correct 3 ms 344 KB Output is correct
44 Correct 6 ms 600 KB Output is correct
45 Correct 6 ms 596 KB Output is correct
46 Correct 6 ms 540 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 1 ms 344 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 0 ms 344 KB Output is correct
61 Correct 0 ms 344 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 1 ms 344 KB Output is correct
64 Correct 1 ms 504 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 1 ms 344 KB Output is correct
68 Correct 0 ms 344 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 1 ms 596 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 0 ms 344 KB Output is correct