oj.uz

Submission #172664

# Submission time Handle Problem Language Result Execution time Memory
172664 2020-01-02T10:04:48 Z balbit Airline Route Map (JOI18_airline) C++14
37 / 100
 951 ms 30536 KB 
#include "Alicelib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i,a,b) for (int i=(a); i<(b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i=(n-1); i>=0; --i)
#define REP1(i,n) FOR(i,1,n+1)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stdout,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__),fflush(stdout);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1<<29;
const ll inf = 1ll<<60;
const ll mod = 1e9+7;


void GG(){cout<<"-1\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b) % mo;
}

const int maxn = 1e5+5;

void Alice( int N, int M, int A[], int B[] ){
    vector<pii> edges;
    int marker = N;
    int dummy = N+1;
	REP(i,M) {
        edges.pb({A[i],B[i]});
	}
	REP(i,N) {
        edges.pb({marker,i});
	}
	edges.pb({marker, dummy});
	REP(i,10) {
        REP(j,N) {
            if ((j+1)&(1<<i)) {
                edges.pb({j,dummy+1+i});
//                bug(j, dummy+1+i);
            }
        }
	}
	REP(i,9) edges.pb({dummy+1+i, dummy+1+i+1});
	edges.pb({dummy+8, dummy+10});
	InitG(N+12, edges.size());
	int tmp = 0;
	for (pii & ed: edges){
//        cout<<ed.f<<" -> "<<ed.s<<endl;
        MakeG(tmp++, ed.f, ed.s);
	}
}


#include "Boblib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i,a,b) for (int i=(a); i<(b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i=(n-1); i>=0; --i)
#define REP1(i,n) FOR(i,1,n+1)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1<<29;
const ll inf = 1ll<<60;
const ll mod = 1e9+7;



const int maxn = 1e3+5;
vector<int> g[maxn];
bool node[maxn];
bool spe[maxn];
int odeg[maxn];// Degree for special nodes, to special nodes
int id[maxn];

#define debug(x)

void Bob( int V, int U, int C[], int D[] ){
    int marker = -1;
    int dummy = -1;
//    cout<<" ====== Bob time ======= "<<endl;
    REP(i,U) {
//        cout<<C[i]<<" - "<<D[i]<<endl;
        g[C[i]].pb(D[i]); g[D[i]].pb(C[i]);
    }
    REP(i,V) {
        if (SZ(g[i])==1) {
            assert(dummy==-1);
            dummy = i;
        }
    }
    debug(dummy);
    marker = g[dummy][0];
    for (int x : g[marker]) {
        if (x!=dummy) node[x] = 1;
    }
    vector<int> ten; // The ten special nodes
    REP(i,V) {
        if (i!=marker && i!=dummy && !node[i]) spe[i] = 1;
    }
    REP(i,V) {
        if (spe[i]) {
            for (int u : g[i]) {
                odeg[i] += spe[u];
            }
        }
    }
    int zero = -1;
    REP(i,V) {
        if (spe[i]) {
            if (odeg[i] == 1) zero = i;
        }
    }
    debug(zero);
    ten.pb(zero);
    REP(i,9) {
        spe[zero] = 0;
        for (int u : g[zero]) {
            if (spe[u]) {
                zero = u; break;
            }
        }
        ten.pb(zero);
    }
//    cout<<"Things in ten: "<<endl;
    REP(i,10) {
        debug(ten[i]);
    }
    assert(SZ(ten) == 10);
    REP(i, SZ(ten)) {
        for (int u : g[ten[i]]) if (node[u]) id[u] += (1<<i);
    }
    REP(i, V) {
        if (node[i]) id[i]--;
    }
    vector<pii> edges;
    REP(i, V) {
        if (node[i]) {
            for (int u: g[i]) {
                if (node[u]) if (id[i]<id[u]) edges.pb({id[i], id[u]});
            }
        }
    }
    bug(SZ(edges));
//    cout<<SZ(edges)<<endl;
//    for (pii & ed: edges){
//        cout<<ed.f<<' '<<ed.s<<endl;
//    }
	InitMap( V-12, SZ(edges) );
	for (pii & ed: edges){
        MakeMap(ed.f, ed.s);
	}
}

/*
4 3
0 1
0 2
0 3
*/

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 6640 KB Output is correct
2 Correct 9 ms 6648 KB Output is correct
3 Correct 7 ms 6896 KB Output is correct
4 Correct 9 ms 6640 KB Output is correct
5 Correct 9 ms 6640 KB Output is correct
6 Correct 9 ms 6896 KB Output is correct
7 Correct 9 ms 6640 KB Output is correct
8 Correct 9 ms 6896 KB Output is correct
9 Correct 9 ms 6640 KB Output is correct
10 Correct 9 ms 6648 KB Output is correct
11 Correct 9 ms 6640 KB Output is correct
12 Correct 9 ms 6640 KB Output is correct
13 Correct 9 ms 6952 KB Output is correct
14 Correct 9 ms 6640 KB Output is correct
15 Correct 9 ms 6640 KB Output is correct
16 Correct 9 ms 6640 KB Output is correct
17 Correct 9 ms 6648 KB Output is correct
18 Correct 10 ms 6896 KB Output is correct
19 Correct 9 ms 6896 KB Output is correct
20 Correct 9 ms 6896 KB Output is correct
21 Correct 9 ms 6904 KB Output is correct
22 Correct 9 ms 6896 KB Output is correct
23 Correct 9 ms 6640 KB Output is correct
24 Correct 9 ms 6640 KB Output is correct
25 Correct 9 ms 6640 KB Output is correct
26 Correct 9 ms 6896 KB Output is correct
27 Correct 9 ms 6640 KB Output is correct
28 Correct 9 ms 6640 KB Output is correct
29 Correct 9 ms 6640 KB Output is correct
30 Correct 9 ms 6896 KB Output is correct
31 Correct 9 ms 6896 KB Output is correct
32 Correct 9 ms 6728 KB Output is correct
33 Correct 9 ms 6896 KB Output is correct
34 Correct 9 ms 6896 KB Output is correct
35 Correct 9 ms 6896 KB Output is correct
36 Correct 9 ms 6952 KB Output is correct
37 Correct 9 ms 6640 KB Output is correct
38 Correct 7 ms 6736 KB Output is correct
39 Correct 9 ms 6640 KB Output is correct
40 Correct 8 ms 6640 KB Output is correct
41 Correct 9 ms 6896 KB Output is correct
42 Correct 9 ms 6640 KB Output is correct
43 Correct 9 ms 6640 KB Output is correct
44 Correct 9 ms 6896 KB Output is correct
45 Correct 9 ms 6640 KB Output is correct
46 Correct 8 ms 6640 KB Output is correct
47 Correct 9 ms 6640 KB Output is correct
48 Correct 9 ms 6640 KB Output is correct
49 Correct 9 ms 6640 KB Output is correct
50 Correct 9 ms 6640 KB Output is correct
51 Correct 9 ms 6896 KB Output is correct
52 Correct 9 ms 6896 KB Output is correct
53 Correct 8 ms 6640 KB Output is correct
54 Correct 9 ms 6640 KB Output is correct
55 Correct 8 ms 6896 KB Output is correct
56 Correct 8 ms 6648 KB Output is correct
57 Correct 8 ms 6640 KB Output is correct
58 Correct 9 ms 6640 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 6640 KB Output is correct
2 Correct 9 ms 6648 KB Output is correct
3 Correct 7 ms 6896 KB Output is correct
4 Correct 9 ms 6640 KB Output is correct
5 Correct 9 ms 6640 KB Output is correct
6 Correct 9 ms 6896 KB Output is correct
7 Correct 9 ms 6640 KB Output is correct
8 Correct 9 ms 6896 KB Output is correct
9 Correct 9 ms 6640 KB Output is correct
10 Correct 9 ms 6648 KB Output is correct
11 Correct 9 ms 6640 KB Output is correct
12 Correct 9 ms 6640 KB Output is correct
13 Correct 9 ms 6952 KB Output is correct
14 Correct 9 ms 6640 KB Output is correct
15 Correct 9 ms 6640 KB Output is correct
16 Correct 9 ms 6640 KB Output is correct
17 Correct 9 ms 6648 KB Output is correct
18 Correct 10 ms 6896 KB Output is correct
19 Correct 9 ms 6896 KB Output is correct
20 Correct 9 ms 6896 KB Output is correct
21 Correct 9 ms 6904 KB Output is correct
22 Correct 9 ms 6896 KB Output is correct
23 Correct 9 ms 6640 KB Output is correct
24 Correct 9 ms 6640 KB Output is correct
25 Correct 9 ms 6640 KB Output is correct
26 Correct 9 ms 6896 KB Output is correct
27 Correct 9 ms 6640 KB Output is correct
28 Correct 9 ms 6640 KB Output is correct
29 Correct 9 ms 6640 KB Output is correct
30 Correct 9 ms 6896 KB Output is correct
31 Correct 9 ms 6896 KB Output is correct
32 Correct 9 ms 6728 KB Output is correct
33 Correct 9 ms 6896 KB Output is correct
34 Correct 9 ms 6896 KB Output is correct
35 Correct 9 ms 6896 KB Output is correct
36 Correct 9 ms 6952 KB Output is correct
37 Correct 9 ms 6640 KB Output is correct
38 Correct 7 ms 6736 KB Output is correct
39 Correct 9 ms 6640 KB Output is correct
40 Correct 8 ms 6640 KB Output is correct
41 Correct 9 ms 6896 KB Output is correct
42 Correct 9 ms 6640 KB Output is correct
43 Correct 9 ms 6640 KB Output is correct
44 Correct 9 ms 6896 KB Output is correct
45 Correct 9 ms 6640 KB Output is correct
46 Correct 8 ms 6640 KB Output is correct
47 Correct 9 ms 6640 KB Output is correct
48 Correct 9 ms 6640 KB Output is correct
49 Correct 9 ms 6640 KB Output is correct
50 Correct 9 ms 6640 KB Output is correct
51 Correct 9 ms 6896 KB Output is correct
52 Correct 9 ms 6896 KB Output is correct
53 Correct 8 ms 6640 KB Output is correct
54 Correct 9 ms 6640 KB Output is correct
55 Correct 8 ms 6896 KB Output is correct
56 Correct 8 ms 6648 KB Output is correct
57 Correct 8 ms 6640 KB Output is correct
58 Correct 9 ms 6640 KB Output is correct
59 Correct 9 ms 6640 KB Output is correct
60 Correct 9 ms 7000 KB Output is correct
61 Correct 9 ms 6896 KB Output is correct
62 Correct 9 ms 6736 KB Output is correct
63 Correct 9 ms 6640 KB Output is correct
64 Correct 13 ms 6696 KB Output is correct
65 Correct 10 ms 6640 KB Output is correct
66 Correct 9 ms 6640 KB Output is correct
67 Correct 11 ms 6696 KB Output is correct
68 Correct 9 ms 6640 KB Output is correct
69 Correct 9 ms 6640 KB Output is correct
70 Correct 9 ms 6640 KB Output is correct
71 Correct 9 ms 6896 KB Output is correct
72 Correct 9 ms 6640 KB Output is correct
73 Correct 9 ms 6640 KB Output is correct
74 Correct 9 ms 6640 KB Output is correct
75 Correct 9 ms 6640 KB Output is correct
76 Correct 9 ms 6640 KB Output is correct
77 Correct 9 ms 6896 KB Output is correct
78 Correct 9 ms 6640 KB Output is correct
79 Correct 9 ms 6640 KB Output is correct
80 Correct 9 ms 6896 KB Output is correct
81 Correct 9 ms 6896 KB Output is correct
82 Correct 9 ms 6736 KB Output is correct
83 Correct 9 ms 6640 KB Output is correct
84 Correct 6 ms 6896 KB Output is correct
85 Correct 9 ms 6736 KB Output is correct
86 Correct 9 ms 6640 KB Output is correct
87 Correct 9 ms 6640 KB Output is correct
88 Correct 9 ms 6640 KB Output is correct
89 Correct 9 ms 6640 KB Output is correct
90 Correct 9 ms 6640 KB Output is correct
91 Correct 9 ms 6760 KB Output is correct
92 Correct 9 ms 6640 KB Output is correct
93 Correct 9 ms 6640 KB Output is correct
94 Correct 9 ms 6896 KB Output is correct
95 Correct 9 ms 6640 KB Output is correct
96 Correct 9 ms 6640 KB Output is correct
97 Correct 9 ms 6896 KB Output is correct
98 Correct 9 ms 6896 KB Output is correct
99 Correct 9 ms 6896 KB Output is correct
100 Correct 9 ms 6640 KB Output is correct
101 Correct 9 ms 6640 KB Output is correct
102 Correct 9 ms 6736 KB Output is correct
103 Correct 9 ms 6640 KB Output is correct
104 Correct 9 ms 6736 KB Output is correct
105 Correct 9 ms 6640 KB Output is correct
106 Correct 9 ms 6896 KB Output is correct
107 Correct 9 ms 6896 KB Output is correct
108 Correct 9 ms 6736 KB Output is correct
109 Correct 9 ms 6896 KB Output is correct
110 Correct 9 ms 6896 KB Output is correct
111 Correct 9 ms 6904 KB Output is correct
112 Correct 9 ms 6640 KB Output is correct
113 Correct 8 ms 6648 KB Output is correct
114 Correct 9 ms 7008 KB Output is correct
115 Correct 9 ms 6640 KB Output is correct
116 Correct 9 ms 6640 KB Output is correct
117 Correct 9 ms 6640 KB Output is correct
118 Correct 9 ms 6648 KB Output is correct

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Runtime error 951 ms 30536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -