oj.uz

Submission #208777

# Submission time Handle Problem Language Result Execution time Memory
208777 2020-03-12T07:23:12 Z erd1 Meetings (JOI19_meetings) C++14
100 / 100
 1244 ms 1016 KB 
#include<utility>
#include<vector>
#include<algorithm>
#include<numeric>
#include<queue>
#include<iostream>
#include<map>
#include<set>

using namespace std;
typedef int64_t lld;
typedef pair<int,int> pii;
typedef pair<lld,lld> pll;
typedef pair<int,pll> pip;
typedef pair<pll,int> ppi;
typedef pair<lld,pll> plp;
typedef pair<pll,lld> ppl;
typedef pair<pll,pll> ppp;
template<typename T>
using maxHeap = priority_queue<T,vector<T>,less<T>>;
template<typename T>
using minHeap = priority_queue<T,vector<T>,greater<T>>;
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define endl '\n'
#define jizz cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);
inline void input(int &_x) {
    _x = 0;
    int _tmp = 1; char _tc = getchar();
    while((_tc < '0' || _tc > '9') && _tc != '-') _tc = getchar();
    if(_tc == '-') _tc = getchar(), _tmp = -1;
    while(_tc >= '0' && _tc <= '9') _x = _x*10+(_tc-48), _tc = getchar();
    _x *= _tmp;
}
inline void output(int _x) {
    char _buff[20]; int _f = 0;
    if(_x == 0)putchar('0');
    while(_x > 0)
    {
        _buff[_f++] = _x%10+'0';
        _x /= 10;
    }
    for(_f-=1; _f >= 0; _f--)
        putchar(_buff[_f]);
    putchar('\n');
}
template<typename Iter>
ostream& _out(ostream &s, Iter b, Iter e) {
    s<<"[";
    for ( auto it=b; it!=e; it++ ) s<<(it==b?"":" ")<<*it;
    s<<"]";
    return s;
}
template<class T1,class T2>
ostream& operator<<(ostream& out, pair<T1,T2> p) {
    return out << '(' << p.first << ", " << p.second << ')';
}
template<typename T>
ostream& operator <<( ostream &s, const vector<T> &c ) {
     return _out(s,c.begin(),c.end());
 }
#ifdef erd1
    #define pprint(x) cerr<<__PRETTY_FUNCTION__<<":"<<__LINE__<<" - "<<(#x)<<"="<<(x)<<endl
#else
    #define pprint(x)
#endif

// code starts here
int Query(int, int, int);
void Bridge(int, int);

int query(int a, int b, int c){
    static int x = 0;
    if(++x > 40000)exit(0);
    return Query(a, b, c);
}

inline void bridge(int i, int j){
    //cout << i << " " << j << endl;
    Bridge(min(i, j), max(i, j));
}

int curr = 0, biggest = -1;

struct comp {
    bool operator()(int a, int b){
        if(a == b)return false;
        if(a == curr)return true;
        if(b == curr)return false;
        if(a == biggest)return false;
        if(b == biggest)return true;
        return query(curr, a, b) == a;
    }
};
inline void insert(set<int, comp>& s, int a){
    biggest = a, s.insert(a), biggest = -1;
}
void solve(int r, vector<int>& v){
    //cout << r << v << endl;
    if(v.size() == 1) return bridge(r, v[0]);
    if(v.size() <= 1) return;
    curr = r;
    map<int, vector<int>> m; set<int, comp> ch;
    m[r], m[v[0]];
    ch.insert(r); insert(ch, v[0]);
    for(int cur = v[0], i = 1; i < v.size(); i++){
        int x = query(r, cur, v[i]);
        if(x == cur){
            if(m.find(cur) == m.end())
                m[cur], insert(ch, cur);
            cur = v[i];
        } else {
            if(m.find(x) == m.end())
                m[x], ch.insert(x);
            if(x != v[i])
                m[x].pb(v[i]);
        }
        if(i == v.size()-1)
            if(m.find(cur) == m.end())
                m[cur], insert(ch, cur);
    }
    for(auto& i: m)
        if(i.ss.size())solve(r = i.ff, i.ss);
    for(auto it1 = ch.begin(), it2 = next(it1); it2 != ch.end(); it1++, it2++)
        bridge(*it1, *it2);
}

void Solve(int N){
    vector<int> v(N);
    srand((intptr_t)(void*)new int());
    iota(all(v), 0);
    random_shuffle(all(v));
    int x = v.back(); v.pop_back();
    solve(x, v);
}

Compilation message

meetings.cpp: In function 'void solve(int, std::vector<int>&)':
meetings.cpp:108:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int cur = v[0], i = 1; i < v.size(); i++){
                                ~~^~~~~~~~~~
meetings.cpp:120:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(i == v.size()-1)
            ~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 4 ms 248 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 4 ms 248 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 248 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 504 KB Output is correct
13 Correct 5 ms 376 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 4 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 4 ms 248 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 4 ms 248 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 248 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 504 KB Output is correct
13 Correct 5 ms 376 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 248 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 380 KB Output is correct
20 Correct 5 ms 300 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 248 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 248 KB Output is correct
26 Correct 5 ms 376 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 4 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 4 ms 248 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 4 ms 248 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 248 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 504 KB Output is correct
13 Correct 5 ms 376 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 248 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 380 KB Output is correct
20 Correct 5 ms 300 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 248 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 248 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 11 ms 376 KB Output is correct
28 Correct 10 ms 380 KB Output is correct
29 Correct 12 ms 376 KB Output is correct
30 Correct 10 ms 376 KB Output is correct
31 Correct 10 ms 376 KB Output is correct
32 Correct 13 ms 376 KB Output is correct
33 Correct 18 ms 376 KB Output is correct
34 Correct 19 ms 376 KB Output is correct
35 Correct 19 ms 376 KB Output is correct
36 Correct 10 ms 376 KB Output is correct
37 Correct 18 ms 504 KB Output is correct
38 Correct 17 ms 408 KB Output is correct
39 Correct 21 ms 376 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 491 ms 692 KB Output is correct
2 Correct 586 ms 632 KB Output is correct
3 Correct 608 ms 688 KB Output is correct
4 Correct 610 ms 588 KB Output is correct
5 Correct 433 ms 632 KB Output is correct
6 Correct 379 ms 632 KB Output is correct
7 Correct 648 ms 640 KB Output is correct
8 Correct 763 ms 892 KB Output is correct
9 Correct 783 ms 1016 KB Output is correct
10 Correct 638 ms 760 KB Output is correct
11 Correct 815 ms 760 KB Output is correct
12 Correct 360 ms 760 KB Output is correct
13 Correct 233 ms 632 KB Output is correct
14 Correct 559 ms 760 KB Output is correct
15 Correct 410 ms 760 KB Output is correct
16 Correct 465 ms 632 KB Output is correct
17 Correct 693 ms 888 KB Output is correct
18 Correct 418 ms 760 KB Output is correct
19 Correct 444 ms 760 KB Output is correct
20 Correct 595 ms 632 KB Output is correct
21 Correct 588 ms 632 KB Output is correct
22 Correct 624 ms 632 KB Output is correct
23 Correct 558 ms 764 KB Output is correct
24 Correct 573 ms 760 KB Output is correct
25 Correct 531 ms 760 KB Output is correct
26 Correct 503 ms 632 KB Output is correct
27 Correct 627 ms 1016 KB Output is correct
28 Correct 807 ms 760 KB Output is correct
29 Correct 622 ms 760 KB Output is correct
30 Correct 642 ms 632 KB Output is correct
31 Correct 715 ms 764 KB Output is correct
32 Correct 1244 ms 1016 KB Output is correct
33 Correct 993 ms 1016 KB Output is correct
34 Correct 10 ms 376 KB Output is correct
35 Correct 11 ms 376 KB Output is correct
36 Correct 11 ms 376 KB Output is correct
37 Correct 11 ms 376 KB Output is correct
38 Correct 9 ms 376 KB Output is correct
39 Correct 13 ms 376 KB Output is correct
40 Correct 17 ms 376 KB Output is correct
41 Correct 19 ms 504 KB Output is correct
42 Correct 18 ms 376 KB Output is correct
43 Correct 9 ms 376 KB Output is correct
44 Correct 19 ms 632 KB Output is correct
45 Correct 16 ms 376 KB Output is correct
46 Correct 17 ms 492 KB Output is correct
47 Correct 5 ms 248 KB Output is correct
48 Correct 5 ms 376 KB Output is correct
49 Correct 5 ms 248 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 376 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 376 KB Output is correct
56 Correct 5 ms 376 KB Output is correct
57 Correct 5 ms 248 KB Output is correct
58 Correct 5 ms 248 KB Output is correct
59 Correct 5 ms 248 KB Output is correct
60 Correct 5 ms 376 KB Output is correct
61 Correct 5 ms 248 KB Output is correct
62 Correct 4 ms 248 KB Output is correct
63 Correct 4 ms 248 KB Output is correct
64 Correct 5 ms 376 KB Output is correct
65 Correct 5 ms 248 KB Output is correct
66 Correct 5 ms 376 KB Output is correct
67 Correct 4 ms 248 KB Output is correct
68 Correct 5 ms 508 KB Output is correct
69 Correct 5 ms 376 KB Output is correct
70 Correct 5 ms 252 KB Output is correct
71 Correct 5 ms 248 KB Output is correct
72 Correct 5 ms 248 KB Output is correct