oj.uz

답안 #41765

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
41765 2018-02-21T07:51:28 Z RockyB Amusement Park (JOI17_amusement_park) C++14
8 / 100
 62 ms 28392 KB 
/// In The Name Of God

#include <bits/stdc++.h>
#include "Joi.h"

#define ioi exit(0);

using namespace std;

const int N1 = 1e5 + 7;

vector <int> g[N1];

bool was[N1];
int cnt;
void dfs(int v, long long x) {
	was[v] = 1;
	if (cnt <= 59) {
		int type = (x & (1LL << cnt)) > 0;
		MessageBoard(v, type);
	}
	else {
		MessageBoard(v, 0);
	}
	++cnt;
	for (auto to : g[v]) {
		if (!was[to]) dfs(to, x);
	}
}
void Joi(int n, int m, int a[], int b[], long long x, int T) {
	for (int i = 0; i < m; i++) {
		g[a[i]].push_back(b[i]);
		g[b[i]].push_back(a[i]);
	}
	dfs(n - 1, x);
}

/*int32_t main() {

	return 0;
}*/

/*#ifdef IOI2018
int main() {
	freopen ("in.txt", "r", stdin);
	
	ioi
}
#endif
*/
/// In The Name Of God

#include "Ioi.h"
#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

static const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

using namespace std;

int n;
vector <int> g[N];

ll res;

int last;
bool found;
bool was[N];

int len;
void dfs(int v) {
	was[v] = 1;
	if (found || v == (n - 1)) {
		found = 1;
		return;
	}
	for (auto to : g[v]) {
		if (!was[to] && !found) {
			last = Move(to);
			dfs(to);
			if (!found) last = Move(v);
		}
	}
}

int cnt;
void dfs1(int v) {
	was[v] = 1;
	if (cnt <= 59) {
		res += (1LL << cnt) * last;
	}
	cnt++;
	if (cnt >= 60) return;
	for (auto to : g[v]) {
		if (!was[to]) {
			last = Move(to);
			dfs1(to);
			Move(v);
		}
	}
}
ll Ioi(int _n, int m, int a[], int b[], int p, int v, int t) {
	n = _n;
	for (int i = 0; i < m; i++) {
		g[a[i]].pb(b[i]);
		g[b[i]].pb(a[i]);
	}
	last = v;
	dfs(p);
	memset(was, 0, sizeof(was));
	dfs1(n - 1);
	return res;
}	

/*#ifdef IOI2018
int main() {
	freopen ("in.txt", "r", stdin);
	
	ioi
}
#endif*/

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 15196 KB Output is correct
2 Correct 15 ms 25212 KB Output is correct
3 Correct 13 ms 25392 KB Output is correct
4 Correct 15 ms 25392 KB Output is correct
5 Correct 13 ms 25392 KB Output is correct
6 Correct 15 ms 25412 KB Output is correct
7 Correct 17 ms 25448 KB Output is correct
8 Correct 17 ms 25480 KB Output is correct
9 Correct 17 ms 25568 KB Output is correct
10 Correct 16 ms 25640 KB Output is correct
11 Correct 23 ms 25812 KB Output is correct
12 Correct 15 ms 25984 KB Output is correct
13 Correct 16 ms 25984 KB Output is correct
14 Correct 15 ms 25984 KB Output is correct
15 Correct 16 ms 25984 KB Output is correct
16 Correct 15 ms 25984 KB Output is correct
17 Correct 17 ms 25984 KB Output is correct
18 Correct 16 ms 25984 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 27060 KB Output is correct
2 Correct 62 ms 28264 KB Output is correct
3 Correct 46 ms 28392 KB Output is correct
4 Correct 31 ms 28392 KB Output is correct
5 Correct 31 ms 28392 KB Output is correct
6 Correct 32 ms 28392 KB Output is correct
7 Correct 31 ms 28392 KB Output is correct
8 Correct 34 ms 28392 KB Output is correct
9 Correct 35 ms 28392 KB Output is correct
10 Incorrect 33 ms 28392 KB Wrong Answer [8]
11 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 28392 KB Output is correct
2 Incorrect 16 ms 28392 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 55.0

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

Subtask #5
0 / 17.0

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