oj.uz

답안 #257780

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
257780 2020-08-04T19:11:26 Z Blagojce Amusement Park (JOI17_amusement_park) C++17
0 / 100
 16 ms 7680 KB 
#include <bits/stdc++.h> 
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)
#include <time.h>
#include <cmath>
 
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
 
const int i_inf = 1e9;
const ll inf = 1e17;
const ll mod = 1000000007;
const ld eps = 1e-13;
const ld pi  = 3.14159265359;
 
mt19937 _rand(time(NULL));
clock_t timer = clock();
const int mxn = 1e5;
 
#include "Joi.h"
/*int VAL[mxn];
void MessageBoard(int u, int val){
	VAL[u] = val;
	return;
}*/
 
int n, m;
int a[mxn], b[mxn];
bool vis[mxn];
vector<int> g[mxn];
 
int itopos[mxn];
int postoi[mxn];
int temp_p = 0;
 
void dfs(int u){
	itopos[u] = temp_p;
	postoi[temp_p] = u;
	++temp_p;
	
	vis[u] = true;
	
	for(auto e : g[u]){
		if(vis[e]) continue;
		dfs(e);
	}
}
void Joi(int N, int M, int A[], int B[], long long X, int T) {
	n = N, m = M;
	fr(i, 0, m) a[i] = A[i], b[i] = B[i];
	fr(i, 0, m){
		g[a[i]].pb(b[i]);
		g[b[i]].pb(a[i]);
	}
	dfs(0);
	fr(i, 0, n){
		if(X&(1LL<<(postoi[i]%60))) MessageBoard(i,1); 
		else MessageBoard(postoi[i],0);
	}
		
	
}

#include <bits/stdc++.h> 
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)
#include <time.h>
#include <cmath>
 
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
 
const int i_inf = 1e9;
const ll inf = 1e17;
const ll mod = 1000000007;
const ld eps = 1e-13;
const ld pi  = 3.14159265359;
 
mt19937 _rand(time(NULL));
clock_t timer = clock();
const int mxn = 1e5;
#include "Ioi.h"
/*
int mark[60] = {1,1,0,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
int Move(int u){
	cout<<u<<endl;
	return mark[u];
}*/

int n, m;
int a[mxn], b[mxn];
bool vis[mxn];
vector<int> g[mxn];

int itopos[mxn];
int postoi[mxn];
int temp_p = 0;

vector<int> v;
ll X = 0;
int val;
int parent[mxn];

void dfs(int u, int p){
	parent[u] = p;
	itopos[u] = temp_p;
	postoi[temp_p] = u;
	
	++temp_p;
	vis[u] = true;
 
	for(auto e : g[u]){
		if(vis[e]) continue;		
		dfs(e, u);
	}
}


void dfs2(int u, int p){
	if(itopos[u] <= 59){
		X |= (1LL<<(itopos[u]))*val;
	}
	else return;
	
	for(auto e : g[u]){
		if(vis[e]) continue;
		val = Move(e);
		dfs2(e, u);
	}
	Move(parent[u]);
}

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
	n = N, m = M;
	fr(i, 0, m) a[i] = A[i], b[i] = B[i];
	fr(i, 0, m){
		g[a[i]].pb(b[i]);
		g[b[i]].pb(a[i]);
	}
	dfs(0, 0);
	
	val = V;
	while(P != 0)val = Move(parent[P]), P = parent[P];
	
	dfs2(0, 0);
	
	return X;
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 55.0

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

Subtask #5
0 / 17.0

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