oj.uz

답안 #294093

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
294093 2020-09-08T15:17:07 Z mjkocijan Amusement Park (JOI17_amusement_park) C++14
83 / 100
 36 ms 5664 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;
	int cuc;
 
	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 && t > 3) 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 && t > 3) return;
		
		for (int i: g[cv]) {
			if (i == par[cv]) continue;
			
			if (bio[i]) continue;
			
			calls++; if (calls > 120 && t > 3) return;
			assert(cuc == cv); cuc = i;
			int nx = Move(i);
			dfs2(i, nx, 0); if (calls > 120 && t > 3) return;
			
			if (cnt == 60) return;
		}
		
		if (par[cv] != -1
		//&& isrt
		)
		{
			calls++; if (calls > 120 && t > 3) return;
			assert(cuc == cv); cuc = par[cv];
			int nx = Move(par[cv]);
			if (isrt) dfs2(par[cv], nx, 1);
			if (calls > 120 && t > 3) 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);
	cuc = p;
	dfs2(p, v, 1);
  //return 0LL;
  return reza;
}

Compilation message

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

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1808 KB Output is correct
2 Correct 2 ms 1672 KB Output is correct
3 Correct 2 ms 2048 KB Output is correct
4 Correct 2 ms 1880 KB Output is correct
5 Correct 2 ms 1804 KB Output is correct
6 Correct 2 ms 2048 KB Output is correct
7 Correct 2 ms 1936 KB Output is correct
8 Correct 2 ms 1936 KB Output is correct
9 Correct 2 ms 2180 KB Output is correct
10 Correct 2 ms 1808 KB Output is correct
11 Correct 5 ms 2308 KB Output is correct
12 Correct 2 ms 1804 KB Output is correct
13 Correct 2 ms 2052 KB Output is correct
14 Correct 2 ms 2048 KB Output is correct
15 Correct 2 ms 2056 KB Output is correct
16 Correct 2 ms 2044 KB Output is correct
17 Correct 2 ms 2052 KB Output is correct
18 Correct 2 ms 1936 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 5408 KB Output is correct
2 Correct 32 ms 5664 KB Output is correct
3 Correct 30 ms 5412 KB Output is correct
4 Correct 17 ms 3832 KB Output is correct
5 Correct 18 ms 4148 KB Output is correct
6 Correct 18 ms 4128 KB Output is correct
7 Correct 18 ms 4204 KB Output is correct
8 Correct 17 ms 4128 KB Output is correct
9 Correct 20 ms 4168 KB Output is correct
10 Correct 16 ms 3924 KB Output is correct
11 Correct 18 ms 3932 KB Output is correct
12 Correct 18 ms 3644 KB Output is correct
13 Correct 16 ms 3464 KB Output is correct
14 Correct 17 ms 3616 KB Output is correct
15 Correct 17 ms 3744 KB Output is correct
16 Correct 20 ms 3840 KB Output is correct
17 Correct 19 ms 3744 KB Output is correct
18 Correct 18 ms 3836 KB Output is correct
19 Correct 18 ms 3952 KB Output is correct
20 Correct 16 ms 4380 KB Output is correct
21 Correct 15 ms 4128 KB Output is correct
22 Correct 18 ms 3872 KB Output is correct
23 Correct 17 ms 4180 KB Output is correct
24 Correct 17 ms 3964 KB Output is correct
25 Correct 18 ms 4196 KB Output is correct
26 Correct 18 ms 4376 KB Output is correct
27 Correct 18 ms 4168 KB Output is correct
28 Correct 18 ms 4000 KB Output is correct
29 Correct 16 ms 3884 KB Output is correct
30 Correct 17 ms 4296 KB Output is correct
31 Correct 2 ms 1800 KB Output is correct
32 Correct 2 ms 1800 KB Output is correct
33 Correct 2 ms 2064 KB Output is correct
34 Correct 2 ms 1800 KB Output is correct
35 Correct 2 ms 1800 KB Output is correct
36 Correct 2 ms 1760 KB Output is correct
37 Correct 2 ms 1804 KB Output is correct
38 Correct 2 ms 1932 KB Output is correct
39 Correct 2 ms 1804 KB Output is correct
40 Correct 2 ms 1800 KB Output is correct
41 Correct 2 ms 2052 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 1936 KB Output is correct
2 Correct 2 ms 1800 KB Output is correct
3 Correct 2 ms 1800 KB Output is correct
4 Correct 4 ms 2388 KB Output is correct
5 Correct 4 ms 2228 KB Output is correct
6 Correct 4 ms 2356 KB Output is correct
7 Correct 4 ms 2524 KB Output is correct
8 Correct 4 ms 2396 KB Output is correct
9 Correct 15 ms 4640 KB Output is correct
10 Correct 16 ms 4640 KB Output is correct
11 Correct 15 ms 4676 KB Output is correct
12 Correct 2 ms 1928 KB Output is correct
13 Correct 2 ms 1812 KB Output is correct
14 Correct 2 ms 1832 KB Output is correct
15 Correct 2 ms 1828 KB Output is correct

Subtask #4
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 5200 KB Output is correct
2 Correct 31 ms 5408 KB Output is correct
3 Correct 33 ms 5456 KB Output is correct
4 Correct 17 ms 3840 KB Output is correct
5 Correct 17 ms 4384 KB Output is correct
6 Correct 18 ms 4176 KB Output is correct
7 Correct 18 ms 4176 KB Output is correct
8 Correct 19 ms 3872 KB Output is correct
9 Correct 18 ms 4096 KB Output is correct
10 Correct 16 ms 3924 KB Output is correct
11 Correct 16 ms 3760 KB Output is correct
12 Correct 24 ms 3592 KB Output is correct
13 Correct 15 ms 3656 KB Output is correct
14 Correct 16 ms 3476 KB Output is correct
15 Correct 17 ms 3616 KB Output is correct
16 Correct 18 ms 3832 KB Output is correct
17 Correct 17 ms 3840 KB Output is correct
18 Correct 17 ms 3832 KB Output is correct
19 Correct 20 ms 3956 KB Output is correct
20 Correct 15 ms 4388 KB Output is correct
21 Correct 14 ms 4004 KB Output is correct
22 Correct 19 ms 4184 KB Output is correct
23 Correct 20 ms 4200 KB Output is correct
24 Correct 18 ms 4004 KB Output is correct
25 Correct 19 ms 4180 KB Output is correct
26 Correct 22 ms 4004 KB Output is correct
27 Correct 20 ms 4384 KB Output is correct
28 Correct 18 ms 4092 KB Output is correct
29 Correct 16 ms 3852 KB Output is correct
30 Correct 17 ms 3992 KB Output is correct

Subtask #5
0 / 17.0

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