oj.uz

Submission #933923

# Submission time Handle Problem Language Result Execution time Memory
933923 2024-02-26T15:06:13 Z alexander707070 Airline Route Map (JOI18_airline) C++14
0 / 100
 492 ms 54828 KB 
#include<bits/stdc++.h>
#include "Alicelib.h"
#define MAXN 200007

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 200007

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; ed.clear();

			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++){
				if(ed[f].first<0 or ed[f].first>=V-12)cout<<1/0;
				if(ed[f].second<0 or ed[f].second>=V-12)cout<<1/0;
				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:126: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]
  126 |    for(int f=0;f<ed.size();f++){
      |                ~^~~~~~~~~~
Bob.cpp:127:50: warning: division by zero [-Wdiv-by-zero]
  127 |     if(ed[f].first<0 or ed[f].first>=V-12)cout<<1/0;
      |                                                 ~^~
Bob.cpp:128:52: warning: division by zero [-Wdiv-by-zero]
  128 |     if(ed[f].second<0 or ed[f].second>=V-12)cout<<1/0;
      |                                                   ~^~

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29444 KB Output is correct
2 Correct 7 ms 29440 KB Output is correct
3 Correct 7 ms 29444 KB Output is correct
4 Correct 6 ms 27396 KB Output is correct
5 Correct 6 ms 29440 KB Output is correct
6 Correct 6 ms 29440 KB Output is correct
7 Incorrect 7 ms 29440 KB Wrong Answer [17]
8 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29444 KB Output is correct
2 Correct 7 ms 29440 KB Output is correct
3 Correct 7 ms 29444 KB Output is correct
4 Correct 6 ms 27396 KB Output is correct
5 Correct 6 ms 29440 KB Output is correct
6 Correct 6 ms 29440 KB Output is correct
7 Incorrect 7 ms 29440 KB Wrong Answer [17]
8 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 457 ms 54028 KB Output is correct : V - N = 12
2 Correct 335 ms 52552 KB Output is correct : V - N = 12
3 Correct 117 ms 35536 KB Output is correct : V - N = 12
4 Correct 13 ms 29864 KB Output is correct : V - N = 12
5 Correct 104 ms 33196 KB Output is correct : V - N = 12
6 Correct 253 ms 52700 KB Output is correct : V - N = 12
7 Correct 417 ms 52696 KB Output is correct : V - N = 12
8 Correct 411 ms 53792 KB Output is correct : V - N = 12
9 Correct 174 ms 36628 KB Output is correct : V - N = 12
10 Correct 24 ms 30576 KB Output is correct : V - N = 12
11 Correct 51 ms 32192 KB Output is correct : V - N = 12
12 Correct 212 ms 42228 KB Output is correct : V - N = 12
13 Correct 408 ms 53048 KB Output is correct : V - N = 12
14 Correct 444 ms 53324 KB Output is correct : V - N = 12
15 Correct 289 ms 48452 KB Output is correct : V - N = 12
16 Correct 68 ms 32032 KB Output is correct : V - N = 12
17 Correct 16 ms 30808 KB Output is correct : V - N = 12
18 Correct 165 ms 36072 KB Output is correct : V - N = 12
19 Correct 332 ms 53112 KB Output is correct : V - N = 12
20 Correct 421 ms 54580 KB Output is correct : V - N = 12
21 Correct 120 ms 34200 KB Output is correct : V - N = 12
22 Correct 100 ms 33128 KB Output is correct : V - N = 12
23 Correct 37 ms 31040 KB Output is correct : V - N = 12
24 Correct 7 ms 29440 KB Output is correct : V - N = 12
25 Correct 20 ms 31164 KB Output is correct : V - N = 12
26 Correct 79 ms 33192 KB Output is correct : V - N = 12
27 Correct 127 ms 33268 KB Output is correct : V - N = 12
28 Correct 104 ms 33048 KB Output is correct : V - N = 12
29 Correct 47 ms 31880 KB Output is correct : V - N = 12
30 Correct 9 ms 29916 KB Output is correct : V - N = 12
31 Correct 10 ms 27576 KB Output is correct : V - N = 12
32 Correct 10 ms 27572 KB Output is correct : V - N = 12
33 Correct 8 ms 27396 KB Output is correct : V - N = 12
34 Correct 10 ms 27360 KB Output is correct : V - N = 12
35 Correct 8 ms 27392 KB Output is correct : V - N = 12
36 Correct 444 ms 53108 KB Output is correct : V - N = 12
37 Correct 399 ms 53740 KB Output is correct : V - N = 12
38 Correct 410 ms 53372 KB Output is correct : V - N = 12
39 Correct 479 ms 54828 KB Output is correct : V - N = 12
40 Correct 492 ms 53624 KB Output is correct : V - N = 12
41 Correct 75 ms 33028 KB Output is correct : V - N = 12
42 Correct 63 ms 33068 KB Output is correct : V - N = 12
43 Correct 61 ms 32652 KB Output is correct : V - N = 12
44 Correct 10 ms 29700 KB Output is correct : V - N = 12
45 Correct 43 ms 31584 KB Output is correct : V - N = 12
46 Correct 179 ms 36140 KB Output is correct : V - N = 12
47 Correct 65 ms 33556 KB Output is correct : V - N = 12
48 Correct 221 ms 36768 KB Output is correct : V - N = 12
49 Correct 39 ms 31388 KB Output is correct : V - N = 12
50 Correct 17 ms 30256 KB Output is correct : V - N = 12
51 Correct 421 ms 52488 KB Output is correct : V - N = 12
52 Correct 11 ms 29696 KB Output is correct : V - N = 12
53 Correct 309 ms 53112 KB Output is correct : V - N = 12
54 Correct 372 ms 51636 KB Output is correct : V - N = 12
55 Correct 29 ms 30912 KB Output is correct : V - N = 12
56 Correct 226 ms 41572 KB Output is correct : V - N = 12
57 Correct 408 ms 54144 KB Output is correct : V - N = 12
58 Correct 55 ms 32116 KB Output is correct : V - N = 12
59 Correct 158 ms 35716 KB Output is correct : V - N = 12
60 Correct 416 ms 54068 KB Output is correct : V - N = 12
61 Correct 6 ms 29444 KB Output is correct : V - N = 12
62 Correct 6 ms 29444 KB Output is correct : V - N = 12
63 Correct 6 ms 29444 KB Output is correct : V - N = 12
64 Correct 6 ms 29440 KB Output is correct : V - N = 12
65 Correct 8 ms 29448 KB Output is correct : V - N = 12
66 Correct 9 ms 29444 KB Output is correct : V - N = 12
67 Correct 7 ms 29444 KB Output is correct : V - N = 12
68 Correct 7 ms 29520 KB Output is correct : V - N = 12
69 Correct 6 ms 29452 KB Output is correct : V - N = 12
70 Correct 8 ms 29372 KB Output is correct : V - N = 12
71 Correct 7 ms 29348 KB Output is correct : V - N = 12
72 Correct 6 ms 29444 KB Output is correct : V - N = 12
73 Correct 7 ms 29356 KB Output is correct : V - N = 12
74 Correct 7 ms 29384 KB Output is correct : V - N = 12
75 Correct 6 ms 29444 KB Output is correct : V - N = 12
76 Correct 6 ms 29444 KB Output is correct : V - N = 12
77 Correct 7 ms 29440 KB Output is correct : V - N = 12
78 Correct 6 ms 29564 KB Output is correct : V - N = 12
79 Correct 7 ms 29264 KB Output is correct : V - N = 12
80 Correct 7 ms 29480 KB Output is correct : V - N = 12
81 Incorrect 7 ms 29476 KB Wrong Answer [17]
82 Halted 0 ms 0 KB -