oj.uz

답안 #294005

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
294005 2020-09-08T14:22:02 Z mjkocijan Amusement Park (JOI17_amusement_park) C++14
67 / 100
 96 ms 5420 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;
		for (int i: g[cv]) {
			if (rod != i) {
				dfs(i, cv);
				break;
			}
		}
		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(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;
		par[cv] = rod;
		for (int i: g[cv]) {
			if (rod != i) {
				dfs(i, cv);
				break;
			}
		}
		usao[cv] = tt;
		tt++;
		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(0, -1);
	memset(bio, 0, sizeof bio);
	dfs2(p, v, 1);
  //return 0LL;
  return reza;
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1668 KB Output is correct
2 Correct 2 ms 1812 KB Output is correct
3 Correct 2 ms 2052 KB Output is correct
4 Correct 2 ms 1668 KB Output is correct
5 Correct 2 ms 1804 KB Output is correct
6 Correct 2 ms 1924 KB Output is correct
7 Correct 2 ms 2060 KB Output is correct
8 Correct 2 ms 1932 KB Output is correct
9 Correct 2 ms 2044 KB Output is correct
10 Incorrect 2 ms 1924 KB Wrong Answer [7]
11 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 5284 KB Output is correct
2 Correct 49 ms 5264 KB Output is correct
3 Correct 39 ms 5396 KB Output is correct
4 Correct 17 ms 3576 KB Output is correct
5 Correct 18 ms 3984 KB Output is correct
6 Correct 18 ms 3948 KB Output is correct
7 Correct 17 ms 3916 KB Output is correct
8 Correct 17 ms 4304 KB Output is correct
9 Correct 18 ms 4292 KB Output is correct
10 Correct 16 ms 3680 KB Output is correct
11 Correct 16 ms 3532 KB Output is correct
12 Correct 18 ms 3644 KB Output is correct
13 Correct 16 ms 3260 KB Output is correct
14 Correct 17 ms 3608 KB Output is correct
15 Correct 18 ms 3576 KB Output is correct
16 Correct 17 ms 3404 KB Output is correct
17 Correct 19 ms 3576 KB Output is correct
18 Correct 17 ms 3532 KB Output is correct
19 Correct 17 ms 3532 KB Output is correct
20 Correct 15 ms 4256 KB Output is correct
21 Correct 21 ms 4260 KB Output is correct
22 Correct 24 ms 3980 KB Output is correct
23 Correct 17 ms 4044 KB Output is correct
24 Correct 18 ms 3964 KB Output is correct
25 Correct 18 ms 3940 KB Output is correct
26 Correct 18 ms 4044 KB Output is correct
27 Correct 18 ms 4044 KB Output is correct
28 Correct 19 ms 4044 KB Output is correct
29 Correct 16 ms 4000 KB Output is correct
30 Correct 19 ms 3780 KB Output is correct
31 Correct 2 ms 1812 KB Output is correct
32 Correct 2 ms 1800 KB Output is correct
33 Correct 2 ms 2052 KB Output is correct
34 Correct 2 ms 2000 KB Output is correct
35 Correct 2 ms 1804 KB Output is correct
36 Correct 2 ms 1668 KB Output is correct
37 Correct 2 ms 1808 KB Output is correct
38 Correct 2 ms 1668 KB Output is correct
39 Correct 2 ms 1812 KB Output is correct
40 Correct 2 ms 1812 KB Output is correct
41 Correct 2 ms 1812 KB Output is correct
42 Correct 2 ms 1668 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1796 KB Output is correct
2 Correct 2 ms 1804 KB Output is correct
3 Correct 2 ms 1668 KB Output is correct
4 Correct 4 ms 2212 KB Output is correct
5 Correct 4 ms 2400 KB Output is correct
6 Correct 4 ms 2212 KB Output is correct
7 Correct 4 ms 2212 KB Output is correct
8 Correct 7 ms 2404 KB Output is correct
9 Correct 19 ms 4812 KB Output is correct
10 Correct 15 ms 4920 KB Output is correct
11 Correct 19 ms 4932 KB Output is correct
12 Correct 2 ms 1804 KB Output is correct
13 Correct 2 ms 1812 KB Output is correct
14 Correct 2 ms 1800 KB Output is correct
15 Correct 2 ms 1812 KB Output is correct

Subtask #4
47.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 5204 KB Output is correct
2 Partially correct 33 ms 5284 KB Partially correct
3 Partially correct 31 ms 5420 KB Partially correct
4 Correct 19 ms 3580 KB Output is correct
5 Correct 32 ms 4556 KB Output is correct
6 Correct 17 ms 4304 KB Output is correct
7 Partially correct 18 ms 4304 KB Partially correct
8 Partially correct 19 ms 4004 KB Partially correct
9 Partially correct 19 ms 3964 KB Partially correct
10 Correct 17 ms 3676 KB Output is correct
11 Correct 18 ms 3684 KB Output is correct
12 Correct 20 ms 3516 KB Output is correct
13 Correct 16 ms 3648 KB Output is correct
14 Correct 17 ms 3396 KB Output is correct
15 Partially correct 19 ms 3588 KB Partially correct
16 Correct 18 ms 3532 KB Output is correct
17 Partially correct 20 ms 3532 KB Partially correct
18 Partially correct 18 ms 3572 KB Partially correct
19 Correct 18 ms 3572 KB Output is correct
20 Correct 15 ms 4248 KB Output is correct
21 Correct 15 ms 4252 KB Output is correct
22 Correct 19 ms 4052 KB Output is correct
23 Correct 19 ms 3944 KB Output is correct
24 Correct 18 ms 3788 KB Output is correct
25 Correct 19 ms 4044 KB Output is correct
26 Correct 23 ms 4044 KB Output is correct
27 Correct 22 ms 4272 KB Output is correct
28 Correct 27 ms 3972 KB Output is correct
29 Correct 17 ms 4008 KB Output is correct
30 Correct 18 ms 3972 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 32 ms 5240 KB Output isn't correct
2 Halted 0 ms 0 KB -