Submission #41789

#	Time	Username	Problem	Language	Result	Execution time	Memory
41789		Aidyn_A	Amusement Park (JOI17_amusement_park)	C++14	18 / 100	41 ms	4800 KiB

Joi

#include "Joi.h"

using namespace std;


void Joi(int N, int M, int A[], int B[], long long X, int T) {
  for(int i = 0; i < N; i++){
    if(i > 60) {
    	MessageBoard(i, 0);
    	continue;
    }
    if(X & (1ll << i))
	    MessageBoard(i, 1);
    else
  		MessageBoard(i, 0);
  }
}

Ioi

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

#define pb push_back
   
using namespace std;

typedef long long ll;

const int NN = 10123; 

int what[NN];
vector<int> g[NN];
bool u[NN];
           
void dfs(int x, int pr = -1) {
	u[x] = 1;
	for(auto to : g[x]) {
		if(u[to]) continue;
		what[to] = Move(to);
		dfs(to, x);
		Move(x);
	}
}

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
	memset(what, -1, sizeof what);
	memset(u, 0, sizeof u);
	for(int i = 0; i < M; i ++) {
		g[A[i]].pb(B[i]);
		g[B[i]].pb(A[i]);	
	}
	what[P] = V;
	dfs(P);
	for(int i = 0; i < N; i ++) {
		assert(u[i] == 1);
		assert(what[i] != -1);
	}
	ll tmp = 0;
	for(int i = 0; i < N; i ++) { 
		if(i > 60)
			break;		
		tmp += (1ll << i) * what[i];
	}
	return tmp;
}

• Subtask 1: 8 / 8
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 55
• Subtask 5: 0 / 17