oj.uz

Submission #41735

# Submission time Handle Problem Language Result Execution time Memory
41735 2018-02-21T06:02:49 Z cmaster Amusement Park (JOI17_amusement_park) C++14
0 / 100
 44 ms 13668 KB 
#include <bits/stdc++.h>
#include "Joi.h"
using namespace std;
const int MAXN2 = (int)2e5+228;
int val2[MAXN2], used2[MAXN2];
vector < int > g2[MAXN2];
long long tmp, XX;
void dfs2(int v, int len = 0) {
	used2[v] = 1;
	if(len < 60) {
		val2[v] = (bool)((1ll << len*1ll) & XX);
		MessageBoard(v, val2[v]);
	} else {
		val2[v] = 0;
		MessageBoard(v, val2[v]);
	}
	for(auto &to : g2[v]) {
		if(!used2[to]) dfs2(to, len+1);
	}
}

void Joi(int n, int m, int A[], int B[], long long X, int T) {
  for(int i = 0; i < n; i++){
    val2[i] = -1; used2[i] = 0;
    g2[i].clear();
  }
  for(int i = 0; i < m; ++i) {
		g2[A[i]].push_back(B[i]);
		g2[B[i]].push_back(A[i]);
  }
  XX = X;
  dfs2(0);
}

#include "Ioi.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN1 = (int)2e5+228;
bool used1[MAXN1];
vector < int > g1[MAXN1];
int val1[MAXN1];
long long ret = 0ll;

void dfs1(int v, int len = 0) {
	used1[v] = 1;
	for(auto &to : g1[v]) {
		if(!used1[to]) {
			val1[to] = Move(to);
			dfs1(to, len+1);
			Move(v);
		}
	}
}
void dfs11(int v, int len = 0) {
	used1[v] = 1;
	if(len < 60) ret ^= (1ll << len*1ll) * val1[v];
	for(auto &to : g1[v]) {
		if(!used1[to]) {
			dfs11(to, len+1);
		}
	}
}

long long Ioi(int n, int m, int A[], int B[], int P, int V, int T) {
	for(int i = 0; i < n; ++i) {
		used1[i] = 0;
		g1[i].clear();
	}
	val1[P] = V;
	for(int i = 0; i < m; ++i) {
		g1[A[i]].push_back(B[i]);
		g1[B[i]].push_back(A[i]);
	}
	ret = 0ll;
	dfs1(P);
	for(int i = 0; i < n; ++i) used1[i] = 0;
	dfs11(0);
  return ret;
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 13296 KB Output is correct
2 Correct 11 ms 13296 KB Output is correct
3 Correct 10 ms 13296 KB Output is correct
4 Incorrect 14 ms 13296 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

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

Subtask #5
0 / 17.0

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