oj.uz

Submission #378264

# Submission time Handle Problem Language Result Execution time Memory
378264 2021-03-16T10:58:30 Z urd05 Meetings (JOI19_meetings) C++14
100 / 100
 1286 ms 1004 KB 
#include <bits/stdc++.h>
#include "meetings.h"
using namespace std;

mt19937 rd = mt19937((unsigned)chrono::steady_clock::now().time_since_epoch().count());
uniform_int_distribution<int> ran(0, 2147483647);
int s,t;

bool comp(int a,int b) {
    if (a==b) {
        return false;
    }
    if (Query(a,b,t)==b) {
        return true;
    }
    else {
        return false;
    }
}

void f(vector<int> v) {
    if (v.size()==1) {
        return;
    }
    int one=ran(rd)%v.size();
    int two=ran(rd)%v.size();
    while (one==two) {
        two=ran(rd)%v.size();
    }
    vector<int> save(v.size());
    for(int i=0;i<v.size();i++) {
        if (i!=one&&i!=two) {
            save[i]=Query(v[one],v[two],v[i]);
        }
    }
    save[one]=v[one];
    save[two]=v[two];
    vector<int> vec;
    for(int i=0;i<v.size();i++) {
        if (i!=one&&i!=two&&save[i]==v[i]) {
            vec.push_back(v[i]);
        }
    }
    s=v[one];
    t=v[two];
    sort(vec.begin(),vec.end(),comp);
    vec.insert(vec.begin(),v[one]);
    vec.push_back(v[two]);
    for(int i=0;i+1<vec.size();i++) {
        Bridge(min(vec[i],vec[i+1]),max(vec[i],vec[i+1]));
    }
    vector<vector<int>> val(vec.size());
    for(int i=0;i<v.size();i++) {
        for(int j=0;j<vec.size();j++) {
            if (save[i]==vec[j]) {
                val[j].push_back(v[i]);
                break;
            }
        }
    }
    for(int i=0;i<vec.size();i++) {
        f(val[i]);
    }
}

void Solve(int n) {
    mt19937 rd = mt19937((unsigned)chrono::steady_clock::now().time_since_epoch().count());
    uniform_int_distribution<int> ran(0, 2147483647);
    vector<int> vec;
    for(int i=0;i<n;i++) {
        vec.push_back(i);
    }
    f(vec);
}

Compilation message

meetings.cpp: In function 'void f(std::vector<int>)':
meetings.cpp:31:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for(int i=0;i<v.size();i++) {
      |                 ~^~~~~~~~~
meetings.cpp:39:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for(int i=0;i<v.size();i++) {
      |                 ~^~~~~~~~~
meetings.cpp:49:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |     for(int i=0;i+1<vec.size();i++) {
      |                 ~~~^~~~~~~~~~~
meetings.cpp:53:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     for(int i=0;i<v.size();i++) {
      |                 ~^~~~~~~~~
meetings.cpp:54:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |         for(int j=0;j<vec.size();j++) {
      |                     ~^~~~~~~~~~~
meetings.cpp:61:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |     for(int i=0;i<vec.size();i++) {
      |                 ~^~~~~~~~~~~
meetings.cpp: In function 'void Solve(int)':
meetings.cpp:67:13: warning: variable 'rd' set but not used [-Wunused-but-set-variable]
   67 |     mt19937 rd = mt19937((unsigned)chrono::steady_clock::now().time_since_epoch().count());
      |             ^~

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 1 ms 364 KB Output is correct
4 Correct 1 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 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 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 1 ms 364 KB Output is correct
4 Correct 1 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 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 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 364 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 1 ms 364 KB Output is correct
4 Correct 1 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 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 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 364 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 6 ms 364 KB Output is correct
28 Correct 6 ms 364 KB Output is correct
29 Correct 6 ms 364 KB Output is correct
30 Correct 5 ms 364 KB Output is correct
31 Correct 5 ms 364 KB Output is correct
32 Correct 6 ms 364 KB Output is correct
33 Correct 9 ms 364 KB Output is correct
34 Correct 10 ms 492 KB Output is correct
35 Correct 10 ms 492 KB Output is correct
36 Correct 6 ms 364 KB Output is correct
37 Correct 16 ms 492 KB Output is correct
38 Correct 13 ms 492 KB Output is correct
39 Correct 9 ms 504 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 399 ms 876 KB Output is correct
2 Correct 416 ms 748 KB Output is correct
3 Correct 471 ms 812 KB Output is correct
4 Correct 410 ms 748 KB Output is correct
5 Correct 386 ms 620 KB Output is correct
6 Correct 371 ms 748 KB Output is correct
7 Correct 513 ms 748 KB Output is correct
8 Correct 573 ms 876 KB Output is correct
9 Correct 488 ms 876 KB Output is correct
10 Correct 541 ms 748 KB Output is correct
11 Correct 581 ms 700 KB Output is correct
12 Correct 568 ms 840 KB Output is correct
13 Correct 387 ms 772 KB Output is correct
14 Correct 401 ms 772 KB Output is correct
15 Correct 467 ms 748 KB Output is correct
16 Correct 411 ms 748 KB Output is correct
17 Correct 504 ms 868 KB Output is correct
18 Correct 346 ms 748 KB Output is correct
19 Correct 311 ms 1004 KB Output is correct
20 Correct 496 ms 876 KB Output is correct
21 Correct 472 ms 876 KB Output is correct
22 Correct 387 ms 748 KB Output is correct
23 Correct 387 ms 896 KB Output is correct
24 Correct 496 ms 876 KB Output is correct
25 Correct 334 ms 900 KB Output is correct
26 Correct 379 ms 748 KB Output is correct
27 Correct 409 ms 748 KB Output is correct
28 Correct 615 ms 780 KB Output is correct
29 Correct 453 ms 748 KB Output is correct
30 Correct 498 ms 748 KB Output is correct
31 Correct 553 ms 748 KB Output is correct
32 Correct 752 ms 876 KB Output is correct
33 Correct 1286 ms 876 KB Output is correct
34 Correct 7 ms 364 KB Output is correct
35 Correct 6 ms 364 KB Output is correct
36 Correct 6 ms 364 KB Output is correct
37 Correct 5 ms 364 KB Output is correct
38 Correct 5 ms 364 KB Output is correct
39 Correct 7 ms 364 KB Output is correct
40 Correct 15 ms 492 KB Output is correct
41 Correct 11 ms 492 KB Output is correct
42 Correct 10 ms 364 KB Output is correct
43 Correct 5 ms 364 KB Output is correct
44 Correct 11 ms 492 KB Output is correct
45 Correct 11 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 1 ms 364 KB Output is correct
67 Correct 0 ms 364 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct