oj.uz

Submission #208765

# Submission time Handle Problem Language Result Execution time Memory
208765 2020-03-12T06:47:50 Z erd1 Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1032 KB 
#include<utility>
#include<vector>
#include<algorithm>
#include<numeric>
#include<queue>
#include<iostream>
#include<unordered_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));
}
struct comp {
    bool operator()(int a, int b) {
        if(!a)return true; if(!b)return false;
        return a != b && Query(0, a, b) == a;
    }
};

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;
    unordered_map<int, vector<int>> m; set<int, comp> ch;
    m[r], m[v[0]];
    ch.insert(r); ch.insert(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], ch.insert(ch.end(), 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], ch.insert(ch.end(), 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 member function 'bool comp::operator()(int, int)':
meetings.cpp:79:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
         if(!a)return true; if(!b)return false;
         ^~
meetings.cpp:79:28: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
         if(!a)return true; if(!b)return false;
                            ^~
meetings.cpp: In function 'void solve(int, std::vector<int>&)':
meetings.cpp:91:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int cur = v[0], i = 1; i < v.size(); i++){
                                ~~^~~~~~~~~~
meetings.cpp:103: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 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 6 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 4 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 376 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 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 6 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 4 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 248 KB Output is correct
15 Correct 5 ms 380 KB Output is correct
16 Correct 5 ms 248 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 248 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 248 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 248 KB Output is correct
25 Correct 5 ms 376 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 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 6 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 4 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 248 KB Output is correct
15 Correct 5 ms 380 KB Output is correct
16 Correct 5 ms 248 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 248 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 248 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 248 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 11 ms 380 KB Output is correct
28 Correct 12 ms 376 KB Output is correct
29 Correct 12 ms 376 KB Output is correct
30 Correct 11 ms 376 KB Output is correct
31 Correct 11 ms 376 KB Output is correct
32 Correct 15 ms 376 KB Output is correct
33 Correct 20 ms 376 KB Output is correct
34 Correct 22 ms 376 KB Output is correct
35 Correct 20 ms 376 KB Output is correct
36 Correct 13 ms 408 KB Output is correct
37 Correct 18 ms 504 KB Output is correct
38 Correct 19 ms 376 KB Output is correct
39 Correct 9 ms 376 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 629 ms 760 KB Output is correct
2 Correct 681 ms 640 KB Output is correct
3 Correct 745 ms 576 KB Output is correct
4 Correct 734 ms 632 KB Output is correct
5 Correct 497 ms 780 KB Output is correct
6 Correct 509 ms 632 KB Output is correct
7 Correct 742 ms 632 KB Output is correct
8 Correct 814 ms 668 KB Output is correct
9 Correct 809 ms 768 KB Output is correct
10 Correct 786 ms 632 KB Output is correct
11 Correct 836 ms 632 KB Output is correct
12 Correct 500 ms 760 KB Output is correct
13 Correct 394 ms 632 KB Output is correct
14 Correct 625 ms 760 KB Output is correct
15 Correct 514 ms 760 KB Output is correct
16 Correct 611 ms 632 KB Output is correct
17 Correct 822 ms 632 KB Output is correct
18 Execution timed out 2315 ms 1032 KB Time limit exceeded
19 Halted 0 ms 0 KB -