oj.uz

답안 #257813

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
257813 2020-08-04T20:45:50 Z Blagojce Amusement Park (JOI17_amusement_park) C++17
18 / 100
 34 ms 9160 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 temp_p = 0;
 
void dfs(int u){
	itopos[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<<(itopos[i]%60))) MessageBoard(i,1); 
		else MessageBoard(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 postoi[mxn];
int temp_p = 0;

vector<int> v;

int val[mxn];
int parent[mxn];

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

int loc_pos;
void dfs2(int u, int p, int tv){
	loc_pos ++;
	val[u] = tv;
	vis[u] = true;
	if(loc_pos == 60) return;
	
	for(auto e : g[u]){
		if(vis[e]) continue;
		dfs2(e, u, Move(e));
		if(loc_pos == 60) return;
	}
	
	if(u != p) 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);
	while(P != 0) V = Move(parent[P]), P = parent[P];
	val[0] = V;
	
	memset(vis, false, sizeof(vis));
	dfs2(0, 0, V);
	
	ll X = 0;
	fr(i, 0, 60){
		X |= (1LL<<i)*val[postoi[i]];
	}
	return X;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5692 KB Output is correct
2 Correct 4 ms 5508 KB Output is correct
3 Correct 4 ms 5684 KB Output is correct
4 Correct 4 ms 5688 KB Output is correct
5 Correct 4 ms 5508 KB Output is correct
6 Correct 4 ms 5692 KB Output is correct
7 Correct 4 ms 5516 KB Output is correct
8 Correct 4 ms 5668 KB Output is correct
9 Correct 4 ms 5676 KB Output is correct
10 Correct 4 ms 5636 KB Output is correct
11 Correct 7 ms 6188 KB Output is correct
12 Correct 4 ms 5508 KB Output is correct
13 Correct 4 ms 5672 KB Output is correct
14 Correct 4 ms 5644 KB Output is correct
15 Correct 4 ms 5924 KB Output is correct
16 Correct 4 ms 5644 KB Output is correct
17 Correct 4 ms 5672 KB Output is correct
18 Correct 4 ms 5644 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 8860 KB Output is correct
2 Correct 34 ms 9160 KB Output is correct
3 Correct 33 ms 9124 KB Output is correct
4 Correct 20 ms 7608 KB Output is correct
5 Correct 19 ms 7740 KB Output is correct
6 Correct 19 ms 7740 KB Output is correct
7 Correct 20 ms 7612 KB Output is correct
8 Correct 19 ms 7744 KB Output is correct
9 Correct 20 ms 7740 KB Output is correct
10 Correct 18 ms 7744 KB Output is correct
11 Correct 19 ms 7852 KB Output is correct
12 Correct 19 ms 7332 KB Output is correct
13 Correct 19 ms 7540 KB Output is correct
14 Correct 19 ms 7516 KB Output is correct
15 Correct 22 ms 7612 KB Output is correct
16 Correct 19 ms 7748 KB Output is correct
17 Correct 19 ms 7620 KB Output is correct
18 Correct 20 ms 7864 KB Output is correct
19 Correct 20 ms 7620 KB Output is correct
20 Correct 16 ms 7992 KB Output is correct
21 Correct 22 ms 7740 KB Output is correct
22 Correct 26 ms 7804 KB Output is correct
23 Correct 22 ms 7764 KB Output is correct
24 Correct 20 ms 7796 KB Output is correct
25 Correct 19 ms 7776 KB Output is correct
26 Correct 19 ms 7740 KB Output is correct
27 Correct 22 ms 7612 KB Output is correct
28 Correct 19 ms 7844 KB Output is correct
29 Correct 18 ms 7964 KB Output is correct
30 Correct 19 ms 7800 KB Output is correct
31 Correct 4 ms 5700 KB Output is correct
32 Correct 4 ms 5688 KB Output is correct
33 Correct 4 ms 5520 KB Output is correct
34 Correct 4 ms 5684 KB Output is correct
35 Correct 4 ms 5708 KB Output is correct
36 Correct 4 ms 5692 KB Output is correct
37 Correct 4 ms 5640 KB Output is correct
38 Correct 4 ms 5696 KB Output is correct
39 Correct 4 ms 5512 KB Output is correct
40 Correct 4 ms 5696 KB Output is correct
41 Correct 4 ms 5512 KB Output is correct
42 Correct 4 ms 5640 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5508 KB Output is correct
2 Correct 4 ms 5692 KB Output is correct
3 Correct 4 ms 5820 KB Output is correct
4 Correct 6 ms 5936 KB Output is correct
5 Incorrect 6 ms 6080 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0.0 / 55.0

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

Subtask #5
0 / 17.0

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