oj.uz

Submission #257628

# Submission time Handle Problem Language Result Execution time Memory
257628 2020-08-04T13:43:48 Z sjimed None (JOI16_snowy) C++14
35 / 100
 34 ms 1912 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 cost[555];
static int num[555];
static int cnt = 500;

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]);
	}

	dfs(0);
}

void Anya(int C[]) {
	for(int i=0; i<n-1; i++) {
		if(p[a[i]] == b[i]) cost[a[i]] = C[i];
		else cost[b[i]] = C[i];
		
		Save(i, C[i]);
	}

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

		dist[i] = 0;
		for(int j=i; j; j = p[j]) {
			dist[i] += cost[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]);
	}

	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 != 0; i = p[i]) {
		if(sum[i]) ans += Ask(edge[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:82:25: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
    if(dist[i] & (1 << j - num[i])) Save(j, 1);
                       ~~^~~~~~~~

Boris.cpp: In function 'int Boris(int)':
Boris.cpp:76:24: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
     ans += Ask(j) << j - num[i];
                      ~~^~~~~~~~

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 992 KB Output is correct
2 Incorrect 0 ms 900 KB Wrong Answer [2]
3 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

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

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 1280 KB Output is correct
2 Correct 34 ms 1752 KB Output is correct
3 Correct 31 ms 1860 KB Output is correct
4 Correct 30 ms 1856 KB Output is correct
5 Correct 32 ms 1776 KB Output is correct
6 Correct 33 ms 1888 KB Output is correct
7 Correct 34 ms 1900 KB Output is correct
8 Correct 30 ms 1852 KB Output is correct
9 Correct 30 ms 1912 KB Output is correct
10 Correct 29 ms 1848 KB Output is correct
11 Correct 29 ms 1848 KB Output is correct
12 Correct 30 ms 1896 KB Output is correct
13 Correct 34 ms 1908 KB Output is correct
14 Correct 32 ms 1872 KB Output is correct
15 Correct 28 ms 1840 KB Output is correct
16 Correct 31 ms 1848 KB Output is correct
17 Correct 30 ms 1912 KB Output is correct
18 Correct 30 ms 1904 KB Output is correct
19 Correct 28 ms 1688 KB Output is correct
20 Correct 32 ms 1908 KB Output is correct

Subtask #4
0 / 45.0

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