oj.uz

Submission #293951

# Submission time Handle Problem Language Result Execution time Memory
293951 2020-09-08T14:03:43 Z mjkocijan Amusement Park (JOI17_amusement_park) C++14
79 / 100
 39 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]);
	}
	for (int i = 0; i < n; i++) reverse(g[i].begin(), g[i].end());
	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++;//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++) reverse(g[i].begin(), g[i].end());
	dfs(0, -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 1808 KB Output is correct
2 Correct 2 ms 1808 KB Output is correct
3 Correct 2 ms 2048 KB Output is correct
4 Correct 2 ms 1928 KB Output is correct
5 Correct 2 ms 1812 KB Output is correct
6 Correct 2 ms 2052 KB Output is correct
7 Correct 2 ms 1936 KB Output is correct
8 Correct 2 ms 2056 KB Output is correct
9 Correct 2 ms 1808 KB Output is correct
10 Correct 2 ms 2052 KB Output is correct
11 Correct 8 ms 2324 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 2048 KB Output is correct
15 Correct 2 ms 1808 KB Output is correct
16 Correct 2 ms 1808 KB Output is correct
17 Correct 2 ms 1936 KB Output is correct
18 Correct 2 ms 1888 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 5424 KB Output is correct
2 Correct 36 ms 5412 KB Output is correct
3 Correct 33 ms 5540 KB Output is correct
4 Correct 19 ms 3756 KB Output is correct
5 Correct 18 ms 4012 KB Output is correct
6 Correct 18 ms 4012 KB Output is correct
7 Correct 20 ms 4124 KB Output is correct
8 Correct 19 ms 4164 KB Output is correct
9 Correct 19 ms 4168 KB Output is correct
10 Correct 16 ms 4060 KB Output is correct
11 Correct 17 ms 3760 KB Output is correct
12 Correct 19 ms 3476 KB Output is correct
13 Correct 16 ms 3476 KB Output is correct
14 Correct 19 ms 3876 KB Output is correct
15 Correct 20 ms 3896 KB Output is correct
16 Correct 20 ms 3628 KB Output is correct
17 Correct 18 ms 3836 KB Output is correct
18 Correct 18 ms 3756 KB Output is correct
19 Correct 19 ms 3724 KB Output is correct
20 Correct 16 ms 4384 KB Output is correct
21 Correct 15 ms 4140 KB Output is correct
22 Correct 18 ms 4012 KB Output is correct
23 Correct 18 ms 4140 KB Output is correct
24 Correct 18 ms 4012 KB Output is correct
25 Correct 20 ms 4200 KB Output is correct
26 Correct 20 ms 4140 KB Output is correct
27 Correct 17 ms 4176 KB Output is correct
28 Correct 18 ms 4156 KB Output is correct
29 Correct 17 ms 3872 KB Output is correct
30 Correct 17 ms 4100 KB Output is correct
31 Correct 2 ms 1672 KB Output is correct
32 Correct 2 ms 1804 KB Output is correct
33 Correct 2 ms 2040 KB Output is correct
34 Correct 2 ms 1800 KB Output is correct
35 Correct 2 ms 1936 KB Output is correct
36 Correct 2 ms 1672 KB Output is correct
37 Correct 2 ms 1808 KB Output is correct
38 Correct 2 ms 1672 KB Output is correct
39 Correct 2 ms 1672 KB Output is correct
40 Correct 2 ms 1800 KB Output is correct
41 Correct 2 ms 1800 KB Output is correct
42 Correct 2 ms 1808 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1824 KB Output is correct
2 Correct 2 ms 1812 KB Output is correct
3 Correct 2 ms 1672 KB Output is correct
4 Correct 4 ms 2228 KB Output is correct
5 Correct 4 ms 2356 KB Output is correct
6 Correct 4 ms 2388 KB Output is correct
7 Correct 4 ms 2392 KB Output is correct
8 Correct 4 ms 2364 KB Output is correct
9 Correct 17 ms 4932 KB Output is correct
10 Correct 15 ms 4928 KB Output is correct
11 Correct 20 ms 4524 KB Output is correct
12 Correct 2 ms 1800 KB Output is correct
13 Correct 2 ms 1672 KB Output is correct
14 Correct 2 ms 1800 KB Output is correct
15 Correct 2 ms 1800 KB Output is correct

Subtask #4
51.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 5668 KB Output is correct
2 Correct 31 ms 5420 KB Output is correct
3 Correct 34 ms 5412 KB Output is correct
4 Correct 19 ms 3756 KB Output is correct
5 Correct 18 ms 4408 KB Output is correct
6 Partially correct 20 ms 4176 KB Partially correct
7 Correct 22 ms 4012 KB Output is correct
8 Correct 20 ms 4148 KB Output is correct
9 Correct 17 ms 4012 KB Output is correct
10 Correct 18 ms 3932 KB Output is correct
11 Correct 17 ms 3936 KB Output is correct
12 Correct 18 ms 3644 KB Output is correct
13 Correct 18 ms 3604 KB Output is correct
14 Correct 19 ms 3872 KB Output is correct
15 Partially correct 19 ms 3840 KB Partially correct
16 Partially correct 20 ms 3756 KB Partially correct
17 Correct 18 ms 3856 KB Output is correct
18 Correct 19 ms 3756 KB Output is correct
19 Partially correct 18 ms 3832 KB Partially correct
20 Correct 15 ms 4140 KB Output is correct
21 Correct 19 ms 4268 KB Output is correct
22 Correct 23 ms 4012 KB Output is correct
23 Correct 20 ms 4208 KB Output is correct
24 Correct 19 ms 4140 KB Output is correct
25 Correct 18 ms 4176 KB Output is correct
26 Correct 18 ms 4012 KB Output is correct
27 Correct 19 ms 4140 KB Output is correct
28 Correct 20 ms 4112 KB Output is correct
29 Correct 18 ms 3732 KB Output is correct
30 Correct 17 ms 3872 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 5664 KB Output is correct
2 Correct 39 ms 5276 KB Output is correct
3 Correct 34 ms 5412 KB Output is correct
4 Correct 18 ms 3836 KB Output is correct
5 Correct 18 ms 4616 KB Output is correct
6 Correct 20 ms 4084 KB Output is correct
7 Correct 19 ms 4240 KB Output is correct
8 Correct 20 ms 4168 KB Output is correct
9 Correct 18 ms 4028 KB Output is correct
10 Correct 19 ms 3924 KB Output is correct
11 Correct 20 ms 3904 KB Output is correct
12 Correct 20 ms 3492 KB Output is correct
13 Correct 18 ms 3492 KB Output is correct
14 Correct 17 ms 3868 KB Output is correct
15 Incorrect 17 ms 3848 KB Output isn't correct
16 Halted 0 ms 0 KB -