oj.uz

Submission #201561

# Submission time Handle Problem Language Result Execution time Memory
201561 2020-02-11T04:40:18 Z Rakhmand Meetings (JOI19_meetings) C++14
100 / 100
 1418 ms 3196 KB 
#include "meetings.h"

#include <cstring>
#include <list>
#include <map>
#include <deque>
#include <stack>
#include <bitset>
#include <functional>
#include <numeric>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iterator>

using namespace std;

int n;
int batya;
vector<pair<int, int> > ans;

bool cmp(int x, int y){
    if(y == batya){
        return 0;
    }
    if(x == batya){
        return 1;
    }
    if(Query(batya, x, y) == x) return 1;
    else return 0;
}

void dfs(vector<int> v){
    if(v.size() <= 1){
        return ;
    }
    vector<int> path;
    vector<vector<int> > lol(n);
    int a = v[v.size() - 1];
    int b = v[rand() %  (v.size() - 1)];
    path.push_back(a);
    path.push_back(b);
    for(int i = 0; i < v.size(); i++){
        int x = v[i];
        if(x == a || x == b) continue;
        int c = Query(a, b, x);
        if(c == x){
            path.push_back(c);
        }else{
            lol[c].push_back(x);
        }
    }
    batya = a;
    sort(path.begin(), path.end(), cmp);
    for(int i = 1; i < path.size(); i++){
        ans.push_back({path[i], path[i - 1]});
    }
    for(int i = 0; i < v.size(); i++){
        int x = v[i];
        lol[x].push_back(x);
        dfs(lol[x]);
    }
}

void Solve(int N) {
    n = N;
    srand(time(NULL));
    vector<int> v;
    for(int i = 0; i < N; i++) v.push_back(i);
    dfs(v);
    for(int i = 0; i < ans.size(); i++){
        int x = ans[i].first, y = ans[i].second;
        if(x > y) swap(x, y);
        Bridge(x, y);
    }
}

Compilation message

meetings.cpp: In function 'void dfs(std::vector<int>)':
meetings.cpp:48:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < v.size(); i++){
                    ~~^~~~~~~~~~
meetings.cpp:60:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 1; i < path.size(); i++){
                    ~~^~~~~~~~~~~~~
meetings.cpp:63:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < v.size(); i++){
                    ~~^~~~~~~~~~
meetings.cpp: In function 'void Solve(int)':
meetings.cpp:76:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < ans.size(); i++){
                    ~~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 482 ms 1492 KB Output is correct
2 Correct 654 ms 1564 KB Output is correct
3 Correct 630 ms 1540 KB Output is correct
4 Correct 635 ms 1532 KB Output is correct
5 Correct 448 ms 1252 KB Output is correct
6 Correct 390 ms 1280 KB Output is correct
7 Correct 702 ms 2296 KB Output is correct
8 Correct 788 ms 2676 KB Output is correct
9 Correct 766 ms 2764 KB Output is correct
10 Correct 720 ms 2780 KB Output is correct
11 Correct 883 ms 2852 KB Output is correct
12 Correct 513 ms 888 KB Output is correct
13 Correct 367 ms 1344 KB Output is correct
14 Correct 489 ms 1648 KB Output is correct
15 Correct 533 ms 1664 KB Output is correct
16 Correct 482 ms 1836 KB Output is correct
17 Correct 732 ms 2928 KB Output is correct
18 Correct 434 ms 1748 KB Output is correct
19 Correct 478 ms 1656 KB Output is correct
20 Correct 586 ms 1592 KB Output is correct
21 Correct 648 ms 1844 KB Output is correct
22 Correct 633 ms 1752 KB Output is correct
23 Correct 592 ms 1824 KB Output is correct
24 Correct 577 ms 1612 KB Output is correct
25 Correct 568 ms 1604 KB Output is correct
26 Correct 526 ms 1784 KB Output is correct
27 Correct 587 ms 1684 KB Output is correct
28 Correct 855 ms 2748 KB Output is correct
29 Correct 695 ms 3164 KB Output is correct
30 Correct 716 ms 2624 KB Output is correct
31 Correct 821 ms 3196 KB Output is correct
32 Correct 1418 ms 1272 KB Output is correct
33 Correct 620 ms 1272 KB Output is correct
34 Correct 10 ms 376 KB Output is correct
35 Correct 10 ms 504 KB Output is correct
36 Correct 10 ms 400 KB Output is correct
37 Correct 11 ms 504 KB Output is correct
38 Correct 11 ms 504 KB Output is correct
39 Correct 15 ms 664 KB Output is correct
40 Correct 18 ms 632 KB Output is correct
41 Correct 21 ms 760 KB Output is correct
42 Correct 20 ms 760 KB Output is correct
43 Correct 10 ms 376 KB Output is correct
44 Correct 17 ms 508 KB Output is correct
45 Correct 14 ms 632 KB Output is correct
46 Correct 11 ms 380 KB Output is correct
47 Correct 5 ms 428 KB Output is correct
48 Correct 5 ms 376 KB Output is correct
49 Correct 6 ms 376 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 376 KB Output is correct
52 Correct 5 ms 380 KB Output is correct
53 Correct 5 ms 376 KB Output is correct
54 Correct 5 ms 376 KB Output is correct
55 Correct 5 ms 380 KB Output is correct
56 Correct 5 ms 376 KB Output is correct
57 Correct 5 ms 376 KB Output is correct
58 Correct 5 ms 376 KB Output is correct
59 Correct 5 ms 376 KB Output is correct
60 Correct 5 ms 376 KB Output is correct
61 Correct 4 ms 248 KB Output is correct
62 Correct 5 ms 248 KB Output is correct
63 Correct 4 ms 248 KB Output is correct
64 Correct 5 ms 248 KB Output is correct
65 Correct 5 ms 248 KB Output is correct
66 Correct 5 ms 376 KB Output is correct
67 Correct 5 ms 376 KB Output is correct
68 Correct 5 ms 248 KB Output is correct
69 Correct 5 ms 248 KB Output is correct
70 Correct 5 ms 376 KB Output is correct
71 Correct 4 ms 248 KB Output is correct
72 Correct 5 ms 380 KB Output is correct