oj.uz

Submission #331860

# Submission time Handle Problem Language Result Execution time Memory
331860 2020-11-30T13:47:55 Z pit4h Airline Route Map (JOI18_airline) C++14
0 / 100
 736 ms 29780 KB 
#include<bits/stdc++.h>
#include "Alicelib.h"
using namespace std;
#define st first
#define nd second
#define mp make_pair
using pii = pair<int, int>;
const int MAXN = 1020, MAXB = 10;
int deg[MAXN];
vector<pii> edge;
void Alice( int N, int M, int A[], int B[] ){
	for(int i=0; i<M; ++i) {
		A[i]++; B[i]++;
		edge.push_back(mp(A[i], B[i]));
		deg[A[i]]++;
		deg[B[i]]++;
		A[i]--;
		B[i]--;
	}
	for(int i=1; i<=N; ++i) {
		if(!deg[i]) continue;
		for(int j=0; j<MAXB; ++j) {
			if((1<<j)&i) {
				edge.push_back(mp(i, N+1+j));
			}
		}
	}
	for(int i=0; i<MAXB; ++i) {
		edge.push_back(mp(N+MAXB+1, N+i+1));
	}
	for(int i=0; i<MAXB/2; ++i) {
		for(int j=MAXB-1; j>=MAXB-1-i; --j) {
			edge.push_back(mp(N+i+1, N+j+1));
		}
	}
	edge.push_back(mp(N+MAXB+2, N+MAXB+1));

	InitG(N+MAXB+2, edge.size());
	for(int i=0; i<(int)edge.size(); ++i) {
		MakeG(i, edge[i].st-1, edge[i].nd-1);
		//cerr<<edge[i].st<<' '<<edge[i].nd<<'\n';
	}
}


#include "Boblib.h"
#include<bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define mp make_pair
using pii = pair<int, int>;
const int MAXN = 1020, MAXB = 10;
int N;
int root, bits[MAXN], first_bit, mid_bit, id[MAXN];
bool node[MAXN], is_bit[MAXN], sec_half[MAXN];
vector<int> g[MAXN], gb[MAXN];
vector<pii> edges;

void Bob( int V, int U, int C[], int D[] ){
	N = V - (MAXB+2);
	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) {
		node[i] = 1;
		if((int)g[i].size()==1) {
			root = i;
			node[i] = 0;
		}
	}
	int spec = g[root][0];
	node[spec] = 0;
	for(int i: g[spec]) {
		if(i == root) continue;
		is_bit[i] = 1;
		node[i] = 0;
	}
	for(int i=0; i<U; ++i) {
		if(is_bit[C[i]] && is_bit[D[i]]) {
			gb[C[i]].push_back(D[i]);
			gb[D[i]].push_back(C[i]);
		}
	}
	int cnt_cand=0;
	for(int i=0; i<V; ++i) {
		if((int)gb[i].size()==1 && (int)g[i].size() >= N/2+2) {
			first_bit = i;
			cnt_cand++;
		}
	}
	assert(cnt_cand==1);
	for(int i=0; i<V; ++i) {
		if((int)gb[i].size()==MAXB/2) {
			bool ok = 1;
			for(int j: gb[i]) {
				if(j==first_bit) ok=0;
			}
			if(ok) mid_bit = i;
		}
	}
	for(int i: gb[mid_bit]) {
		sec_half[i] = 1;
	}
	for(int i=0; i<V; ++i) {
		if(!is_bit[i]) continue;
		int num = gb[i].size();
		if(!sec_half[i]) {
			bits[i] = num-1;
		}
		else {
			bits[i] = MAXB/2+num-1;
		}
	}
	
	for(int i=0; i<V; ++i) {
		if(!node[i]) continue;
		for(int j: g[i]) {
			if(is_bit[j]) {
				id[i] += (1<<bits[j]);
			}
		}
		id[i]--;
	}
	for(int i=0; i<U; ++i) {
		if(node[C[i]] && node[D[i]]) edges.push_back(mp(id[C[i]], id[D[i]]));
	}
	InitMap(V-(MAXB+2), edges.size());
	int NN = V - (MAXB+2);
	for(auto i: edges) {
		assert(i.st>=0 && i.nd>=0);
		MakeMap(i.st, i.nd);	
	}
}

Compilation message

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:85:6: warning: unused variable 'NN' [-Wunused-variable]
   85 |  int NN = V - (MAXB+2);
      |      ^~

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5052 KB Output is correct
2 Correct 6 ms 5052 KB Output is correct
3 Correct 5 ms 4880 KB Output is correct
4 Runtime error 8 ms 6228 KB Execution killed with signal 6 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5052 KB Output is correct
2 Correct 6 ms 5052 KB Output is correct
3 Correct 5 ms 4880 KB Output is correct
4 Runtime error 8 ms 6228 KB Execution killed with signal 6 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 736 ms 29780 KB Output is correct : V - N = 12
2 Correct 603 ms 26264 KB Output is correct : V - N = 12
3 Correct 212 ms 14544 KB Output is correct : V - N = 12
4 Runtime error 13 ms 6852 KB Execution killed with signal 6 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -