oj.uz

답안 #293872

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
293872 2020-09-08T13:21:09 Z mjkocijan Amusement Park (JOI17_amusement_park) C++14
82 / 100
 36 ms 5668 KB 
#include "Joi.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
#define X first
#define Y second
#define pb push_back
#define MAXN 20100

namespace JOI {
	int n, m;
	int a[MAXN], b[MAXN];
	ll x;
	int t;
	vector<int> g[MAXN];
	int tt = 0;
	int bio[MAXN];
	int usao[MAXN];

	void dfs(int cv, int rod)
	{
		if (bio[cv]) return;
		bio[cv] = 1;
		usao[cv] = tt;
		tt++;
		MessageBoard(cv, !!(x & (1LL << ll(usao[cv] % 60))));
		for (int i: g[cv]) {
			if (rod != i) {
				dfs(i, cv);
			}
		}
	}
}
using namespace JOI;

void Joi(int N, int M, int A[], int B[], long long X, int T) {
	n = N; m = M; x = X; t = T;
	for(int i = 0; i < N; i++){
		//MessageBoard(i, 0);
	}
	for (int i = 0; i < m; i++) {
		a[i] = A[i];
		b[i] = B[i];
		g[a[i]].pb(b[i]);
		g[b[i]].pb(a[i]);
	}
	dfs(0, -1);
}
#include "Ioi.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
#define X first
#define Y second
#define pb push_back
#define MAXN 20100

namespace IOI {
	int n, m;
	int a[MAXN], b[MAXN], par[MAXN];
	int p, v;
	int t;
	vector<int> g[MAXN];
	int tt = 0;
	int bio[MAXN];
	int usao[MAXN];
	ll reza = 0LL;
	int done[100], cnt = 0;

	void dfs(int cv, int rod)
	{
		if (bio[cv]) return;
		bio[cv] = 1;
		usao[cv] = tt;
		tt++;
		par[cv] = rod;
		for (int i: g[cv]) {
			if (rod != i) {
				dfs(i, cv);
			}
		}
	}

	void dfs2(int cv, int msg, int isrt)
	{
		bio[cv] = 1;
		
		int cu = usao[cv] % 60;
		if (!done[cu]) {
			cnt++;
			done[cu] = 1;
			reza |= ll(msg) * (1LL << ll(cu));
		}
		if (cnt == 60) return;
		
		for (int i: g[cv]) {
			if (i == par[cv]) continue;
			
			if (bio[i]) continue;
			
			dfs2(i, Move(i), 0);
			
			if (cnt == 60) return;
		}
		
		if (par[cv] != -1
		//&& isrt
		)
		{
			dfs2(par[cv], Move(par[cv]), 1);
		}
	}
}
using namespace IOI;

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
	n = N; m = M; p = P; v = V; t = T;
	for (int i = 0; i < m; i++) {
		a[i] = A[i];
		b[i] = B[i];
		g[a[i]].pb(b[i]);
		g[b[i]].pb(a[i]);
	}
	dfs(0, -1);
	memset(bio, 0, sizeof bio);
	dfs2(p, v, 1);
  //return 0LL;
  return reza;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1800 KB Output is correct
2 Correct 2 ms 1672 KB Output is correct
3 Correct 2 ms 2044 KB Output is correct
4 Correct 2 ms 1800 KB Output is correct
5 Correct 2 ms 1808 KB Output is correct
6 Correct 2 ms 1800 KB Output is correct
7 Correct 2 ms 2048 KB Output is correct
8 Correct 3 ms 2060 KB Output is correct
9 Correct 3 ms 2052 KB Output is correct
10 Correct 2 ms 1928 KB Output is correct
11 Correct 6 ms 2276 KB Output is correct
12 Correct 2 ms 1804 KB Output is correct
13 Correct 2 ms 1936 KB Output is correct
14 Correct 2 ms 2056 KB Output is correct
15 Correct 3 ms 2044 KB Output is correct
16 Correct 2 ms 2064 KB Output is correct
17 Correct 2 ms 2056 KB Output is correct
18 Correct 2 ms 1892 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 5428 KB Output is correct
2 Correct 33 ms 5532 KB Output is correct
3 Correct 34 ms 5500 KB Output is correct
4 Correct 20 ms 3852 KB Output is correct
5 Correct 20 ms 4404 KB Output is correct
6 Correct 18 ms 4076 KB Output is correct
7 Correct 19 ms 3956 KB Output is correct
8 Correct 20 ms 4156 KB Output is correct
9 Correct 18 ms 4028 KB Output is correct
10 Correct 16 ms 3904 KB Output is correct
11 Correct 16 ms 3776 KB Output is correct
12 Correct 16 ms 3620 KB Output is correct
13 Correct 25 ms 3644 KB Output is correct
14 Correct 20 ms 3860 KB Output is correct
15 Correct 20 ms 3988 KB Output is correct
16 Correct 20 ms 3772 KB Output is correct
17 Correct 20 ms 3772 KB Output is correct
18 Correct 20 ms 3772 KB Output is correct
19 Correct 19 ms 3804 KB Output is correct
20 Correct 17 ms 4340 KB Output is correct
21 Correct 20 ms 4092 KB Output is correct
22 Correct 18 ms 4120 KB Output is correct
23 Correct 19 ms 4192 KB Output is correct
24 Correct 18 ms 4076 KB Output is correct
25 Correct 23 ms 4156 KB Output is correct
26 Correct 18 ms 4084 KB Output is correct
27 Correct 22 ms 4168 KB Output is correct
28 Correct 18 ms 4028 KB Output is correct
29 Correct 18 ms 4132 KB Output is correct
30 Correct 19 ms 4104 KB Output is correct
31 Correct 2 ms 1800 KB Output is correct
32 Correct 2 ms 1804 KB Output is correct
33 Correct 2 ms 1936 KB Output is correct
34 Correct 2 ms 1800 KB Output is correct
35 Correct 2 ms 1832 KB Output is correct
36 Correct 2 ms 1996 KB Output is correct
37 Correct 2 ms 1808 KB Output is correct
38 Correct 2 ms 1816 KB Output is correct
39 Correct 2 ms 1808 KB Output is correct
40 Correct 6 ms 1852 KB Output is correct
41 Correct 2 ms 1800 KB Output is correct
42 Correct 2 ms 1800 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1816 KB Output is correct
2 Correct 2 ms 1800 KB Output is correct
3 Correct 3 ms 1808 KB Output is correct
4 Correct 4 ms 2244 KB Output is correct
5 Correct 4 ms 2244 KB Output is correct
6 Correct 4 ms 2244 KB Output is correct
7 Correct 5 ms 2372 KB Output is correct
8 Correct 4 ms 2396 KB Output is correct
9 Correct 15 ms 4680 KB Output is correct
10 Correct 15 ms 4668 KB Output is correct
11 Correct 18 ms 4668 KB Output is correct
12 Correct 2 ms 1800 KB Output is correct
13 Correct 2 ms 1800 KB Output is correct
14 Correct 2 ms 1800 KB Output is correct
15 Correct 2 ms 1800 KB Output is correct

Subtask #4
54.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 5668 KB Output is correct
2 Correct 34 ms 5424 KB Output is correct
3 Correct 36 ms 5652 KB Output is correct
4 Correct 20 ms 3836 KB Output is correct
5 Correct 19 ms 4524 KB Output is correct
6 Correct 25 ms 4172 KB Output is correct
7 Correct 18 ms 4156 KB Output is correct
8 Correct 20 ms 4132 KB Output is correct
9 Correct 18 ms 4092 KB Output is correct
10 Correct 16 ms 3904 KB Output is correct
11 Correct 17 ms 3776 KB Output is correct
12 Correct 16 ms 3632 KB Output is correct
13 Correct 19 ms 3644 KB Output is correct
14 Correct 17 ms 3864 KB Output is correct
15 Correct 18 ms 3772 KB Output is correct
16 Correct 19 ms 3836 KB Output is correct
17 Correct 17 ms 3836 KB Output is correct
18 Partially correct 27 ms 3780 KB Partially correct
19 Correct 20 ms 3760 KB Output is correct
20 Correct 18 ms 4344 KB Output is correct
21 Correct 19 ms 4384 KB Output is correct
22 Correct 18 ms 4156 KB Output is correct
23 Correct 18 ms 4028 KB Output is correct
24 Correct 18 ms 4028 KB Output is correct
25 Correct 18 ms 4028 KB Output is correct
26 Correct 18 ms 4444 KB Output is correct
27 Correct 20 ms 4420 KB Output is correct
28 Correct 18 ms 4096 KB Output is correct
29 Correct 17 ms 3880 KB Output is correct
30 Correct 17 ms 4016 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 32 ms 5416 KB Output isn't correct
2 Halted 0 ms 0 KB -