oj.uz

Submission #933918

# Submission time Handle Problem Language Result Execution time Memory
933918 2024-02-26T14:58:47 Z alexander707070 Airline Route Map (JOI18_airline) C++14
0 / 100
 509 ms 40876 KB 
#include<bits/stdc++.h>
#include "Alicelib.h"
#define MAXN 2007

using namespace std;

namespace{
	int n,m,num;
	vector< pair<int,int> > edges;
}

void Alice( int N, int M, int A[], int B[]){

	n=N; m=M;
	num=17;

	for(int i=0;i<n;i++){
		for(int f=10;f>=0;f--){
			if(((1<<f)&(i+num))>0)edges.push_back({i,n+f});
		}
	}

	for(int i=n;i<=n+10;i++){
		edges.push_back({i,n+11});
		if(i<n+10)edges.push_back({i,i+1});
	}

	for(int i=0;i<m;i++){
		edges.push_back({A[i],B[i]});
	}

	InitG( n+12, edges.size() );
	for(int i=0;i<edges.size();i++){
		MakeG(i,edges[i].first,edges[i].second);
	}
}


#include <bits/stdc++.h>
#include "Boblib.h"
#define MAXN 2007

using namespace std;

namespace{
	int v,u,e,cnt,root,curr;
	vector<int> g[MAXN],w,line[MAXN];
	int sp[MAXN],tim;
	vector<int> path;
	vector< pair<int,int> > ed;
	int used2[MAXN],tim2,pos[MAXN],to[MAXN];
	bool dali;

	void dfs(int x,int p){
		path.push_back(x);

		for(int i=0;i<line[x].size();i++){
			if(line[x][i]==p)continue;
			dfs(line[x][i],x);
		}
	}

	bool ok(int x){
		w.clear(); tim++; e=0;

		for(int i=0;i<g[x].size();i++){
			w.push_back(g[x][i]);
			sp[w.back()]=tim;

			line[w.back()].clear();
		}

		for(int i=0;i<w.size();i++){
			for(int f:g[w[i]]){
				if(sp[f]==tim and f>w[i]){
					e++;

					line[w[i]].push_back(f);
					line[f].push_back(w[i]);
				}
			}
		}

		if(e!=w.size()-1)return false;
		
		cnt=0;
		for(int i=0;i<w.size();i++){
			if(line[w[i]].size()!=1 and line[w[i]].size()!=2)return false;
			if(line[w[i]].size()==1){
				cnt++; root=w[i];
			}
		}

		if(cnt!=2)return false;
		path.clear(); dfs(root,0);

		for(int i=0;i<path.size();i++){
			pos[path[i]]=i;
		}

		tim2++; dali=true;
		for(int f=0;f<v;f++){
			if(f==x or sp[f]==tim)continue;

			curr=0;
			for(int k:g[f]){
				if(sp[k]!=tim)continue;
				curr+=(1<<pos[k]);
			}
			to[f]=curr;

			if(used2[curr]==tim2 or curr<17 or curr>=v-12+17){dali=false;break;}
			used2[curr]=tim2;
		}

		if(dali)return true;

		reverse(path.begin(),path.end());

		for(int i=0;i<path.size();i++){
			pos[path[i]]=i;
		}

		tim2++; dali=true;
		for(int f=0;f<v;f++){
			if(f==x or sp[f]==tim)continue;

			curr=0;
			for(int k:g[f]){
				if(sp[k]!=tim)continue;
				curr+=(1<<pos[k]);
			}
			to[f]=curr;

			if(used2[curr]==tim2 or curr<17 or curr>=v-12+17){dali=false;break;}
			used2[curr]=tim2;
		}

		if(dali)return true;

		return false;
	}
}

void Bob( int V, int U, int C[], int D[] ){

	v=V; u=U;
	for(int i=0;i<u;i++){
		g[C[i]].push_back(D[i]);
		g[D[i]].push_back(C[i]);
	}

	for(int i=0;i<v;i++){
		if(g[i].size()==11 and ok(i)){
			e=0;
			for(int f=0;f<u;f++){
				if(sp[C[f]]==tim or sp[D[f]]==tim)continue;
				ed.push_back({to[C[f]]-17,to[D[f]]-17});
				e++;
			}
			InitMap(V-12,e);

			for(int f=0;f<ed.size();f++){
				MakeMap(ed[f].first,ed[f].second);
			}

			return;
		}
	}

}

Compilation message

Alice.cpp: In function 'void Alice(int, int, int*, int*)':
Alice.cpp:33:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |  for(int i=0;i<edges.size();i++){
      |              ~^~~~~~~~~~~~~

Bob.cpp: In function 'void {anonymous}::dfs(int, int)':
Bob.cpp:19:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |   for(int i=0;i<line[x].size();i++){
      |               ~^~~~~~~~~~~~~~~
Bob.cpp: In function 'bool {anonymous}::ok(int)':
Bob.cpp:28:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |   for(int i=0;i<g[x].size();i++){
      |               ~^~~~~~~~~~~~
Bob.cpp:35:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |   for(int i=0;i<w.size();i++){
      |               ~^~~~~~~~~
Bob.cpp:46:7: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |   if(e!=w.size()-1)return false;
      |      ~^~~~~~~~~~~~
Bob.cpp:49:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |   for(int i=0;i<w.size();i++){
      |               ~^~~~~~~~~
Bob.cpp:59:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |   for(int i=0;i<path.size();i++){
      |               ~^~~~~~~~~~~~
Bob.cpp:82:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |   for(int i=0;i<path.size();i++){
      |               ~^~~~~~~~~~~~
Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:125:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  125 |    for(int f=0;f<ed.size();f++){
      |                ~^~~~~~~~~~

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15620 KB Output is correct
2 Correct 3 ms 15620 KB Output is correct
3 Correct 3 ms 15620 KB Output is correct
4 Correct 3 ms 13572 KB Output is correct
5 Correct 2 ms 15624 KB Output is correct
6 Correct 3 ms 15620 KB Output is correct
7 Correct 3 ms 15620 KB Output is correct
8 Correct 3 ms 15616 KB Output is correct
9 Correct 3 ms 15620 KB Output is correct
10 Correct 3 ms 13568 KB Output is correct
11 Correct 3 ms 15616 KB Output is correct
12 Correct 3 ms 15620 KB Output is correct
13 Correct 3 ms 15616 KB Output is correct
14 Correct 3 ms 15620 KB Output is correct
15 Correct 3 ms 15612 KB Output is correct
16 Correct 3 ms 15616 KB Output is correct
17 Correct 3 ms 15640 KB Output is correct
18 Correct 3 ms 15620 KB Output is correct
19 Correct 3 ms 15620 KB Output is correct
20 Correct 3 ms 15616 KB Output is correct
21 Correct 3 ms 15616 KB Output is correct
22 Correct 3 ms 15620 KB Output is correct
23 Correct 3 ms 15620 KB Output is correct
24 Correct 3 ms 13568 KB Output is correct
25 Correct 3 ms 15620 KB Output is correct
26 Correct 3 ms 15620 KB Output is correct
27 Correct 3 ms 15620 KB Output is correct
28 Correct 3 ms 15620 KB Output is correct
29 Correct 3 ms 15620 KB Output is correct
30 Correct 3 ms 13572 KB Output is correct
31 Correct 2 ms 13572 KB Output is correct
32 Correct 2 ms 13572 KB Output is correct
33 Correct 2 ms 13572 KB Output is correct
34 Correct 2 ms 13568 KB Output is correct
35 Correct 3 ms 13564 KB Output is correct
36 Correct 3 ms 15620 KB Output is correct
37 Correct 3 ms 15612 KB Output is correct
38 Correct 3 ms 15620 KB Output is correct
39 Correct 3 ms 15616 KB Output is correct
40 Correct 3 ms 15616 KB Output is correct
41 Correct 3 ms 15616 KB Output is correct
42 Incorrect 3 ms 15620 KB Wrong Answer [17]
43 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15620 KB Output is correct
2 Correct 3 ms 15620 KB Output is correct
3 Correct 3 ms 15620 KB Output is correct
4 Correct 3 ms 13572 KB Output is correct
5 Correct 2 ms 15624 KB Output is correct
6 Correct 3 ms 15620 KB Output is correct
7 Correct 3 ms 15620 KB Output is correct
8 Correct 3 ms 15616 KB Output is correct
9 Correct 3 ms 15620 KB Output is correct
10 Correct 3 ms 13568 KB Output is correct
11 Correct 3 ms 15616 KB Output is correct
12 Correct 3 ms 15620 KB Output is correct
13 Correct 3 ms 15616 KB Output is correct
14 Correct 3 ms 15620 KB Output is correct
15 Correct 3 ms 15612 KB Output is correct
16 Correct 3 ms 15616 KB Output is correct
17 Correct 3 ms 15640 KB Output is correct
18 Correct 3 ms 15620 KB Output is correct
19 Correct 3 ms 15620 KB Output is correct
20 Correct 3 ms 15616 KB Output is correct
21 Correct 3 ms 15616 KB Output is correct
22 Correct 3 ms 15620 KB Output is correct
23 Correct 3 ms 15620 KB Output is correct
24 Correct 3 ms 13568 KB Output is correct
25 Correct 3 ms 15620 KB Output is correct
26 Correct 3 ms 15620 KB Output is correct
27 Correct 3 ms 15620 KB Output is correct
28 Correct 3 ms 15620 KB Output is correct
29 Correct 3 ms 15620 KB Output is correct
30 Correct 3 ms 13572 KB Output is correct
31 Correct 2 ms 13572 KB Output is correct
32 Correct 2 ms 13572 KB Output is correct
33 Correct 2 ms 13572 KB Output is correct
34 Correct 2 ms 13568 KB Output is correct
35 Correct 3 ms 13564 KB Output is correct
36 Correct 3 ms 15620 KB Output is correct
37 Correct 3 ms 15612 KB Output is correct
38 Correct 3 ms 15620 KB Output is correct
39 Correct 3 ms 15616 KB Output is correct
40 Correct 3 ms 15616 KB Output is correct
41 Correct 3 ms 15616 KB Output is correct
42 Incorrect 3 ms 15620 KB Wrong Answer [17]
43 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 434 ms 40044 KB Output is correct : V - N = 12
2 Correct 330 ms 38472 KB Output is correct : V - N = 12
3 Correct 117 ms 22140 KB Output is correct : V - N = 12
4 Correct 7 ms 16132 KB Output is correct : V - N = 12
5 Correct 80 ms 19540 KB Output is correct : V - N = 12
6 Correct 253 ms 39428 KB Output is correct : V - N = 12
7 Correct 509 ms 39824 KB Output is correct : V - N = 12
8 Correct 401 ms 38792 KB Output is correct : V - N = 12
9 Correct 204 ms 22844 KB Output is correct : V - N = 12
10 Correct 25 ms 17660 KB Output is correct : V - N = 12
11 Correct 33 ms 17680 KB Output is correct : V - N = 12
12 Correct 237 ms 28384 KB Output is correct : V - N = 12
13 Correct 379 ms 39884 KB Output is correct : V - N = 12
14 Correct 367 ms 38940 KB Output is correct : V - N = 12
15 Correct 223 ms 34164 KB Output is correct : V - N = 12
16 Correct 65 ms 18340 KB Output is correct : V - N = 12
17 Correct 11 ms 17140 KB Output is correct : V - N = 12
18 Correct 220 ms 22916 KB Output is correct : V - N = 12
19 Correct 343 ms 38684 KB Output is correct : V - N = 12
20 Correct 425 ms 40484 KB Output is correct : V - N = 12
21 Correct 132 ms 20744 KB Output is correct : V - N = 12
22 Correct 83 ms 19468 KB Output is correct : V - N = 12
23 Correct 37 ms 17672 KB Output is correct : V - N = 12
24 Correct 5 ms 15616 KB Output is correct : V - N = 12
25 Correct 20 ms 17328 KB Output is correct : V - N = 12
26 Correct 77 ms 19632 KB Output is correct : V - N = 12
27 Correct 139 ms 19932 KB Output is correct : V - N = 12
28 Correct 111 ms 19456 KB Output is correct : V - N = 12
29 Correct 62 ms 17788 KB Output is correct : V - N = 12
30 Correct 7 ms 15848 KB Output is correct : V - N = 12
31 Correct 5 ms 13828 KB Output is correct : V - N = 12
32 Correct 6 ms 14220 KB Output is correct : V - N = 12
33 Correct 5 ms 13828 KB Output is correct : V - N = 12
34 Correct 5 ms 13828 KB Output is correct : V - N = 12
35 Correct 5 ms 13568 KB Output is correct : V - N = 12
36 Correct 415 ms 40292 KB Output is correct : V - N = 12
37 Correct 386 ms 40144 KB Output is correct : V - N = 12
38 Correct 443 ms 39632 KB Output is correct : V - N = 12
39 Correct 445 ms 40876 KB Output is correct : V - N = 12
40 Correct 459 ms 40544 KB Output is correct : V - N = 12
41 Correct 74 ms 19052 KB Output is correct : V - N = 12
42 Correct 55 ms 18820 KB Output is correct : V - N = 12
43 Correct 54 ms 19504 KB Output is correct : V - N = 12
44 Correct 7 ms 15876 KB Output is correct : V - N = 12
45 Correct 39 ms 17804 KB Output is correct : V - N = 12
46 Correct 139 ms 22284 KB Output is correct : V - N = 12
47 Correct 89 ms 19104 KB Output is correct : V - N = 12
48 Correct 207 ms 24256 KB Output is correct : V - N = 12
49 Correct 44 ms 17436 KB Output is correct : V - N = 12
50 Correct 13 ms 16784 KB Output is correct : V - N = 12
51 Correct 331 ms 37432 KB Output is correct : V - N = 12
52 Correct 7 ms 15876 KB Output is correct : V - N = 12
53 Correct 265 ms 37376 KB Output is correct : V - N = 12
54 Correct 421 ms 38668 KB Output is correct : V - N = 12
55 Correct 27 ms 17208 KB Output is correct : V - N = 12
56 Correct 199 ms 27816 KB Output is correct : V - N = 12
57 Correct 433 ms 39880 KB Output is correct : V - N = 12
58 Correct 61 ms 18584 KB Output is correct : V - N = 12
59 Correct 138 ms 22200 KB Output is correct : V - N = 12
60 Correct 382 ms 39208 KB Output is correct : V - N = 12
61 Correct 3 ms 15616 KB Output is correct : V - N = 12
62 Correct 3 ms 15620 KB Output is correct : V - N = 12
63 Correct 3 ms 15620 KB Output is correct : V - N = 12
64 Correct 3 ms 15620 KB Output is correct : V - N = 12
65 Correct 4 ms 15620 KB Output is correct : V - N = 12
66 Correct 3 ms 15620 KB Output is correct : V - N = 12
67 Correct 3 ms 15872 KB Output is correct : V - N = 12
68 Correct 3 ms 15616 KB Output is correct : V - N = 12
69 Correct 3 ms 15620 KB Output is correct : V - N = 12
70 Correct 3 ms 15616 KB Output is correct : V - N = 12
71 Correct 3 ms 15616 KB Output is correct : V - N = 12
72 Correct 3 ms 15616 KB Output is correct : V - N = 12
73 Correct 3 ms 15616 KB Output is correct : V - N = 12
74 Correct 3 ms 15620 KB Output is correct : V - N = 12
75 Correct 3 ms 15620 KB Output is correct : V - N = 12
76 Correct 3 ms 15616 KB Output is correct : V - N = 12
77 Correct 3 ms 15620 KB Output is correct : V - N = 12
78 Correct 3 ms 15612 KB Output is correct : V - N = 12
79 Correct 3 ms 15616 KB Output is correct : V - N = 12
80 Correct 3 ms 15620 KB Output is correct : V - N = 12
81 Correct 3 ms 15620 KB Output is correct : V - N = 12
82 Correct 3 ms 15616 KB Output is correct : V - N = 12
83 Correct 3 ms 15612 KB Output is correct : V - N = 12
84 Correct 3 ms 15620 KB Output is correct : V - N = 12
85 Correct 3 ms 15620 KB Output is correct : V - N = 12
86 Correct 3 ms 15620 KB Output is correct : V - N = 12
87 Correct 3 ms 15620 KB Output is correct : V - N = 12
88 Correct 3 ms 15620 KB Output is correct : V - N = 12
89 Correct 3 ms 15612 KB Output is correct : V - N = 12
90 Correct 3 ms 15620 KB Output is correct : V - N = 12
91 Correct 2 ms 13820 KB Output is correct : V - N = 12
92 Correct 2 ms 13572 KB Output is correct : V - N = 12
93 Correct 2 ms 13568 KB Output is correct : V - N = 12
94 Correct 2 ms 13572 KB Output is correct : V - N = 12
95 Correct 3 ms 13564 KB Output is correct : V - N = 12
96 Correct 3 ms 15620 KB Output is correct : V - N = 12
97 Correct 3 ms 15620 KB Output is correct : V - N = 12
98 Correct 3 ms 15616 KB Output is correct : V - N = 12
99 Incorrect 3 ms 15620 KB Wrong Answer [17]
100 Halted 0 ms 0 KB -