oj.uz

Submission #700165

# Submission time Handle Problem Language Result Execution time Memory
700165 2023-02-18T18:23:01 Z urosk Airline Route Map (JOI18_airline) C++14
0 / 100
 660 ms 58332 KB 
#include "Alicelib.h"
#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include "bits/stdc++.h"
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll int
#define llinf 100000000000000000LL // 10^17
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) (ll)(a.size())
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {cerr<<#a<<": ";for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define cer(a) {cerr<<#a<<": ";for(ll x_ : a) cerr<<x_<< " ";cerr<<endl;}

#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);

using namespace std;
#define maxn 2020
void Alice(ll N,ll M,ll A[],ll B[] ){
    ll n = N,m = M;
    ll d = 12;
    ll v = n+d,u = m;
    vector<pll> a;
    vector<ll> want(maxn,0);
    vector<ll> deg(maxn,0);
    vector<vector<bool> > ima(maxn,vector<bool>(maxn,0));
    for(ll i = 0;i<m;i++) a.pb({A[i],B[i]});
    for(ll i = 0;i<n;i++) a.pb({i,v-1});
    for(ll i = 0;i<n;i++) a.pb({i,v-2});
    for(ll i = n;i<=n+4;i++) a.pb({i,v-2});
    for(ll i = n+5;i<=n+8;i++) a.pb({i,v-1});
    a.pb({v-1,v-2});
    set<pll> s;
    for(ll i = n;i<v-2;i++) want[i] = i-n;
    for(ll i = 0;i<v;i++) ima[i][i] = 1;
    for(ll i = v-3;i>n;i--){
        if(want[i]){
            a.pb({i,n});
            deg[i]++;
            deg[n]++;
            want[i]--;
        }
        ll j = i-1;
        while(want[i]&&j>=n){
            if(want[j]&&!ima[i][j]){
                ima[i][j] = ima[j][i] = 1;
                a.pb({i,j});
                want[j]--;
                want[i]--;
                deg[i]++;
                deg[j]++;
            }
            j--;
        }
    }
    for(ll i = 0;i<n;i++){
        for(ll j = 0;j<d-2;j++){
            if((1<<j)&i) a.pb({i,n+j});
        }
    }
    u = sz(a);
    InitG(v,u);
    for(ll i = 0;i<v;i++) deg[i] = 0;
    for(ll i = 0;i<u;i++) deg[a[i].fi]++,deg[a[i].sc]++;
    for(ll i = 0;i<u;i++) MakeG(i,a[i].fi,a[i].sc);
}
/**
4 3
0 1
0 2
0 3

5 7
0 1
0 2
1 3
1 4
3 4
2 3
2 4

**/

#include "Boblib.h"
#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include "bits/stdc++.h"
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll int
#define llinf 100000000000000000LL // 10^17
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) (ll)(a.size())
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {cerr<<#a<<": ";for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define cer(a) {cerr<<#a<<": ";for(ll x_ : a) cerr<<x_<< " ";cerr<<endl;}

#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);

using namespace std;
#define maxn 2020
void Bob(ll V,ll U,ll C[],ll D[]){
    ll n = V,m = U;
    vector<ll> ans(maxn,0);
    vector<ll> deg(maxn,0);
    vector<pll> e(maxn*maxn);
    vector<bool> spec(maxn,0);
    vector<vector<ll> > g(maxn);
    vector<bool> ok2(maxn,0);
    vector<vector<bool> > ok(maxn,vector<bool>(maxn,0));
    for(ll i = 0;i<m;i++) e[i] = {C[i],D[i]};
    for(ll i = 0;i<m;i++){
        ll x = e[i].fi,y = e[i].sc;
        deg[x]++;
        deg[y]++;
        ok[x][y] = ok[y][x] = 1;
        g[x].pb(y);
        g[y].pb(x);
    }
    ll N = n-12;
    for(ll i = 0;i<n;i++) ok[i][i] = 1;
    ll u = 0,v = -1;
    for(ll i = 0;i<n;i++){
        if(deg[i]>deg[u]) u = i;
    }
    for(ll x : g[u]){
        if(v==-1) v = x;
        else{
            if(deg[x]>deg[v]) v = x;
        }
    }
    lol:;
    vector<ll> w;
    for(ll i = 0;i<n;i++){
        if(ok[v][i]&&ok[u][i]) continue;
        if(i==u||i==v) continue;
        w.pb(i);
        spec[i] = 1;
    }
    spec[u] = spec[v] = 1;
    for(ll x : w){
        ll cnt = -1;
        for(ll y : w){
            if(ok[x][y]){
                cnt++;
            }
        }
        if(cnt==5){
            if(ok[x][u]) cnt = 0;
        }
        for(ll y : g[x]){
            if(!spec[y]){
                ans[y]+=(1<<cnt);
            }
        }
    }
    ll gr = 0;
    for(ll i = 0;i<m;i++){
        ll x = e[i].fi,y = e[i].sc;
        if(spec[x]||spec[y]) continue;
        gr++;
    }
    InitMap(n-12,gr);
    for(ll i = 0;i<m;i++){
        ll x = e[i].fi,y = e[i].sc;
        if(spec[x]||spec[y]) continue;
        x = ans[x],y = ans[y];
        MakeMap(x,y);
    }
}
/**
4 3
0 1
0 2
0 3

5 7
0 1
0 2
1 3
1 4
3 4
2 3
2 4

**/

Compilation message

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:44:8: warning: unused variable 'N' [-Wunused-variable]
   44 |     ll N = n-12;
      |        ^
Bob.cpp:56:5: warning: label 'lol' defined but not used [-Wunused-label]
   56 |     lol:;
      |     ^~~

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 37760 KB Output is correct
2 Correct 16 ms 37828 KB Output is correct
3 Correct 16 ms 37756 KB Output is correct
4 Correct 17 ms 37864 KB Output is correct
5 Correct 16 ms 37832 KB Output is correct
6 Correct 20 ms 37796 KB Output is correct
7 Correct 18 ms 37780 KB Output is correct
8 Correct 17 ms 37872 KB Output is correct
9 Correct 17 ms 37868 KB Output is correct
10 Correct 17 ms 37788 KB Output is correct
11 Correct 16 ms 37836 KB Output is correct
12 Correct 17 ms 37796 KB Output is correct
13 Correct 18 ms 37868 KB Output is correct
14 Correct 17 ms 37796 KB Output is correct
15 Correct 17 ms 37796 KB Output is correct
16 Correct 18 ms 38140 KB Output is correct
17 Correct 17 ms 37816 KB Output is correct
18 Correct 17 ms 37800 KB Output is correct
19 Correct 17 ms 37840 KB Output is correct
20 Correct 18 ms 37804 KB Output is correct
21 Correct 20 ms 37728 KB Output is correct
22 Correct 17 ms 37880 KB Output is correct
23 Correct 17 ms 37868 KB Output is correct
24 Correct 17 ms 37904 KB Output is correct
25 Correct 17 ms 37860 KB Output is correct
26 Correct 19 ms 37892 KB Output is correct
27 Correct 17 ms 37780 KB Output is correct
28 Correct 18 ms 37828 KB Output is correct
29 Correct 23 ms 37700 KB Output is correct
30 Correct 17 ms 37868 KB Output is correct
31 Correct 17 ms 37832 KB Output is correct
32 Correct 18 ms 37924 KB Output is correct
33 Correct 17 ms 37888 KB Output is correct
34 Correct 17 ms 37800 KB Output is correct
35 Correct 17 ms 37796 KB Output is correct
36 Correct 17 ms 37744 KB Output is correct
37 Correct 17 ms 37832 KB Output is correct
38 Correct 19 ms 37800 KB Output is correct
39 Correct 17 ms 37904 KB Output is correct
40 Correct 19 ms 37800 KB Output is correct
41 Correct 19 ms 37892 KB Output is correct
42 Correct 18 ms 37740 KB Output is correct
43 Correct 18 ms 37760 KB Output is correct
44 Correct 19 ms 37844 KB Output is correct
45 Correct 16 ms 37892 KB Output is correct
46 Correct 17 ms 37896 KB Output is correct
47 Correct 18 ms 37928 KB Output is correct
48 Correct 17 ms 37820 KB Output is correct
49 Correct 19 ms 37772 KB Output is correct
50 Correct 17 ms 37752 KB Output is correct
51 Incorrect 17 ms 37792 KB Wrong Answer [11]
52 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 37760 KB Output is correct
2 Correct 16 ms 37828 KB Output is correct
3 Correct 16 ms 37756 KB Output is correct
4 Correct 17 ms 37864 KB Output is correct
5 Correct 16 ms 37832 KB Output is correct
6 Correct 20 ms 37796 KB Output is correct
7 Correct 18 ms 37780 KB Output is correct
8 Correct 17 ms 37872 KB Output is correct
9 Correct 17 ms 37868 KB Output is correct
10 Correct 17 ms 37788 KB Output is correct
11 Correct 16 ms 37836 KB Output is correct
12 Correct 17 ms 37796 KB Output is correct
13 Correct 18 ms 37868 KB Output is correct
14 Correct 17 ms 37796 KB Output is correct
15 Correct 17 ms 37796 KB Output is correct
16 Correct 18 ms 38140 KB Output is correct
17 Correct 17 ms 37816 KB Output is correct
18 Correct 17 ms 37800 KB Output is correct
19 Correct 17 ms 37840 KB Output is correct
20 Correct 18 ms 37804 KB Output is correct
21 Correct 20 ms 37728 KB Output is correct
22 Correct 17 ms 37880 KB Output is correct
23 Correct 17 ms 37868 KB Output is correct
24 Correct 17 ms 37904 KB Output is correct
25 Correct 17 ms 37860 KB Output is correct
26 Correct 19 ms 37892 KB Output is correct
27 Correct 17 ms 37780 KB Output is correct
28 Correct 18 ms 37828 KB Output is correct
29 Correct 23 ms 37700 KB Output is correct
30 Correct 17 ms 37868 KB Output is correct
31 Correct 17 ms 37832 KB Output is correct
32 Correct 18 ms 37924 KB Output is correct
33 Correct 17 ms 37888 KB Output is correct
34 Correct 17 ms 37800 KB Output is correct
35 Correct 17 ms 37796 KB Output is correct
36 Correct 17 ms 37744 KB Output is correct
37 Correct 17 ms 37832 KB Output is correct
38 Correct 19 ms 37800 KB Output is correct
39 Correct 17 ms 37904 KB Output is correct
40 Correct 19 ms 37800 KB Output is correct
41 Correct 19 ms 37892 KB Output is correct
42 Correct 18 ms 37740 KB Output is correct
43 Correct 18 ms 37760 KB Output is correct
44 Correct 19 ms 37844 KB Output is correct
45 Correct 16 ms 37892 KB Output is correct
46 Correct 17 ms 37896 KB Output is correct
47 Correct 18 ms 37928 KB Output is correct
48 Correct 17 ms 37820 KB Output is correct
49 Correct 19 ms 37772 KB Output is correct
50 Correct 17 ms 37752 KB Output is correct
51 Incorrect 17 ms 37792 KB Wrong Answer [11]
52 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Incorrect 660 ms 58332 KB Wrong Answer [11]
2 Halted 0 ms 0 KB -