oj.uz

Submission #47042

# Submission time Handle Problem Language Result Execution time Memory
47042 2018-04-26T16:38:16 Z vanogam Airline Route Map (JOI18_airline) C++14
37 / 100
 761 ms 25452 KB 
#include "Alicelib.h"
#include <bits/stdc++.h>
using namespace std;
void Alice( int N, int M, int A[], int B[] ){
	int a=0,u=0;
	a+=N+10+10+M+12;
	for(int i=0;i<N;i++){
        a+=__builtin_popcount(i);
	}
	InitG( N+12, a );

	for(int i=0;i<N;i++){
        MakeG(u++,i,N+10);
        //MakeG(u++,i,N+11);//cout<<"*";
	}

	for(int i=N;i<N+10;i++){
        MakeG(u++,i,N+10);
        MakeG(u++,i,N+11);
       if(i!=N+9) MakeG(u++,i,i+1);
       //else MakeG(u++,N,i+2);
	}
	MakeG(u++,N,N+5);
	MakeG(u++,N,N+6);
	MakeG(u++,N,N+7);
	for(int i=0;i<M;i++) MakeG(u++,A[i],B[i]);
	for(int i=0;i<N;i++){
        for(int a=0;a<10;a++){
            if(i&(1<<a)) MakeG(u++,i,N+a);
        }
	}
}


#include "Boblib.h"
#include <bits/stdc++.h>
using namespace std;
void Bob( int V, int U, int C[], int D[] ){
	vector<int> v[1102];
	int d[1102][1102],f[1102],g[1102];
	int k=0;
	for(int i=0;i<U;i++){
        //cout<<C[i]<<" "<<D[i]<<endl;
        v[C[i]].push_back(D[i]);
        v[D[i]].push_back(C[i]);
        d[C[i]][D[i]]=1;
        d[D[i]][C[i]]=1;
	}
    for(int i=0;i<V;i++){
        sort(v[i].begin(),v[i].end());
        //for(auto it:v[i]) cout<<i<<" "<<it<<endl;
    }
	for(int i=0;i<V;i++){
        if(v[i].size()==V-2) {k=i;break;}
	}
	f[k]=-10;
	g[k]=2;
	for(auto it:v[k]) g[it]=1;
	for(int i=0;i<V;i++){
        if(!g[i]) {k=i;break;}
	}g[k]=2;
	f[k]=-10;

	for(int i=0;i<V;i++){
        if(!d[k][i]) g[i]=2;
	}
	for(int i=0;i<V;i++){
        if(g[i]==2) continue;//cout<<"**"<<i<<"**";
        for(int a=i+1;a<V;a++){
            if(g[a]==2) continue;
            if(d[i][a]){f[i]--;f[a]--;}
        }
	}
	for(int i=0;i<V;i++){//cout<<f[i]<<"&";
        if(f[i]==-4) {k=i;break;}
	}
	int xr=1,l=0;
	for(int i=0;i<10;i++){
        for(auto it:v[k]){
            if(f[it]>=0) {f[it]+=xr;}
            if(f[it]==-10) continue;//cout<<f[it]<<" ";
            if(f[it]==-3 && f[k]!=-4) {l=it;}
            if(f[it]==-2) {l=it;}
        }//cout<<endl;
        f[k]=-10;//cout<<f[0]<<"**"<<endl;
        k=l;
        xr*=2;
	}

	for(int i=0;i<V;i++){
        if(f[i]>=0){
            for(auto it:v[i]){
                if(f[it]>=0) {d[i][it]=2;d[it][i]=2;}
            }
        }
	}
	int m=0;
	for(int i=0;i<V;i++){
        if(f[i]<0) continue;
        for(int a=i+1;a<V;a++){
            if(f[a]<0) continue;
            if(d[i][a]==2) m++;
        }
	}//cout<<"**"<<m<<"**";
	InitMap(V-12,m);
	for(int i=0;i<V;i++){
        if(f[i]<0) continue;
        for(int a=i+1;a<V;a++){
            if(f[a]<0) continue;
            if(d[i][a]==2){MakeMap(f[i],f[a]);}
        }
	}
}

Compilation message

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:20:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(v[i].size()==V-2) {k=i;break;}
            ~~~~~~~~~~~^~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Incorrect 761 ms 25452 KB Wrong Answer [14]
2 Halted 0 ms 0 KB -