oj.uz

답안 #49950

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
49950 2018-06-05T05:06:35 Z MatheusLealV Amusement Park (JOI17_amusement_park) C++17
100 / 100
 52 ms 8792 KB 
#include "Joi.h"
#include <bits/stdc++.h>
#define maxn 10005
#define f first
#define s second
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
 
static int idx[maxn], pai[maxn], deep[maxn], cnt, maior;
 
static vector<int> grafo[maxn], tree[maxn];
 
void dfs(int x)
{
	idx[x] = cnt++;
 
	maior = max(maior, deep[x] + 1);
 
	for(auto v: grafo[x])
	{
		if(idx[v] != -1) continue;
 
		pai[v] = x;
 
		deep[v] = deep[x] + 1;
 
		tree[x].push_back(v);
 
		tree[v].push_back(x);
 
		dfs(v);
	}
}
 
bool op2(int a, int b)
{
	return (a*a) % 158987 <  (b*b) % 158987;
}
 
void Joi(int N, int M, int A[], int B[], ll X, int T)
{
	memset(idx, -1, sizeof idx);
 
	for(int i = 0; i < M; i++)
	{
		grafo[A[i]].push_back(B[i]);
 
		grafo[B[i]].push_back(A[i]);
	}
 
	for(int i = 0; i < N; i++) sort(grafo[i].begin(), grafo[i].end(),op2);
 
	dfs(0);
 
	if(maior >= 60)
	{
		for(int i = 0; i < N; i++)
		{
			deep[i] %= 60;
 
			if(X & (1LL<<deep[i])) MessageBoard(i, 1);
 
			else MessageBoard(i, 0);
		}
	}
 
	else
	{
		for(int i = 0; i < N; i++)
		{
			idx[i] = idx[i] % 60;
 
			if(X & (1LL<<idx[i])) MessageBoard(i, 1);
 
			else MessageBoard(i, 0);
		}
	}
}
#include "Ioi.h"
#include <bits/stdc++.h>
#define maxn 10005
#define f first
#define s second
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
 
static ll idx2[maxn], pai2[maxn], deep2[maxn], cnt2, maior2, dp[maxn];
 
static ll opt[maxn], ini[maxn], fim[maxn], save[maxn];
 
static vector<ll> grafo2[maxn], tree2[maxn], euler;
 
static ll ans = 0;
 
static set<ll> usados, tem[maxn];
 
void dfs2(int x)
{
	idx2[x] = cnt2++;
 
	euler.push_back(x);
 
	maior2 = max(maior2, deep2[x] + 1);
 
	dp[x] = 0;
 
	for(auto v: grafo2[x])
	{
		if(idx2[v] != -1) continue;
 
		pai2[v] = x;
 
		deep2[v] = deep2[x] + 1;
 
		tree2[x].push_back(v);
 
		tree2[v].push_back(x);
 
		dfs2(v);
 
		euler.push_back(x);
 
		if(dp[v] + 1 > dp[x]) dp[x] = dp[v] + 1, opt[x] = v;
	}
}
 
bool op(int a, int b)
{
	return (a*a) % 158987 <  (b*b) % 158987;
}
 
ll Ioi(int N, int M, int A[], int B[], int P, int V, int T)
{
	memset(idx2, -1, sizeof idx2);
 
	int Vo = V;
 
	for(int i = 0; i < M; i++)
	{
		grafo2[A[i]].push_back(B[i]);
 
		grafo2[B[i]].push_back(A[i]);
	}
 
	for(int i = 0; i < N; i++) sort(grafo2[i].begin(), grafo2[i].end(), op);
 
	dfs2(0);
 
	if(maior2 >= 60)
	{
		usados.insert(deep2[P] % 60);
 
		if(V) ans += (1LL<< (deep2[P]%60) );
 
		while(P != 0 and usados.size() < 60)
		{
			ll val = Move(pai2[P]), aux = deep2[pai2[P]]%60;
 
			if(val && !usados.count(aux)) ans += (1LL<< (aux) );
 
			usados.insert(aux);
 
			P = pai2[P];
		}
 
		if(usados.size() >= 60) return ans;
 
		while(usados.size() < 60)
		{
			ll val = Move(opt[P]), aux = deep2[opt[P]]%60;
 
			if(val && !usados.count(aux)) ans += (1LL<< (aux) );
 
			usados.insert(aux);
 
			P = opt[P];	
		}
 
		return ans;
	}
  
	for(int i = 0; i < N; i++) idx2[i] = (idx2[i] % 60);
 
	ll t = 0, save;
 
	for(int i = 0; i < euler.size(); i++)
	{
		if(euler[i] == P)
		{
			t = save = i;
 
			break;
		}
	}
 
	ll pos = 0;
 
	pos |= (1LL<<idx2[P]);
 
	t ++;
 
	for(int cnt = 0; cnt < 120 ; cnt ++)
	{
		if(t >= euler.size() - 1) t = 0;
 
		ll x = euler[t];
 
		pos |= (1LL<<idx2[x]);
 
		t ++;
	}
 
	//cout<<pos<<" "<<((1LL<<60) - 1LL)<<"\n";

	int limite = (T == 2 ? 500 : 120);
 
	if(pos == ((1LL<<60) - 1LL))
	{
		if(Vo) ans |= (1LL<<idx2[P]);
 
		t = save + 1;
 
		for(int cnt = 0; cnt < limite ; cnt ++)
		{
			if(t >= euler.size() - 1) t = 0;
 
			ll x = euler[t];
 
			V = Move(x);
 
			if(V) ans |= (1LL<<idx2[x]);
 
			t ++;
		}
 
		//cout<<ans<<"\n";
 
		return ans;
	}
	else
	{
		//for(auto tt: euler) cout<<tt<<" ";
 
		//cout<<"\n";
		if(Vo) ans |= (1LL<<idx2[P]);
 
		t = save - 1;
 
		ll aux = 1LL<<idx2[P];
 
		for(int cnt = 0; cnt < limite; cnt ++)
		{
			if(t <= 0) t = euler.size() - 1;
 
			ll x = euler[t];
 
			V = Move(x);
 
			aux |= (1LL<<idx2[x]);
 
			if(V) ans |= (1LL<<idx2[x]);
 
			t --;
		}
 
		//cout<<aux<<" "<<((1LL<<60) - 1LL)<<"\n";
 
		return ans;
	}
}

Compilation message

Ioi.cpp: In function 'll Ioi(int, int, int*, int*, int, int, int)':
Ioi.cpp:109:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < euler.size(); i++)
                 ~~^~~~~~~~~~~~~~
Ioi.cpp:127:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(t >= euler.size() - 1) t = 0;
      ~~^~~~~~~~~~~~~~~~~~~
Ioi.cpp:148:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(t >= euler.size() - 1) t = 0;
       ~~^~~~~~~~~~~~~~~~~~~
Ioi.cpp: At global scope:
Ioi.cpp:12:44: warning: 'save' defined but not used [-Wunused-variable]
 static ll opt[maxn], ini[maxn], fim[maxn], save[maxn];
                                            ^~~~
Ioi.cpp:12:33: warning: 'fim' defined but not used [-Wunused-variable]
 static ll opt[maxn], ini[maxn], fim[maxn], save[maxn];
                                 ^~~
Ioi.cpp:12:22: warning: 'ini' defined but not used [-Wunused-variable]
 static ll opt[maxn], ini[maxn], fim[maxn], save[maxn];
                      ^~~
Ioi.cpp: In function 'll Ioi(int, int, int*, int*, int, int, int)':
Ioi.cpp:144:5: warning: 'save' may be used uninitialized in this function [-Wmaybe-uninitialized]
   t = save + 1;
   ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2404 KB Output is correct
2 Correct 7 ms 3140 KB Output is correct
3 Correct 6 ms 3372 KB Output is correct
4 Correct 6 ms 3496 KB Output is correct
5 Correct 7 ms 3520 KB Output is correct
6 Correct 5 ms 3544 KB Output is correct
7 Correct 8 ms 3544 KB Output is correct
8 Correct 6 ms 3544 KB Output is correct
9 Correct 7 ms 3644 KB Output is correct
10 Correct 7 ms 3744 KB Output is correct
11 Correct 11 ms 3796 KB Output is correct
12 Correct 6 ms 3848 KB Output is correct
13 Correct 6 ms 3848 KB Output is correct
14 Correct 7 ms 3848 KB Output is correct
15 Correct 7 ms 3848 KB Output is correct
16 Correct 6 ms 3848 KB Output is correct
17 Correct 6 ms 3848 KB Output is correct
18 Correct 6 ms 3848 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 7204 KB Output is correct
2 Correct 38 ms 8668 KB Output is correct
3 Correct 40 ms 8784 KB Output is correct
4 Correct 26 ms 8784 KB Output is correct
5 Correct 38 ms 8784 KB Output is correct
6 Correct 30 ms 8784 KB Output is correct
7 Correct 37 ms 8784 KB Output is correct
8 Correct 26 ms 8784 KB Output is correct
9 Correct 36 ms 8784 KB Output is correct
10 Correct 24 ms 8784 KB Output is correct
11 Correct 24 ms 8784 KB Output is correct
12 Correct 26 ms 8784 KB Output is correct
13 Correct 34 ms 8784 KB Output is correct
14 Correct 29 ms 8784 KB Output is correct
15 Correct 31 ms 8784 KB Output is correct
16 Correct 28 ms 8784 KB Output is correct
17 Correct 27 ms 8784 KB Output is correct
18 Correct 30 ms 8784 KB Output is correct
19 Correct 37 ms 8784 KB Output is correct
20 Correct 20 ms 8784 KB Output is correct
21 Correct 23 ms 8784 KB Output is correct
22 Correct 26 ms 8784 KB Output is correct
23 Correct 28 ms 8784 KB Output is correct
24 Correct 41 ms 8784 KB Output is correct
25 Correct 38 ms 8784 KB Output is correct
26 Correct 37 ms 8784 KB Output is correct
27 Correct 25 ms 8784 KB Output is correct
28 Correct 27 ms 8784 KB Output is correct
29 Correct 30 ms 8784 KB Output is correct
30 Correct 36 ms 8784 KB Output is correct
31 Correct 7 ms 8784 KB Output is correct
32 Correct 7 ms 8784 KB Output is correct
33 Correct 8 ms 8784 KB Output is correct
34 Correct 6 ms 8784 KB Output is correct
35 Correct 6 ms 8784 KB Output is correct
36 Correct 6 ms 8784 KB Output is correct
37 Correct 6 ms 8784 KB Output is correct
38 Correct 6 ms 8784 KB Output is correct
39 Correct 7 ms 8784 KB Output is correct
40 Correct 6 ms 8784 KB Output is correct
41 Correct 5 ms 8784 KB Output is correct
42 Correct 5 ms 8784 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8784 KB Output is correct
2 Correct 6 ms 8784 KB Output is correct
3 Correct 7 ms 8784 KB Output is correct
4 Correct 10 ms 8784 KB Output is correct
5 Correct 8 ms 8784 KB Output is correct
6 Correct 10 ms 8784 KB Output is correct
7 Correct 10 ms 8784 KB Output is correct
8 Correct 9 ms 8784 KB Output is correct
9 Correct 22 ms 8784 KB Output is correct
10 Correct 27 ms 8784 KB Output is correct
11 Correct 23 ms 8784 KB Output is correct
12 Correct 5 ms 8784 KB Output is correct
13 Correct 6 ms 8784 KB Output is correct
14 Correct 6 ms 8784 KB Output is correct
15 Correct 6 ms 8784 KB Output is correct

Subtask #4
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 8784 KB Output is correct
2 Correct 52 ms 8784 KB Output is correct
3 Correct 40 ms 8784 KB Output is correct
4 Correct 26 ms 8784 KB Output is correct
5 Correct 30 ms 8784 KB Output is correct
6 Correct 35 ms 8784 KB Output is correct
7 Correct 27 ms 8784 KB Output is correct
8 Correct 27 ms 8784 KB Output is correct
9 Correct 25 ms 8784 KB Output is correct
10 Correct 24 ms 8784 KB Output is correct
11 Correct 27 ms 8784 KB Output is correct
12 Correct 31 ms 8784 KB Output is correct
13 Correct 23 ms 8784 KB Output is correct
14 Correct 24 ms 8784 KB Output is correct
15 Correct 30 ms 8784 KB Output is correct
16 Correct 24 ms 8784 KB Output is correct
17 Correct 26 ms 8784 KB Output is correct
18 Correct 34 ms 8784 KB Output is correct
19 Correct 28 ms 8784 KB Output is correct
20 Correct 20 ms 8784 KB Output is correct
21 Correct 20 ms 8784 KB Output is correct
22 Correct 27 ms 8784 KB Output is correct
23 Correct 25 ms 8784 KB Output is correct
24 Correct 26 ms 8784 KB Output is correct
25 Correct 26 ms 8784 KB Output is correct
26 Correct 26 ms 8784 KB Output is correct
27 Correct 28 ms 8784 KB Output is correct
28 Correct 27 ms 8784 KB Output is correct
29 Correct 26 ms 8784 KB Output is correct
30 Correct 25 ms 8784 KB Output is correct

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 8788 KB Output is correct
2 Correct 38 ms 8792 KB Output is correct
3 Correct 48 ms 8792 KB Output is correct
4 Correct 30 ms 8792 KB Output is correct
5 Correct 25 ms 8792 KB Output is correct
6 Correct 27 ms 8792 KB Output is correct
7 Correct 27 ms 8792 KB Output is correct
8 Correct 28 ms 8792 KB Output is correct
9 Correct 27 ms 8792 KB Output is correct
10 Correct 27 ms 8792 KB Output is correct
11 Correct 25 ms 8792 KB Output is correct
12 Correct 25 ms 8792 KB Output is correct
13 Correct 31 ms 8792 KB Output is correct
14 Correct 28 ms 8792 KB Output is correct
15 Correct 34 ms 8792 KB Output is correct
16 Correct 27 ms 8792 KB Output is correct
17 Correct 30 ms 8792 KB Output is correct
18 Correct 33 ms 8792 KB Output is correct
19 Correct 26 ms 8792 KB Output is correct
20 Correct 20 ms 8792 KB Output is correct
21 Correct 20 ms 8792 KB Output is correct
22 Correct 28 ms 8792 KB Output is correct
23 Correct 30 ms 8792 KB Output is correct
24 Correct 39 ms 8792 KB Output is correct
25 Correct 31 ms 8792 KB Output is correct
26 Correct 26 ms 8792 KB Output is correct
27 Correct 29 ms 8792 KB Output is correct
28 Correct 26 ms 8792 KB Output is correct
29 Correct 25 ms 8792 KB Output is correct
30 Correct 24 ms 8792 KB Output is correct
31 Correct 5 ms 8792 KB Output is correct
32 Correct 6 ms 8792 KB Output is correct
33 Correct 6 ms 8792 KB Output is correct
34 Correct 6 ms 8792 KB Output is correct
35 Correct 5 ms 8792 KB Output is correct
36 Correct 6 ms 8792 KB Output is correct
37 Correct 5 ms 8792 KB Output is correct
38 Correct 5 ms 8792 KB Output is correct
39 Correct 5 ms 8792 KB Output is correct
40 Correct 6 ms 8792 KB Output is correct
41 Correct 6 ms 8792 KB Output is correct
42 Correct 6 ms 8792 KB Output is correct