oj.uz

답안 #293917

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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1796 KB Output is correct
2 Correct 2 ms 1796 KB Output is correct
3 Correct 2 ms 1932 KB Output is correct
4 Correct 2 ms 1796 KB Output is correct
5 Correct 2 ms 1796 KB Output is correct
6 Correct 2 ms 2020 KB Output is correct
7 Correct 2 ms 1932 KB Output is correct
8 Correct 2 ms 1932 KB Output is correct
9 Correct 2 ms 1932 KB Output is correct
10 Correct 2 ms 1800 KB Output is correct
11 Correct 6 ms 2316 KB Output is correct
12 Correct 2 ms 1800 KB Output is correct
13 Correct 2 ms 1936 KB Output is correct
14 Correct 3 ms 1936 KB Output is correct
15 Correct 2 ms 1936 KB Output is correct
16 Correct 2 ms 1920 KB Output is correct
17 Correct 2 ms 1936 KB Output is correct
18 Correct 2 ms 1936 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 5040 KB Output is correct
2 Correct 36 ms 5124 KB Output is correct
3 Correct 32 ms 5148 KB Output is correct
4 Correct 20 ms 3584 KB Output is correct
5 Correct 19 ms 3968 KB Output is correct
6 Correct 23 ms 3912 KB Output is correct
7 Correct 20 ms 3944 KB Output is correct
8 Correct 20 ms 4044 KB Output is correct
9 Correct 22 ms 4156 KB Output is correct
10 Correct 18 ms 3656 KB Output is correct
11 Correct 16 ms 3532 KB Output is correct
12 Correct 15 ms 3260 KB Output is correct
13 Correct 20 ms 3640 KB Output is correct
14 Correct 17 ms 3404 KB Output is correct
15 Correct 19 ms 3612 KB Output is correct
16 Correct 17 ms 3836 KB Output is correct
17 Correct 20 ms 3756 KB Output is correct
18 Correct 18 ms 3756 KB Output is correct
19 Correct 17 ms 3756 KB Output is correct
20 Correct 15 ms 4388 KB Output is correct
21 Correct 16 ms 4280 KB Output is correct
22 Correct 18 ms 4012 KB Output is correct
23 Correct 18 ms 4012 KB Output is correct
24 Correct 18 ms 4012 KB Output is correct
25 Correct 20 ms 4140 KB Output is correct
26 Correct 18 ms 4172 KB Output is correct
27 Correct 27 ms 4012 KB Output is correct
28 Correct 17 ms 4012 KB Output is correct
29 Correct 17 ms 3884 KB Output is correct
30 Correct 18 ms 4128 KB Output is correct
31 Correct 2 ms 1800 KB Output is correct
32 Correct 2 ms 1672 KB Output is correct
33 Correct 2 ms 1948 KB Output is correct
34 Correct 2 ms 1804 KB Output is correct
35 Correct 2 ms 1672 KB Output is correct
36 Correct 2 ms 1820 KB Output is correct
37 Correct 2 ms 1812 KB Output is correct
38 Correct 2 ms 1800 KB Output is correct
39 Correct 2 ms 1800 KB Output is correct
40 Correct 2 ms 2060 KB Output is correct
41 Correct 2 ms 1804 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 1808 KB Output is correct
2 Correct 2 ms 1804 KB Output is correct
3 Correct 2 ms 1668 KB Output is correct
4 Correct 4 ms 2212 KB Output is correct
5 Correct 4 ms 2212 KB Output is correct
6 Correct 4 ms 2212 KB Output is correct
7 Correct 4 ms 2340 KB Output is correct
8 Correct 4 ms 2340 KB Output is correct
9 Correct 15 ms 4676 KB Output is correct
10 Correct 15 ms 4428 KB Output is correct
11 Correct 15 ms 4664 KB Output is correct
12 Correct 2 ms 2060 KB Output is correct
13 Correct 2 ms 1800 KB Output is correct
14 Correct 2 ms 1812 KB Output is correct
15 Correct 2 ms 1668 KB Output is correct

Subtask #4
54.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 5092 KB Output is correct
2 Correct 30 ms 5092 KB Output is correct
3 Correct 30 ms 5268 KB Output is correct
4 Correct 19 ms 3532 KB Output is correct
5 Correct 17 ms 4408 KB Output is correct
6 Correct 17 ms 4044 KB Output is correct
7 Correct 18 ms 4048 KB Output is correct
8 Correct 17 ms 3788 KB Output is correct
9 Correct 18 ms 3848 KB Output is correct
10 Correct 16 ms 3532 KB Output is correct
11 Correct 18 ms 3668 KB Output is correct
12 Correct 16 ms 3396 KB Output is correct
13 Correct 16 ms 3356 KB Output is correct
14 Correct 17 ms 3612 KB Output is correct
15 Correct 17 ms 3532 KB Output is correct
16 Correct 18 ms 3532 KB Output is correct
17 Correct 18 ms 3572 KB Output is correct
18 Partially correct 20 ms 3544 KB Partially correct
19 Correct 18 ms 3532 KB Output is correct
20 Correct 15 ms 4124 KB Output is correct
21 Correct 15 ms 4132 KB Output is correct
22 Correct 19 ms 3916 KB Output is correct
23 Correct 17 ms 3820 KB Output is correct
24 Correct 18 ms 3956 KB Output is correct
25 Correct 18 ms 3924 KB Output is correct
26 Correct 17 ms 3948 KB Output is correct
27 Correct 17 ms 4152 KB Output is correct
28 Correct 17 ms 3800 KB Output is correct
29 Correct 16 ms 3772 KB Output is correct
30 Correct 17 ms 3840 KB Output is correct

Subtask #5
0 / 17.0

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