oj.uz

답안 #294070

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
294070 2020-09-08T14:52:07 Z mjkocijan Amusement Park (JOI17_amusement_park) C++14
83 / 100
 33 ms 5660 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 && t > 3 && n > 2400) 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 && n > 2400) return;
		
		for (int i: g[cv]) {
			if (i == par[cv]) continue;
			
			if (bio[i]) continue;
			
			calls++; if (calls > 120 && t > 3 && n > 2400) return;
			int nx = Move(i);
			dfs2(i, nx, 0); if (calls > 120 && t > 3 && n > 2400) return;
			
			if (cnt == 60) return;
		}
		
		if (par[cv] != -1
		//&& isrt
		)
		{
			calls++; if (calls > 120 && t > 3 && n > 2400) return;
			int nx = Move(par[cv]);
			dfs2(par[cv], nx, 1); if (calls > 120 && t > 3 && n > 2400) 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 && t > 3 && n > 2400) 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 && t > 3 && n > 2400) return;
      |                          ^~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1804 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 1800 KB Output is correct
5 Correct 2 ms 1800 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 Correct 2 ms 2064 KB Output is correct
10 Correct 2 ms 1804 KB Output is correct
11 Correct 7 ms 2304 KB Output is correct
12 Correct 2 ms 1800 KB Output is correct
13 Correct 2 ms 2048 KB Output is correct
14 Correct 2 ms 2052 KB Output is correct
15 Correct 2 ms 1936 KB Output is correct
16 Correct 2 ms 2060 KB Output is correct
17 Correct 2 ms 1936 KB Output is correct
18 Correct 2 ms 2052 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 5420 KB Output is correct
2 Correct 30 ms 5404 KB Output is correct
3 Correct 31 ms 5660 KB Output is correct
4 Correct 17 ms 3756 KB Output is correct
5 Correct 18 ms 4276 KB Output is correct
6 Correct 18 ms 4300 KB Output is correct
7 Correct 17 ms 3788 KB Output is correct
8 Correct 17 ms 3916 KB Output is correct
9 Correct 17 ms 3916 KB Output is correct
10 Correct 15 ms 3680 KB Output is correct
11 Correct 15 ms 3660 KB Output is correct
12 Correct 16 ms 3640 KB Output is correct
13 Correct 15 ms 3260 KB Output is correct
14 Correct 17 ms 3604 KB Output is correct
15 Correct 18 ms 3592 KB Output is correct
16 Correct 18 ms 3576 KB Output is correct
17 Correct 17 ms 3548 KB Output is correct
18 Correct 17 ms 3532 KB Output is correct
19 Correct 19 ms 3832 KB Output is correct
20 Correct 15 ms 4120 KB Output is correct
21 Correct 15 ms 4044 KB Output is correct
22 Correct 17 ms 3864 KB Output is correct
23 Correct 17 ms 4164 KB Output is correct
24 Correct 17 ms 3788 KB Output is correct
25 Correct 17 ms 4068 KB Output is correct
26 Correct 19 ms 3924 KB Output is correct
27 Correct 17 ms 3916 KB Output is correct
28 Correct 20 ms 4044 KB Output is correct
29 Correct 17 ms 3712 KB Output is correct
30 Correct 19 ms 3868 KB Output is correct
31 Correct 2 ms 1792 KB Output is correct
32 Correct 2 ms 1840 KB Output is correct
33 Correct 2 ms 1932 KB Output is correct
34 Correct 2 ms 1804 KB Output is correct
35 Correct 2 ms 1668 KB Output is correct
36 Correct 2 ms 1808 KB Output is correct
37 Correct 2 ms 1796 KB Output is correct
38 Correct 2 ms 1796 KB Output is correct
39 Correct 2 ms 1796 KB Output is correct
40 Correct 2 ms 2060 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1812 KB Output is correct
2 Correct 2 ms 1796 KB Output is correct
3 Correct 2 ms 1796 KB Output is correct
4 Correct 4 ms 2276 KB Output is correct
5 Correct 4 ms 2400 KB Output is correct
6 Correct 4 ms 2400 KB Output is correct
7 Correct 4 ms 2404 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 4792 KB Output is correct
11 Correct 15 ms 4628 KB Output is correct
12 Correct 2 ms 1796 KB Output is correct
13 Correct 2 ms 1796 KB Output is correct
14 Correct 2 ms 1968 KB Output is correct
15 Correct 2 ms 1816 KB Output is correct

Subtask #4
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 5164 KB Output is correct
2 Correct 31 ms 4964 KB Output is correct
3 Correct 31 ms 5140 KB Output is correct
4 Correct 17 ms 3532 KB Output is correct
5 Correct 18 ms 4416 KB Output is correct
6 Correct 18 ms 4164 KB Output is correct
7 Correct 17 ms 4044 KB Output is correct
8 Correct 17 ms 3788 KB Output is correct
9 Correct 18 ms 3788 KB Output is correct
10 Correct 16 ms 3668 KB Output is correct
11 Correct 17 ms 3660 KB Output is correct
12 Correct 15 ms 3388 KB Output is correct
13 Correct 15 ms 3640 KB Output is correct
14 Correct 17 ms 3692 KB Output is correct
15 Correct 17 ms 3580 KB Output is correct
16 Correct 19 ms 3584 KB Output is correct
17 Correct 17 ms 3596 KB Output is correct
18 Correct 17 ms 3584 KB Output is correct
19 Correct 17 ms 3580 KB Output is correct
20 Correct 14 ms 3916 KB Output is correct
21 Correct 15 ms 4264 KB Output is correct
22 Correct 18 ms 4172 KB Output is correct
23 Correct 17 ms 3956 KB Output is correct
24 Correct 17 ms 3788 KB Output is correct
25 Correct 18 ms 4168 KB Output is correct
26 Correct 18 ms 3936 KB Output is correct
27 Correct 17 ms 4044 KB Output is correct
28 Correct 19 ms 3840 KB Output is correct
29 Correct 16 ms 3896 KB Output is correct
30 Correct 16 ms 4092 KB Output is correct

Subtask #5
0 / 17.0

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