oj.uz

답안 #120398

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
120398 2019-06-24T11:06:41 Z pavel Meetings (JOI19_meetings) C++14
100 / 100
 1181 ms 1032 KB 
#include <vector>
#include <map>
#include <algorithm>
#include <cstdlib>
#include "meetings.h"


using namespace std;

struct cmp{
    int a;
    cmp(int b){
        a=b;
    }
    bool operator()(int x, int y){
        if(x==a) return y!=a;
        if(y==a) return false;
        return Query(a, x, y)==x;
    }
};


void SolveSubTree(vector<int> nodes){
    if(nodes.size()<=1) return;
    int a=rand()%nodes.size(), b=rand()%nodes.size();
    while(a==b){
        b=rand()%nodes.size();
    }
    a=nodes[a];b=nodes[b];
    map<int, vector<int>> sts;
    sts[a].push_back(a);
    sts[b].push_back(b);
    for(int j=0;j<nodes.size();++j){
        if(nodes[j]!=a && nodes[j]!=b){
            int x = Query(a, b, nodes[j]);
            sts[x].push_back(nodes[j]);
        }
    }

    vector<int> path;
    for(auto i:sts){
        path.push_back(i.first);
    }
    sort(path.begin(), path.end(), cmp(a));

    for(int i=1;i<path.size();++i){
        int x=min(path[i-1], path[i]);
        int y=max(path[i-1], path[i]);
        Bridge(x, y);
    }
    
    for(auto i:sts){
        SolveSubTree(i.second);
    }
}



void Solve(int N) {
    vector<int> s;
    for(int i=0;i<N;++i) s.push_back(i);
    SolveSubTree(s);
}

Compilation message

meetings.cpp: In function 'void SolveSubTree(std::vector<int>)':
meetings.cpp:33:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j=0;j<nodes.size();++j){
                 ~^~~~~~~~~~~~~
meetings.cpp:46:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=1;i<path.size();++i){
                 ~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 284 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 384 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 284 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 404 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 4 ms 384 KB Output is correct
32 Correct 7 ms 384 KB Output is correct
33 Correct 9 ms 384 KB Output is correct
34 Correct 10 ms 512 KB Output is correct
35 Correct 9 ms 412 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 7 ms 384 KB Output is correct
38 Correct 7 ms 384 KB Output is correct
39 Correct 7 ms 384 KB Output is correct

Subtask #4
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 534 ms 824 KB Output is correct
2 Correct 562 ms 892 KB Output is correct
3 Correct 630 ms 760 KB Output is correct
4 Correct 556 ms 652 KB Output is correct
5 Correct 316 ms 632 KB Output is correct
6 Correct 302 ms 684 KB Output is correct
7 Correct 376 ms 648 KB Output is correct
8 Correct 494 ms 632 KB Output is correct
9 Correct 535 ms 812 KB Output is correct
10 Correct 467 ms 760 KB Output is correct
11 Correct 550 ms 632 KB Output is correct
12 Correct 525 ms 892 KB Output is correct
13 Correct 253 ms 636 KB Output is correct
14 Correct 360 ms 848 KB Output is correct
15 Correct 319 ms 632 KB Output is correct
16 Correct 368 ms 860 KB Output is correct
17 Correct 447 ms 632 KB Output is correct
18 Correct 275 ms 552 KB Output is correct
19 Correct 345 ms 712 KB Output is correct
20 Correct 358 ms 680 KB Output is correct
21 Correct 441 ms 676 KB Output is correct
22 Correct 363 ms 632 KB Output is correct
23 Correct 317 ms 760 KB Output is correct
24 Correct 375 ms 680 KB Output is correct
25 Correct 350 ms 632 KB Output is correct
26 Correct 407 ms 632 KB Output is correct
27 Correct 393 ms 632 KB Output is correct
28 Correct 481 ms 788 KB Output is correct
29 Correct 393 ms 704 KB Output is correct
30 Correct 405 ms 632 KB Output is correct
31 Correct 445 ms 760 KB Output is correct
32 Correct 1181 ms 1024 KB Output is correct
33 Correct 425 ms 1032 KB Output is correct
34 Correct 6 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 6 ms 384 KB Output is correct
40 Correct 9 ms 384 KB Output is correct
41 Correct 12 ms 384 KB Output is correct
42 Correct 9 ms 384 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 7 ms 384 KB Output is correct
45 Correct 8 ms 512 KB Output is correct
46 Correct 7 ms 384 KB Output is correct
47 Correct 2 ms 256 KB Output is correct
48 Correct 2 ms 384 KB Output is correct
49 Correct 2 ms 256 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 2 ms 256 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 2 ms 384 KB Output is correct
54 Correct 2 ms 384 KB Output is correct
55 Correct 2 ms 256 KB Output is correct
56 Correct 2 ms 256 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 2 ms 384 KB Output is correct
59 Correct 2 ms 256 KB Output is correct
60 Correct 1 ms 256 KB Output is correct
61 Correct 2 ms 256 KB Output is correct
62 Correct 1 ms 256 KB Output is correct
63 Correct 2 ms 256 KB Output is correct
64 Correct 2 ms 256 KB Output is correct
65 Correct 2 ms 256 KB Output is correct
66 Correct 1 ms 256 KB Output is correct
67 Correct 2 ms 256 KB Output is correct
68 Correct 2 ms 384 KB Output is correct
69 Correct 2 ms 256 KB Output is correct
70 Correct 2 ms 256 KB Output is correct
71 Correct 2 ms 384 KB Output is correct
72 Correct 2 ms 256 KB Output is correct