oj.uz

Submission #100636

# Submission time Handle Problem Language Result Execution time Memory
100636 2019-03-13T04:14:33 Z Pro_ktmr None (JOI16_snowy) C++14
20 / 100
 18 ms 1548 KB 
#include"bits/stdc++.h"
using namespace std;
#include"Anyalib.h"
#define MP(a,b) make_pair(a,b)

static int n;
static int par[100];
static int toPar[100];
void InitAnya(int N, int A[], int B[]){
	if(N > 100) return;
	n = N;
	vector<pair<int,int> > tonari[100];
	for(int i=0; i<N-1; i++){
		tonari[A[i]].push_back(MP(B[i],i));
		tonari[B[i]].push_back(MP(A[i],i));
	}
	par[0] = 0;
	queue<int> que;
	que.push(0);
	while(!que.empty()){
		int now = que.front();
		que.pop();
		for(int i=0; i<tonari[now].size(); i++){
			if(tonari[now][i].first == par[now]) continue;
			par[tonari[now][i].first] = now;
			toPar[tonari[now][i].first] = tonari[now][i].second;
			que.push(tonari[now][i].first);
		}
	}
	
	//for(int i=0; i<N; i++) cout << par[i] << " ";
	//cout << endl;
}

//void Save(int place, int bit)
static int memo[100];
static int C2[99];
static int wa(int i){
	if(memo[i] != -1) return memo[i];
	return memo[i] = wa(par[i]) + C2[toPar[i]];
}
void Anya(int C[]){
	for(int i=0; i<n-1; i++) C2[i] = C[i];
	for(int i=0; i<n; i++) memo[i] = -1;
	memo[0] = 0;
	for(int i=0; i<n; i++){
		int tmp = wa(i);
		for(int j=0; j<10; j++){
			Save(i*10+j, (tmp>>9-j)%2);
		}
	}
}

#include"bits/stdc++.h"
using namespace std;
#include"Borislib.h"
#define MP(a,b) make_pair(a,b)

static int n;
static int par[100];
static int toPar[100];
void InitBoris(int N, int A[], int B[]){
	if(N > 100) return;
	n = N;
	vector<pair<int,int> > tonari[100];
	for(int i=0; i<N-1; i++){
		tonari[A[i]].push_back(MP(B[i],i));
		tonari[B[i]].push_back(MP(A[i],i));
	}
	par[0] = 0;
	queue<int> que;
	que.push(0);
	while(!que.empty()){
		int now = que.front();
		que.pop();
		for(int i=0; i<tonari[now].size(); i++){
			if(tonari[now][i].first == par[now]) continue;
			par[tonari[now][i].first] = now;
			toPar[tonari[now][i].first] = tonari[now][i].second;
			que.push(tonari[now][i].first);
		}
	}
}

//Ask(int place)
int Boris(int city){
	int tmp = 0;
	for(int i=0; i<10; i++){
		tmp += Ask(city*10+i)<<9-i;
	}
	return tmp;
}

Compilation message

Anya.cpp: In function 'void InitAnya(int, int*, int*)':
Anya.cpp:23:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0; i<tonari[now].size(); i++){
                ~^~~~~~~~~~~~~~~~~~~
Anya.cpp: In function 'void Anya(int*)':
Anya.cpp:49:24: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
    Save(i*10+j, (tmp>>9-j)%2);
                       ~^~

Boris.cpp: In function 'void InitBoris(int, int*, int*)':
Boris.cpp:23:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0; i<tonari[now].size(); i++){
                ~^~~~~~~~~~~~~~~~~~~
Boris.cpp: In function 'int Boris(int)':
Boris.cpp:36:27: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   tmp += Ask(city*10+i)<<9-i;
                          ~^~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 784 KB Output is correct
2 Correct 5 ms 788 KB Output is correct
3 Correct 7 ms 952 KB Output is correct
4 Correct 7 ms 1024 KB Output is correct
5 Correct 11 ms 1300 KB Output is correct
6 Correct 12 ms 1296 KB Output is correct
7 Correct 10 ms 1280 KB Output is correct
8 Correct 11 ms 1048 KB Output is correct
9 Correct 12 ms 1316 KB Output is correct
10 Correct 12 ms 1280 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1340 KB Output is correct
2 Correct 13 ms 1348 KB Output is correct
3 Correct 15 ms 1292 KB Output is correct
4 Correct 15 ms 1280 KB Output is correct
5 Correct 18 ms 1360 KB Output is correct
6 Correct 11 ms 1024 KB Output is correct
7 Correct 15 ms 1280 KB Output is correct
8 Correct 13 ms 1280 KB Output is correct
9 Correct 13 ms 1280 KB Output is correct
10 Correct 15 ms 1364 KB Output is correct

Subtask #3
0 / 35.0

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

Subtask #4
0 / 45.0

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