oj.uz

Submission #293970

# Submission time Handle Problem Language Result Execution time Memory
293970 2020-09-08T14:10:33 Z mjkocijan Amusement Park (JOI17_amusement_park) C++14
75 / 100
 38 ms 5156 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]);
	}
	for (int i = 0; i < n; i++) if (i % 2 == 0) reverse(g[i].begin(), g[i].end());
	dfs(n - 1, -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++;//cout<<cv<<' '<<usao[cv]<<'.'<<cnt<<endl;
			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]);
	}
	for (int i = 0; i < n; i++) if (i % 2 == 0) reverse(g[i].begin(), g[i].end());
	dfs(n - 1, -1);
	memset(bio, 0, sizeof bio);
	dfs2(p, v, 1);
  //return 0LL;
  return reza;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1796 KB Output is correct
2 Correct 2 ms 1800 KB Output is correct
3 Correct 2 ms 2068 KB Output is correct
4 Correct 2 ms 1804 KB Output is correct
5 Correct 2 ms 1668 KB Output is correct
6 Correct 2 ms 1668 KB Output is correct
7 Correct 2 ms 2052 KB Output is correct
8 Correct 2 ms 1932 KB Output is correct
9 Correct 2 ms 2056 KB Output is correct
10 Correct 2 ms 1796 KB Output is correct
11 Correct 6 ms 2312 KB Output is correct
12 Correct 2 ms 1816 KB Output is correct
13 Correct 2 ms 1932 KB Output is correct
14 Correct 2 ms 1932 KB Output is correct
15 Correct 2 ms 2056 KB Output is correct
16 Correct 2 ms 1932 KB Output is correct
17 Correct 2 ms 1804 KB Output is correct
18 Correct 2 ms 2060 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 5092 KB Output is correct
2 Correct 34 ms 5156 KB Output is correct
3 Correct 38 ms 5092 KB Output is correct
4 Correct 20 ms 3572 KB Output is correct
5 Correct 17 ms 4044 KB Output is correct
6 Correct 20 ms 3816 KB Output is correct
7 Correct 17 ms 3660 KB Output is correct
8 Correct 18 ms 3824 KB Output is correct
9 Correct 23 ms 3836 KB Output is correct
10 Correct 15 ms 3532 KB Output is correct
11 Correct 16 ms 3680 KB Output is correct
12 Correct 18 ms 3396 KB Output is correct
13 Correct 18 ms 3260 KB Output is correct
14 Correct 20 ms 3620 KB Output is correct
15 Correct 20 ms 3532 KB Output is correct
16 Correct 17 ms 3592 KB Output is correct
17 Correct 20 ms 3580 KB Output is correct
18 Correct 17 ms 3532 KB Output is correct
19 Correct 20 ms 3568 KB Output is correct
20 Correct 15 ms 4132 KB Output is correct
21 Correct 15 ms 3916 KB Output is correct
22 Correct 17 ms 3844 KB Output is correct
23 Correct 18 ms 3788 KB Output is correct
24 Correct 17 ms 4148 KB Output is correct
25 Correct 18 ms 3788 KB Output is correct
26 Correct 18 ms 3936 KB Output is correct
27 Correct 19 ms 3788 KB Output is correct
28 Correct 17 ms 4152 KB Output is correct
29 Correct 16 ms 3644 KB Output is correct
30 Correct 17 ms 3780 KB Output is correct
31 Correct 2 ms 1804 KB Output is correct
32 Correct 2 ms 1668 KB Output is correct
33 Correct 2 ms 2044 KB Output is correct
34 Correct 2 ms 1796 KB Output is correct
35 Correct 2 ms 1800 KB Output is correct
36 Correct 2 ms 1668 KB Output is correct
37 Correct 2 ms 1804 KB Output is correct
38 Correct 2 ms 1668 KB Output is correct
39 Correct 2 ms 1668 KB Output is correct
40 Correct 2 ms 1804 KB Output is correct
41 Correct 2 ms 1796 KB Output is correct
42 Correct 2 ms 1796 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1816 KB Output is correct
2 Correct 2 ms 1668 KB Output is correct
3 Correct 2 ms 1816 KB Output is correct
4 Correct 4 ms 2400 KB Output is correct
5 Correct 4 ms 2212 KB Output is correct
6 Correct 4 ms 2396 KB Output is correct
7 Correct 4 ms 2212 KB Output is correct
8 Correct 4 ms 2396 KB Output is correct
9 Correct 17 ms 4668 KB Output is correct
10 Correct 17 ms 4676 KB Output is correct
11 Correct 15 ms 4428 KB Output is correct
12 Correct 2 ms 1804 KB Output is correct
13 Correct 2 ms 1796 KB Output is correct
14 Correct 2 ms 1804 KB Output is correct
15 Correct 2 ms 1668 KB Output is correct

Subtask #4
47.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 5092 KB Output is correct
2 Correct 36 ms 4956 KB Output is correct
3 Partially correct 37 ms 5156 KB Partially correct
4 Correct 20 ms 3580 KB Output is correct
5 Correct 18 ms 4184 KB Output is correct
6 Partially correct 25 ms 3788 KB Partially correct
7 Correct 18 ms 3660 KB Output is correct
8 Correct 18 ms 4172 KB Output is correct
9 Correct 18 ms 3788 KB Output is correct
10 Correct 18 ms 3668 KB Output is correct
11 Correct 17 ms 3532 KB Output is correct
12 Correct 17 ms 3648 KB Output is correct
13 Correct 19 ms 3396 KB Output is correct
14 Correct 17 ms 3616 KB Output is correct
15 Correct 17 ms 3584 KB Output is correct
16 Correct 17 ms 3580 KB Output is correct
17 Correct 17 ms 3532 KB Output is correct
18 Correct 17 ms 3576 KB Output is correct
19 Correct 20 ms 3580 KB Output is correct
20 Correct 15 ms 4132 KB Output is correct
21 Correct 15 ms 4128 KB Output is correct
22 Correct 19 ms 3832 KB Output is correct
23 Correct 23 ms 3788 KB Output is correct
24 Correct 20 ms 3860 KB Output is correct
25 Correct 18 ms 4148 KB Output is correct
26 Correct 20 ms 3840 KB Output is correct
27 Correct 19 ms 3916 KB Output is correct
28 Correct 22 ms 3844 KB Output is correct
29 Correct 19 ms 3880 KB Output is correct
30 Correct 17 ms 3920 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 4996 KB Output is correct
2 Correct 31 ms 5092 KB Output is correct
3 Correct 30 ms 4964 KB Output is correct
4 Correct 17 ms 3576 KB Output is correct
5 Correct 19 ms 3916 KB Output is correct
6 Correct 20 ms 3844 KB Output is correct
7 Correct 19 ms 3924 KB Output is correct
8 Correct 17 ms 3660 KB Output is correct
9 Correct 19 ms 4168 KB Output is correct
10 Correct 16 ms 3532 KB Output is correct
11 Correct 16 ms 3672 KB Output is correct
12 Correct 15 ms 3388 KB Output is correct
13 Correct 15 ms 3392 KB Output is correct
14 Correct 17 ms 3396 KB Output is correct
15 Incorrect 17 ms 3404 KB Output isn't correct
16 Halted 0 ms 0 KB -