oj.uz

답안 #293927

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
293927 2020-09-08T13:47:40 Z mjkocijan Amusement Park (JOI17_amusement_park) C++14
65 / 100
 31 ms 5252 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;
	int calls = 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 || calls >= 120) return;
		
		for (int i: g[cv]) {
			if (i == par[cv]) continue;
			
			if (bio[i]) continue;
			
			if (cnt == 60 || calls >= 120) return;
			
			calls++;
			dfs2(i, Move(i), 0);
			
			if (cnt == 60 || calls >= 120) return;
		}
		if (cnt == 60 || calls >= 120) return;
		
		if (par[cv] != -1
		//&& isrt
		)
		{
			if (cnt == 60 || calls >= 120) return;
			calls++;
			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
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1816 KB Output is correct
2 Correct 2 ms 1800 KB Output is correct
3 Correct 2 ms 1932 KB Output is correct
4 Correct 2 ms 1812 KB Output is correct
5 Correct 2 ms 1804 KB Output is correct
6 Correct 2 ms 1796 KB Output is correct
7 Correct 2 ms 2176 KB Output is correct
8 Correct 2 ms 2048 KB Output is correct
9 Incorrect 2 ms 1932 KB Wrong Answer [7]
10 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 5160 KB Output is correct
2 Correct 28 ms 5252 KB Output is correct
3 Correct 30 ms 5140 KB Output is correct
4 Correct 18 ms 3588 KB Output is correct
5 Correct 17 ms 4148 KB Output is correct
6 Correct 19 ms 4108 KB Output is correct
7 Correct 17 ms 3788 KB Output is correct
8 Correct 17 ms 3916 KB Output is correct
9 Correct 17 ms 4172 KB Output is correct
10 Correct 15 ms 3660 KB Output is correct
11 Correct 16 ms 3532 KB Output is correct
12 Correct 17 ms 3392 KB Output is correct
13 Correct 15 ms 3388 KB Output is correct
14 Correct 18 ms 3544 KB Output is correct
15 Incorrect 17 ms 3592 KB Wrong Answer [7]
16 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1804 KB Output is correct
2 Correct 2 ms 1804 KB Output is correct
3 Correct 2 ms 1796 KB Output is correct
4 Correct 4 ms 2340 KB Output is correct
5 Correct 4 ms 2340 KB Output is correct
6 Correct 5 ms 2392 KB Output is correct
7 Correct 5 ms 2340 KB Output is correct
8 Correct 4 ms 2400 KB Output is correct
9 Correct 16 ms 4668 KB Output is correct
10 Correct 15 ms 4556 KB Output is correct
11 Correct 15 ms 4668 KB Output is correct
12 Correct 2 ms 1808 KB Output is correct
13 Correct 2 ms 1808 KB Output is correct
14 Correct 2 ms 1796 KB Output is correct
15 Correct 2 ms 1668 KB Output is correct

Subtask #4
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 4964 KB Output is correct
2 Correct 30 ms 5164 KB Output is correct
3 Correct 31 ms 5148 KB Output is correct
4 Correct 17 ms 3580 KB Output is correct
5 Correct 18 ms 4416 KB Output is correct
6 Correct 18 ms 4164 KB Output is correct
7 Correct 19 ms 4300 KB Output is correct
8 Correct 17 ms 3788 KB Output is correct
9 Correct 18 ms 3844 KB Output is correct
10 Correct 15 ms 3684 KB Output is correct
11 Correct 16 ms 3668 KB Output is correct
12 Correct 18 ms 3392 KB Output is correct
13 Correct 15 ms 3388 KB Output is correct
14 Correct 17 ms 3536 KB Output is correct
15 Correct 17 ms 3532 KB Output is correct
16 Correct 18 ms 3532 KB Output is correct
17 Correct 17 ms 3572 KB Output is correct
18 Correct 18 ms 3532 KB Output is correct
19 Correct 17 ms 3532 KB Output is correct
20 Correct 15 ms 4132 KB Output is correct
21 Correct 15 ms 4128 KB Output is correct
22 Correct 18 ms 3928 KB Output is correct
23 Correct 18 ms 3956 KB Output is correct
24 Correct 18 ms 3960 KB Output is correct
25 Correct 18 ms 4164 KB Output is correct
26 Correct 20 ms 3788 KB Output is correct
27 Correct 18 ms 4016 KB Output is correct
28 Correct 18 ms 3788 KB Output is correct
29 Correct 15 ms 3644 KB Output is correct
30 Correct 19 ms 3836 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 30 ms 4964 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -