oj.uz

Submission #204133

# Submission time Handle Problem Language Result Execution time Memory
204133 2020-02-24T13:57:28 Z cheetose Meetings (JOI19_meetings) C++17
29 / 100
 2000 ms 12596 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<ld> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };

#include "meetings.h"
#define kill kool
Vi v[2005];
int num[2005][2005];
void discon(int x, int y)
{
	int i=num[x][y];
	int z=v[x].back();
	int j=num[x][z];
	swap(v[x][i],v[x][j]);
	num[x][z]=i;
	num[x][y]=-1;
	v[x].pop_back();
	i=num[y][x];
	z=v[y].back();
	j=num[y][z];
	swap(v[y][i],v[y][j]);
	num[y][z]=i;
	num[y][x]=-1;
	v[y].pop_back();
}
void con(int x, int y)
{
	v[x].pb(y);
	num[x][y]=(int)v[x].size()-1;
	v[y].pb(x);
	num[y][x]=(int)v[y].size()-1;
}
 
bool chk[2005], kill[2005];
int sz[2005];
int getSz(int N, int pp)
{
	sz[N] = 1;
	for (int next : v[N])
	{
		if (next == pp || kill[next])continue;
		sz[N] += getSz(next, N);
	}
	return sz[N];
}
int get_centroid(int N, int pp, int cap)
{
	for (int next : v[N])
	{
		if (kill[next] || next == pp)continue;
		if (sz[next]>cap) return get_centroid(next, N, cap);
	}
	return N;
}
void Solve(int N)
{
	chk[0] = chk[1] = chk[2] = 1;
	int w = Query(0, 1, 2);
	if (w>2)
	{
		chk[w] = 1;
		con(0, w); con(1, w); con(2, w);
	}
	else
	{
		fup(i, 0, 2, 1)if (w != i)con(i, w);
	}
	fup(i, 3, N - 1, 1)
	{
		if (chk[i])continue;
		chk[i] = 1;
		MEM0(kill);
		int pr = 0;
		while (1)
		{
			int cap = getSz(pr, -1);
			int R = get_centroid(pr, -1, cap / 2);
			kill[R] = 1;
			int t=-1;
			fup(j, 1, (int)v[R].size() - 1, 2)
			{
				int a = v[R][j - 1], b = v[R][j];
				int x = Query(a, i, b);
				if (x == i)
				{
					int T = Query(R, i, a);
					if (T == i)
					{
						discon(R, a);
						con(R, i); con(i, a);
					}
					else
					{
						discon(R, b);
						con(R, i); con(i, b);
					}
					goto FIN;
				}
				else if(x!=R)t=x;
			}
			if (v[R].size() & 1)
			{
				int x = Query(R, i, v[R].back());
				if (x == i)
				{
					int B = v[R].back();
					discon(R, B);
					con(R, i); con(i, B);
					goto FIN;
				}
				else if(x!=R)t=x;
			}
			if (t == -1)
			{
				con(R, i);
				goto FIN;
			}
			else
			{
				pr = t;
			}
		}
	FIN:;
	}
	fup(i, 0, N - 1, 1)
	{
		for (int x : v[i])
		{
			if (x>i)Bridge(i,x);
		}
	}
}/*
int main() {
	
}*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 508 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 5 ms 536 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 508 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 5 ms 536 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 632 KB Output is correct
15 Correct 5 ms 636 KB Output is correct
16 Correct 5 ms 632 KB Output is correct
17 Correct 5 ms 632 KB Output is correct
18 Correct 5 ms 632 KB Output is correct
19 Correct 5 ms 632 KB Output is correct
20 Correct 5 ms 504 KB Output is correct
21 Correct 5 ms 632 KB Output is correct
22 Correct 5 ms 632 KB Output is correct
23 Correct 5 ms 636 KB Output is correct
24 Correct 5 ms 632 KB Output is correct
25 Correct 5 ms 632 KB Output is correct
26 Correct 5 ms 632 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 508 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 5 ms 536 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 632 KB Output is correct
15 Correct 5 ms 636 KB Output is correct
16 Correct 5 ms 632 KB Output is correct
17 Correct 5 ms 632 KB Output is correct
18 Correct 5 ms 632 KB Output is correct
19 Correct 5 ms 632 KB Output is correct
20 Correct 5 ms 504 KB Output is correct
21 Correct 5 ms 632 KB Output is correct
22 Correct 5 ms 632 KB Output is correct
23 Correct 5 ms 636 KB Output is correct
24 Correct 5 ms 632 KB Output is correct
25 Correct 5 ms 632 KB Output is correct
26 Correct 5 ms 632 KB Output is correct
27 Correct 15 ms 1656 KB Output is correct
28 Correct 15 ms 1784 KB Output is correct
29 Correct 16 ms 1656 KB Output is correct
30 Correct 14 ms 1788 KB Output is correct
31 Correct 16 ms 1784 KB Output is correct
32 Correct 14 ms 1656 KB Output is correct
33 Correct 18 ms 1656 KB Output is correct
34 Correct 18 ms 1784 KB Output is correct
35 Correct 17 ms 1656 KB Output is correct
36 Correct 12 ms 1784 KB Output is correct
37 Correct 14 ms 1784 KB Output is correct
38 Correct 15 ms 1784 KB Output is correct
39 Correct 13 ms 1656 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1107 ms 12280 KB Output is correct
2 Correct 1218 ms 12280 KB Output is correct
3 Correct 986 ms 12284 KB Output is correct
4 Correct 1115 ms 12408 KB Output is correct
5 Correct 672 ms 12596 KB Output is correct
6 Correct 525 ms 11816 KB Output is correct
7 Correct 735 ms 9720 KB Output is correct
8 Correct 799 ms 9592 KB Output is correct
9 Correct 918 ms 9464 KB Output is correct
10 Correct 739 ms 9576 KB Output is correct
11 Correct 921 ms 9364 KB Output is correct
12 Correct 900 ms 12396 KB Output is correct
13 Correct 1237 ms 10980 KB Output is correct
14 Correct 1472 ms 9080 KB Output is correct
15 Correct 1593 ms 9356 KB Output is correct
16 Correct 1419 ms 9208 KB Output is correct
17 Correct 792 ms 8952 KB Output is correct
18 Execution timed out 2287 ms 8912 KB Time limit exceeded
19 Halted 0 ms 0 KB -