oj.uz

답안 #257651

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
257651 2020-08-04T14:01:38 Z sjimed Snowy Roads (JOI16_snowy) C++14
15 / 100
 11 ms 1536 KB 
#include "Anyalib.h"
#include<bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(false); cin.tie(NULL)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define all(v) (v).begin(), (v).end()
#define pre(a) cout<<fixed; cout.precision(a)
#define mp make_pair

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,pii> pipii;
const int inf = 1e9;
const ll INF = 1e18;

static int n;
static int a[555];
static int b[555];
static int p[555];
static vector<int> g[555];
static int sum[555];
static int num[555];
static int cnt = 500;

static int edge[555];

static int dist[555];

static void dfs(int x) {
	sum[x] = 1;
	for(auto i : g[x]) {
		if(i == p[x]) continue;

		p[i] = x;
		dfs(i);

		sum[x] += sum[i];
	}

	if(sum[x] >= 10) {
		sum[x] = 0;
		num[x] = cnt;
		cnt += 9;
	}
}

void InitAnya(int N , int A[] , int B[]) {
	n = N;

	for(int i=0; i<n-1; i++) {
		a[i] = A[i];
		b[i] = B[i];

		g[a[i]].eb(b[i]);
		g[b[i]].eb(a[i]);
	}

	dfs(0);

	for(int i=0; i<n-1; i++) {
		if(p[a[i]] == b[i]) edge[a[i]] = i;
		else edge[b[i]] = i;
	}
}

void Anya(int C[]) {
	for(int i=0; i<n-1; i++) {
		Save(i, C[i]);
	}

	return;

	for(int i=1; i<n; i++) {
		if(sum[i] > 0) continue;

		dist[i] = 0;
		for(int j=i; j; j = p[j]) {
			dist[i] += C[edge[j]];
		}

		for(int j=num[i]; j < num[i] + 9; j++) {
			if(dist[i] & (1 << j - num[i])) Save(j, 1);
			else Save(j, 0);
		}
	}
}

#include "Borislib.h"
#include<bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(false); cin.tie(NULL)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define all(v) (v).begin(), (v).end()
#define pre(a) cout<<fixed; cout.precision(a)
#define mp make_pair

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,pii> pipii;
const int inf = 1e9;
const ll INF = 1e18;

static int n;
static int a[555];
static int b[555];
static int p[555];
static vector<int> g[555];
static int sum[555];
static int num[555];
static int cnt = 500;

static int edge[555];

static void dfs(int x) {
	sum[x] = 1;
	for(auto i : g[x]) {
		if(i == p[x]) continue;

		p[i] = x;
		dfs(i);

		sum[x] += sum[i];
	}

	if(sum[x] >= 10) {
		sum[x] = 0;
		num[x] = cnt;
		cnt += 9;
	}
}

void InitBoris(int N , int A[] , int B[]) {
	n = N;

	for(int i=0; i<n-1; i++) {
		a[i] = A[i], b[i] = B[i];

		g[a[i]].eb(b[i]);
		g[b[i]].eb(a[i]);
	}

	dfs(0);

	for(int i=0; i<n-1; i++) {
		if(p[a[i]] == b[i]) edge[a[i]] = i;
		else edge[b[i]] = i;
	}
}

int Boris(int city) {
	int i;
	int ans = 0;

	for(i = city; i; i = p[i]) {
		ans += Ask(edge[i]);
		
		/*if(1 || sum[i]) 
		else {
			for(int j = num[i]; j < num[i] + 9; j++) {
				ans += Ask(j) << (j - num[i]);
			}
			break;
		}*/
	}

	return ans;
}

Compilation message

Anya.cpp: In function 'void Anya(int*)':
Anya.cpp:88:25: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
    if(dist[i] & (1 << j - num[i])) Save(j, 1);
                       ~~^~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 988 KB Output is correct
2 Correct 2 ms 916 KB Output is correct
3 Correct 3 ms 1216 KB Output is correct
4 Correct 4 ms 1216 KB Output is correct
5 Correct 7 ms 1440 KB Output is correct
6 Correct 6 ms 1280 KB Output is correct
7 Correct 7 ms 1440 KB Output is correct
8 Correct 7 ms 1536 KB Output is correct
9 Correct 7 ms 1440 KB Output is correct
10 Correct 6 ms 1280 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1280 KB Output is correct
2 Correct 7 ms 1280 KB Output is correct
3 Incorrect 7 ms 1428 KB Wrong Answer [6]
4 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

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

Subtask #4
0 / 45.0

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