oj.uz

Submission #988167

# Submission time Handle Problem Language Result Execution time Memory
988167 2024-05-24T07:46:17 Z boyliguanhan Airline Route Map (JOI18_airline) C++17
0 / 100
 583 ms 40208 KB 
#include "Alicelib.h"
#include <bits/stdc++.h>
using namespace std;
void Alice( int N, int M, int A[], int B[] ){
	vector<pair<int,int>>EEE;
	for(int i=0;i<M;i++)
		EEE.push_back({A[i],B[i]});
	EEE.push_back({N,N+1});
	for(int i=0;i<10;i++)
		EEE.push_back({N+1,N+i+2});
	for(int i=0;i<9;i++)
		EEE.push_back({N+2+i,N+3+i});
	EEE.push_back({N+8,N+11});
	EEE.push_back({N+8,N+10});
	EEE.push_back({N+7,N+9});
	int cnt=0;
	for(int i=3;cnt<N;i++){
		if(__builtin_popcount(i)>1){
			for(int j=0;j<10;j++) if(i&1<<j)
				EEE.push_back({cnt,N+2+j});
			cnt++;
		}
	}
	InitG(N+12,EEE.size());
	for(int i=0;i<EEE.size();i++)
		MakeG(i,EEE[i].first,EEE[i].second);
}
#include "Boblib.h"
#include <bits/stdc++.h>
using namespace std;
#define CTD(D,I) for(auto i:adj[z]) {if(IN[i]&&i-w&&DEG[i]==D&&i!=v[I]){w=z,v.push_back(z=i);break;}}
vector<int>adj[1022];
int means[1024],val[1022],DEG[1022],IN[1022];
void Bob( int V, int U, int C[], int D[] ){
	int CC=0;
	for(int i=3;i<1024;i++)
		if(__builtin_popcount(i)>1)
			means[i]=CC++;
	for(int i=0;i<U;i++)
		adj[C[i]].push_back(D[i]),
		adj[D[i]].push_back(C[i]);
	int x,y,z,w=-1;
	for(int i=0;i<V;i++)
		if(adj[i].size()<2)
			x=i;
	y=adj[x][0];
	for(auto j:adj[y])
		IN[j]=1;
	for(int i=0;i<V;i++)
		for(auto j:adj[i])
			DEG[i]+=IN[j];
	for(auto i:adj[y])
		if(DEG[i]==1)
			z=i;
	vector<int>v{z};
	for(int Q=5;Q--;)for(auto i:adj[z])
		if(IN[i]&&i-w){w=z,v.push_back(z=i);break;}
	if(v.size()!=6) MakeMap(0,0);
	for(auto i:adj[z]) CTD(4,0)
	if(v.size()!=7) MakeMap(0,0);
	for(auto i:adj[z]){
		if(IN[i]&&i-w&&DEG[i]==3&&count(adj[i].begin(),adj[i].end(),v[5])){
			w=z,v.push_back(z=i);break;}}
	if(v.size()!=8) MakeMap(0,0);
	for(auto i:adj[z]) CTD(3,5)
	if(v.size()!=9) MakeMap(0,0);
	for(auto i:adj[z]) CTD(2,0)
	if(v.size()!=10) MakeMap(0,0);
	for(int i=0;i<10;i++)
		for(auto j:adj[v[i]])
			val[j]+=1<<i;
	vector<pair<int,int>>EEE;
	for(int i=0;i<U;i++) if(!IN[C[i]]&&!IN[D[i]]) {
		int A=means[val[C[i]]],B=means[val[D[i]]];
		EEE.push_back({A,B});
	}
	swap(EEE.back(),EEE[0]);
	InitMap(V-12,EEE.size());
	for(auto[i,j]:EEE)
		MakeMap(i,j);
}

Compilation message

Alice.cpp: In function 'void Alice(int, int, int*, int*)':
Alice.cpp:25: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]
   25 |  for(int i=0;i<EEE.size();i++)
      |              ~^~~~~~~~~~~

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:32:11: warning: unused variable 'i' [-Wunused-variable]
   32 |  for(auto i:adj[z]) CTD(4,0)
      |           ^
Bob.cpp:38:11: warning: unused variable 'i' [-Wunused-variable]
   38 |  for(auto i:adj[z]) CTD(3,5)
      |           ^
Bob.cpp:40:11: warning: unused variable 'i' [-Wunused-variable]
   40 |  for(auto i:adj[z]) CTD(2,0)
      |           ^

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15620 KB Output is correct
2 Correct 4 ms 15596 KB Output is correct
3 Correct 3 ms 15564 KB Output is correct
4 Runtime error 7 ms 18092 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15620 KB Output is correct
2 Correct 4 ms 15596 KB Output is correct
3 Correct 3 ms 15564 KB Output is correct
4 Runtime error 7 ms 18092 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 491 ms 40208 KB Output is correct : V - N = 12
2 Correct 310 ms 37420 KB Output is correct : V - N = 12
3 Correct 147 ms 21160 KB Output is correct : V - N = 12
4 Correct 8 ms 15872 KB Output is correct : V - N = 12
5 Correct 112 ms 18384 KB Output is correct : V - N = 12
6 Correct 299 ms 38028 KB Output is correct : V - N = 12
7 Correct 419 ms 38500 KB Output is correct : V - N = 12
8 Correct 446 ms 38272 KB Output is correct : V - N = 12
9 Correct 235 ms 22240 KB Output is correct : V - N = 12
10 Correct 24 ms 16740 KB Output is correct : V - N = 12
11 Correct 54 ms 17088 KB Output is correct : V - N = 12
12 Correct 224 ms 27464 KB Output is correct : V - N = 12
13 Correct 534 ms 38312 KB Output is correct : V - N = 12
14 Correct 538 ms 39188 KB Output is correct : V - N = 12
15 Correct 321 ms 31800 KB Output is correct : V - N = 12
16 Correct 86 ms 17820 KB Output is correct : V - N = 12
17 Correct 13 ms 16800 KB Output is correct : V - N = 12
18 Correct 191 ms 21396 KB Output is correct : V - N = 12
19 Correct 538 ms 37288 KB Output is correct : V - N = 12
20 Correct 583 ms 38248 KB Output is correct : V - N = 12
21 Correct 137 ms 19920 KB Output is correct : V - N = 12
22 Correct 78 ms 18628 KB Output is correct : V - N = 12
23 Correct 60 ms 17092 KB Output is correct : V - N = 12
24 Correct 6 ms 15876 KB Output is correct : V - N = 12
25 Correct 28 ms 16904 KB Output is correct : V - N = 12
26 Correct 115 ms 18376 KB Output is correct : V - N = 12
27 Correct 108 ms 18872 KB Output is correct : V - N = 12
28 Correct 121 ms 18636 KB Output is correct : V - N = 12
29 Correct 45 ms 18172 KB Output is correct : V - N = 12
30 Correct 7 ms 16092 KB Output is correct : V - N = 12
31 Runtime error 9 ms 18188 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -