oj.uz

Submission #208768

# Submission time Handle Problem Language Result Execution time Memory
208768 2020-03-12T06:56:11 Z erd1 Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1144 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);

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-1);
    iota(all(v), 1);
    solve(0, v);
}

Compilation message

meetings.cpp: In function 'void solve(int, std::vector<int>&)':
meetings.cpp:102:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int cur = v[0], i = 1; i < v.size(); i++){
                                ~~^~~~~~~~~~
meetings.cpp:114: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 376 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 5 ms 248 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 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 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 6 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 510 ms 632 KB Output is correct
2 Correct 575 ms 888 KB Output is correct
3 Correct 652 ms 632 KB Output is correct
4 Correct 617 ms 636 KB Output is correct
5 Correct 405 ms 760 KB Output is correct
6 Correct 417 ms 632 KB Output is correct
7 Correct 704 ms 820 KB Output is correct
8 Correct 817 ms 632 KB Output is correct
9 Correct 784 ms 760 KB Output is correct
10 Correct 710 ms 632 KB Output is correct
11 Correct 826 ms 760 KB Output is correct
12 Correct 489 ms 760 KB Output is correct
13 Correct 279 ms 760 KB Output is correct
14 Correct 528 ms 632 KB Output is correct
15 Correct 434 ms 760 KB Output is correct
16 Correct 529 ms 888 KB Output is correct
17 Correct 770 ms 760 KB Output is correct
18 Execution timed out 2467 ms 1144 KB Time limit exceeded
19 Halted 0 ms 0 KB -