oj.uz

Submission #122624

# Submission time Handle Problem Language Result Execution time Memory
122624 2019-06-28T19:28:18 Z duality Meetings (JOI19_meetings) C++14
100 / 100
 1281 ms 940 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "meetings.h"

int solve(vi v) {
    if (v.size() <= 1) return 0;
    random_shuffle(v.begin(),v.end());
    int i,a = v[0],b = v[1];
    vi va,vb;
    va.pb(a),vb.pb(b);
    for (i = 2; i < v.size(); i++) {
        int x = ((v[i] != a) && (v[i] != b)) ? Query(a,b,v[i]):v[i];
        if (x == a) va.pb(v[i]);
        else if (x == b) vb.pb(v[i]);
        else if (va.size() < vb.size()) va.pb(v[i]),a = x;
        else vb.pb(v[i]),b = x;
    }
    Bridge(min(a,b),max(a,b));
    solve(va),solve(vb);
    return 0;
}
void Solve(int N) {
    int i;
    vi v;
    for (i = 0; i < N; i++) v.pb(i);
    srand(1234);
    solve(v);
}

Compilation message

meetings.cpp: In function 'int solve(vi)':
meetings.cpp:65:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 2; i < v.size(); i++) {
                 ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 977 ms 804 KB Output is correct
2 Correct 1061 ms 808 KB Output is correct
3 Correct 1086 ms 760 KB Output is correct
4 Correct 1281 ms 784 KB Output is correct
5 Correct 881 ms 716 KB Output is correct
6 Correct 650 ms 760 KB Output is correct
7 Correct 642 ms 760 KB Output is correct
8 Correct 835 ms 940 KB Output is correct
9 Correct 797 ms 888 KB Output is correct
10 Correct 731 ms 760 KB Output is correct
11 Correct 874 ms 760 KB Output is correct
12 Correct 741 ms 716 KB Output is correct
13 Correct 887 ms 888 KB Output is correct
14 Correct 747 ms 888 KB Output is correct
15 Correct 671 ms 760 KB Output is correct
16 Correct 728 ms 780 KB Output is correct
17 Correct 863 ms 760 KB Output is correct
18 Correct 706 ms 724 KB Output is correct
19 Correct 754 ms 760 KB Output is correct
20 Correct 741 ms 892 KB Output is correct
21 Correct 825 ms 840 KB Output is correct
22 Correct 761 ms 888 KB Output is correct
23 Correct 906 ms 888 KB Output is correct
24 Correct 701 ms 892 KB Output is correct
25 Correct 835 ms 632 KB Output is correct
26 Correct 753 ms 824 KB Output is correct
27 Correct 739 ms 788 KB Output is correct
28 Correct 854 ms 888 KB Output is correct
29 Correct 779 ms 852 KB Output is correct
30 Correct 755 ms 888 KB Output is correct
31 Correct 721 ms 896 KB Output is correct
32 Correct 912 ms 888 KB Output is correct
33 Correct 638 ms 800 KB Output is correct
34 Correct 9 ms 376 KB Output is correct
35 Correct 8 ms 296 KB Output is correct
36 Correct 9 ms 376 KB Output is correct
37 Correct 10 ms 508 KB Output is correct
38 Correct 7 ms 504 KB Output is correct
39 Correct 9 ms 376 KB Output is correct
40 Correct 12 ms 376 KB Output is correct
41 Correct 15 ms 504 KB Output is correct
42 Correct 12 ms 504 KB Output is correct
43 Correct 8 ms 424 KB Output is correct
44 Correct 9 ms 504 KB Output is correct
45 Correct 9 ms 380 KB Output is correct
46 Correct 8 ms 508 KB Output is correct
47 Correct 2 ms 248 KB Output is correct
48 Correct 2 ms 376 KB Output is correct
49 Correct 2 ms 248 KB Output is correct
50 Correct 2 ms 248 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 2 ms 376 KB Output is correct
54 Correct 2 ms 248 KB Output is correct
55 Correct 2 ms 248 KB Output is correct
56 Correct 2 ms 248 KB Output is correct
57 Correct 2 ms 248 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 2 ms 248 KB Output is correct
60 Correct 2 ms 248 KB Output is correct
61 Correct 2 ms 248 KB Output is correct
62 Correct 2 ms 376 KB Output is correct
63 Correct 2 ms 248 KB Output is correct
64 Correct 2 ms 248 KB Output is correct
65 Correct 2 ms 376 KB Output is correct
66 Correct 2 ms 248 KB Output is correct
67 Correct 2 ms 248 KB Output is correct
68 Correct 2 ms 248 KB Output is correct
69 Correct 2 ms 248 KB Output is correct
70 Correct 2 ms 248 KB Output is correct
71 Correct 2 ms 248 KB Output is correct
72 Correct 2 ms 248 KB Output is correct