oj.uz

Submission #1071525

# Submission time Handle Problem Language Result Execution time Memory
1071525 2024-08-23T08:08:08 Z abczz Airline Route Map (JOI18_airline) C++17
0 / 100
 365 ms 51536 KB 
#include "Alicelib.h"
#include <cassert>
#include <cstdio>
#include <iostream>
#include <array>
#include <vector>
#define ll long long

using namespace std;

void Alice( int N, int M, int A[], int B[] ){
	if (N == 1) {
		InitG(1, 0);
		return;
	}
	vector <array<ll, 2>> V;
	ll k = N, tot = 0, cnt = N;
	while (k) {
		k /= 2;
		++tot;
	}
	for (int i=0; i<M; ++i) {
		V.push_back({A[i], B[i]});
	}
	k = 1;
	for (int i=0; i<tot; ++i) {
		for (int j=0; j<N; ++j) {
			if ((j+1) & k) V.push_back({cnt, j});
		}
		if (i != tot-1) V.push_back({cnt, cnt+1});
		++cnt, k *= 2;
	}
	for (int i=0; i<cnt; ++i) {
		if (N == i) continue;
		V.push_back({i, cnt});
	}
	if (N < 10) {
		for (int i=1; i<5; ++i) {
			++cnt;
			V.push_back({cnt-i, cnt});
		}
	}
	++cnt;
	for (int j=N; j<N+tot; ++j) {
		V.push_back({j, cnt});
	}
	++cnt;
	InitG(cnt, V.size());
	int i = 0;
	for (auto [a, b] : V) {
		//cout << a << " " << b << endl;
		MakeG(i++, a, b);
	}
}


#include "Boblib.h"
#include <cassert>
#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#define ll long long

using namespace std;

ll in[2000], F[2000];
bool B[2000], G[2000];
vector <ll> adj[2000], Q;
vector <array<ll, 2> > V, X;
ll n, x, z, rt = 0, st = 0;

void dfs(ll u, ll p, ll k) {
	for (auto v : adj[u]) {
		if (!G[v] && v != rt && v != z) {
			F[v] += k;
		}
	}
	for (auto v : adj[u]) {
		if (G[v] && v != p) dfs(v, u, k*2);
	}
}
void Bob( int Z, int U, int C[], int D[] ){
	if (U == 0) {
		InitMap(1, 0);
		return;
	}
	n = Z;
	Q.clear();
	V.clear();
	X.clear();
	for (int i=0; i<n; ++i) in[i] = B[i] = F[i] = G[i] = 0, adj[i].clear();
	for (int i=0; i<U; ++i) {
		++in[C[i]], ++in[D[i]];
		adj[C[i]].push_back(D[i]);
		adj[D[i]].push_back(C[i]);
	}
	x = 0;
	for (int i=0; i<n; ++i) {
		if (in[i] == 1) --x;
		if (in[i] == n-3) {
			rt = i;
		}
	}
	B[rt] = 1;
	for (auto v : adj[rt]) {
		B[v] = 1;
	}
	z = rt;
	for (int i=0; i<n; ++i) {
		if (!B[i]) {
			Q.push_back(i);
		}
	}
	//cout << adj[Q[0]].size() << " " << adj[Q[1]].size() << endl;
	if (adj[Q[0]].size() >= adj[Q[1]].size()) rt = Q[1], st = Q[0];
	else rt = Q[0], st = Q[1];
	x += Z-2-adj[rt].size();
	for (auto v : adj[rt]) {
		in[v] -= 2;
		G[v] = 1;
	}
	dfs(st, -1, 1);
	/*for (int i=0; i<n; ++i) {
		cout << F[i] << " ";
	}
	cout << endl;*/
	for (int i=0; i<U; ++i) {
		if (F[C[i]] && F[D[i]]) {
			//cout << F[C[i]]-1 << " " << F[D[i]]-1 << endl;
			V.push_back({F[C[i]]-1, F[D[i]]-1});
		}
	}
	InitMap(x, V.size());
	for (auto [a, b] : V) {
		MakeMap(a, b);
	}
}

Compilation message

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:37:46: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   37 |  for (int i=0; i<n; ++i) in[i] = B[i] = F[i] = G[i] = 0, adj[i].clear();
      |                                         ~~~~~^~~~~~~~~~

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 15620 KB Output is correct
2 Correct 2 ms 15620 KB Output is correct
3 Correct 3 ms 15616 KB Output is correct
4 Correct 2 ms 13572 KB Output is correct
5 Correct 2 ms 15656 KB Output is correct
6 Correct 2 ms 15620 KB Output is correct
7 Incorrect 2 ms 15620 KB Wrong Answer [12]
8 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 15620 KB Output is correct
2 Correct 2 ms 15620 KB Output is correct
3 Correct 3 ms 15616 KB Output is correct
4 Correct 2 ms 13572 KB Output is correct
5 Correct 2 ms 15656 KB Output is correct
6 Correct 2 ms 15620 KB Output is correct
7 Incorrect 2 ms 15620 KB Wrong Answer [12]
8 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

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