oj.uz

Submission #294060

# Submission time Handle Problem Language Result Execution time Memory
294060 2020-09-08T14:45:57 Z mjkocijan Amusement Park (JOI17_amusement_park) C++14
65 / 100
 41 ms 5652 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)
	{ if (calls > 120) return;
		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; if (calls > 120) return;
		
		for (int i: g[cv]) {
			if (i == par[cv]) continue;
			
			if (bio[i]) continue;
			
			calls++; if (calls > 120) return;
			int nx = Move(i);
			dfs2(i, nx, 0); if (calls > 120) return;
			
			if (cnt == 60) return;
		}
		
		if (par[cv] != -1
		//&& isrt
		)
		{
			calls++; if (calls > 120) return;
			int nx = Move(par[cv]);
			dfs2(par[cv], nx, 1); if (calls > 120) return;
		}
	}
}
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;
}

Compilation message

Ioi.cpp: In function 'void IOI::dfs2(int, int, int)':
Ioi.cpp:49:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   49 |   if (cnt == 60) return; if (calls > 120) return;
      |   ^~
Ioi.cpp:49:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   49 |   if (cnt == 60) return; if (calls > 120) return;
      |                          ^~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1800 KB Output is correct
2 Correct 2 ms 1800 KB Output is correct
3 Correct 2 ms 1936 KB Output is correct
4 Correct 3 ms 1808 KB Output is correct
5 Correct 2 ms 1672 KB Output is correct
6 Correct 2 ms 1800 KB Output is correct
7 Correct 2 ms 1936 KB Output is correct
8 Correct 2 ms 1936 KB Output is correct
9 Incorrect 2 ms 1936 KB Wrong Answer [7]
10 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 5424 KB Output is correct
2 Correct 35 ms 5492 KB Output is correct
3 Correct 41 ms 5452 KB Output is correct
4 Correct 26 ms 3760 KB Output is correct
5 Correct 18 ms 4012 KB Output is correct
6 Correct 24 ms 4140 KB Output is correct
7 Correct 19 ms 4204 KB Output is correct
8 Correct 20 ms 4012 KB Output is correct
9 Correct 19 ms 4100 KB Output is correct
10 Correct 19 ms 3812 KB Output is correct
11 Correct 16 ms 3760 KB Output is correct
12 Correct 20 ms 3604 KB Output is correct
13 Correct 16 ms 3680 KB Output is correct
14 Correct 18 ms 3880 KB Output is correct
15 Incorrect 19 ms 3756 KB Wrong Answer [7]
16 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1800 KB Output is correct
2 Correct 2 ms 1800 KB Output is correct
3 Correct 2 ms 1804 KB Output is correct
4 Correct 4 ms 2392 KB Output is correct
5 Correct 5 ms 2356 KB Output is correct
6 Correct 4 ms 2228 KB Output is correct
7 Correct 6 ms 2352 KB Output is correct
8 Correct 4 ms 2356 KB Output is correct
9 Correct 15 ms 4652 KB Output is correct
10 Correct 18 ms 4788 KB Output is correct
11 Correct 18 ms 4664 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
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 5432 KB Output is correct
2 Correct 39 ms 5652 KB Output is correct
3 Correct 37 ms 5532 KB Output is correct
4 Correct 18 ms 3756 KB Output is correct
5 Correct 23 ms 4268 KB Output is correct
6 Correct 20 ms 4012 KB Output is correct
7 Correct 22 ms 4228 KB Output is correct
8 Correct 19 ms 3884 KB Output is correct
9 Correct 26 ms 4012 KB Output is correct
10 Correct 19 ms 3900 KB Output is correct
11 Correct 19 ms 3888 KB Output is correct
12 Correct 20 ms 3604 KB Output is correct
13 Correct 16 ms 3604 KB Output is correct
14 Correct 18 ms 3616 KB Output is correct
15 Correct 22 ms 3548 KB Output is correct
16 Correct 22 ms 3756 KB Output is correct
17 Correct 18 ms 3656 KB Output is correct
18 Correct 18 ms 3756 KB Output is correct
19 Correct 18 ms 3840 KB Output is correct
20 Correct 16 ms 4140 KB Output is correct
21 Correct 18 ms 4396 KB Output is correct
22 Correct 20 ms 4184 KB Output is correct
23 Correct 18 ms 4204 KB Output is correct
24 Correct 22 ms 4024 KB Output is correct
25 Correct 22 ms 4140 KB Output is correct
26 Correct 18 ms 4140 KB Output is correct
27 Correct 30 ms 4012 KB Output is correct
28 Correct 18 ms 4048 KB Output is correct
29 Correct 19 ms 3732 KB Output is correct
30 Correct 20 ms 4092 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 5404 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -