oj.uz

Submission #711042

# Submission time Handle Problem Language Result Execution time Memory
711042 2023-03-16T07:36:19 Z minhcool Flights (JOI22_flights) C++17
21 / 100
 354 ms 9836 KB 
#include "Ali.h"
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 3e5 + 5;
const int mod = 1e9 + 7, oo = 1e18 + 7;

vector<int> Adj[N];

int d[N], anc[N][20];

void dfs(int u, int p){
	for(auto v : Adj[u]){
		if(v == p) continue;
		d[v] = d[u] + 1;
		anc[v][0] = u;
		for(int i = 1; i <= 19; i++) anc[v][i] = anc[anc[v][i - 1]][i - 1];
		dfs(v, u);
	}
}

int lca(int x, int y){
	if(d[x] > d[y]) swap(x, y);
	for(int i = 19; i >= 0; i--){
		if(d[y] >= (d[x] + (1LL << i))) y = anc[y][i];	
	}
	if(x == y) return x;
	for(int i = 19; i >= 0; i--){
		if(anc[x][i] != anc[y][i]){
			x = anc[x][i], y = anc[y][i];
		}
	}
	return anc[x][0];
}

int n;

int dist(int x, int y){
	if(x > n || y > n) return 0;
	return d[x] + d[y] - 2 * d[lca(x, y)];
}

void Init(int N, vector<int> U, vector<int> V) {
	/*
  variable_example++;
  SetID(0, 0);
  SetID(1, 1);
  SetID(2, 2 * N + 19);*/
    n = N;
    for(int i = 0; i < n; i++) Adj[i].clear();
	for(int i = 0; i < (n - 1); i++){
		Adj[U[i]].pb(V[i]);
		Adj[V[i]].pb(U[i]);
	}	
	dfs(0, 0);
	//cout << dist(5883, 4764) << "\n";
	for(int i = 0; i < n; i++) SetID(i, i);
}

string SendA(string S) {
  	int temp0 = 0, temp1 = 0;
  	for(int i = 0; i < 10; i++) if(S[i] == '1') temp0 |= (1LL << i);
  	for(int i = 0; i < 10; i++) if(S[i + 10] == '1') temp1 |= (1LL << i);
  	temp0 *= 10, temp1 *= 10;
  	string ans = "";
  	for(int i = 0; i < 10; i++){
  		for(int j = 0; j < 10; j++){
  			int temp = dist(temp0 + i, temp1 + j);
  			//cout << temp0 + i << " " << temp1 + j << " " << temp << "\n";
  			for(int k = 0; k < 14; k++){
  				if(temp & (1LL << k)) ans += "1";
  				else ans += "0";
			}			
		}	
	}
	return ans;
}
#include "Benjamin.h"
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 3e5 + 5;
const int mod = 1e9 + 7, oo = 1e18 + 7;

int x, y;

string SendB(int N, int X, int Y) {
	x = X, y = Y;
	int temp0 = X / 10, temp1 = Y / 10;
	string s;
	for(int i = 0; i < 10; i++){
		if(!(temp0 & (1LL << i))) s += "0";
		else s += "1";
	}
	for(int i = 0; i < 10; i++){
		if(!(temp1 & (1LL << i))) s += "0";
		else s += "1";
	}
	return s;
}

int Answer(string T) {
	int tol = ((x % 10) * 10) + (y % 10), ans = 0;
	for(int i = tol * 14; i < (tol + 1) * 14; i++){
		if(T[i] == '1') ans += (1LL << (i - tol * 14));
	}
	return ans;
}

Compilation message

Ali.cpp:14:36: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   14 | const int mod = 1e9 + 7, oo = 1e18 + 7;
      |                               ~~~~~^~~
grader_ali.cpp:10:8: warning: '{anonymous}::_randmem' defined but not used [-Wunused-variable]
   10 |   char _randmem[12379];
      |        ^~~~~~~~

Benjamin.cpp:14:36: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   14 | const int mod = 1e9 + 7, oo = 1e18 + 7;
      |                               ~~~~~^~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7440 KB Output is correct
2 Correct 5 ms 7440 KB Output is correct
3 Correct 6 ms 7576 KB Output is correct
4 Correct 4 ms 7440 KB Output is correct
5 Correct 5 ms 7528 KB Output is correct
6 Correct 11 ms 8932 KB Output is correct
7 Correct 13 ms 8932 KB Output is correct
8 Correct 11 ms 8936 KB Output is correct
9 Correct 11 ms 8936 KB Output is correct
10 Correct 13 ms 9120 KB Output is correct
11 Correct 9 ms 8592 KB Output is correct
12 Correct 13 ms 8932 KB Output is correct
13 Correct 11 ms 8848 KB Output is correct
14 Correct 12 ms 9064 KB Output is correct
15 Correct 11 ms 9752 KB Output is correct
16 Correct 10 ms 8904 KB Output is correct

Subtask #2
6.0 / 85.0

# Verdict Execution time Memory Grader output
1 Partially correct 6 ms 7440 KB Output is partially correct
2 Partially correct 77 ms 9644 KB Output is partially correct
3 Partially correct 8 ms 7568 KB Output is partially correct
4 Partially correct 343 ms 9000 KB Output is partially correct
5 Partially correct 340 ms 9004 KB Output is partially correct
6 Partially correct 354 ms 8916 KB Output is partially correct
7 Partially correct 287 ms 9836 KB Output is partially correct
8 Partially correct 268 ms 9040 KB Output is partially correct
9 Partially correct 236 ms 9412 KB Output is partially correct
10 Partially correct 234 ms 9440 KB Output is partially correct
11 Partially correct 293 ms 9100 KB Output is partially correct
12 Partially correct 35 ms 8732 KB Output is partially correct
13 Partially correct 180 ms 9060 KB Output is partially correct
14 Partially correct 153 ms 8920 KB Output is partially correct
15 Partially correct 12 ms 7568 KB Output is partially correct
16 Partially correct 229 ms 9688 KB Output is partially correct
17 Partially correct 248 ms 9768 KB Output is partially correct
18 Partially correct 254 ms 9480 KB Output is partially correct
19 Partially correct 250 ms 9528 KB Output is partially correct
20 Partially correct 199 ms 9308 KB Output is partially correct
21 Partially correct 231 ms 9620 KB Output is partially correct
22 Partially correct 238 ms 9160 KB Output is partially correct
23 Partially correct 225 ms 9096 KB Output is partially correct
24 Partially correct 252 ms 9016 KB Output is partially correct
25 Partially correct 276 ms 9096 KB Output is partially correct
26 Partially correct 257 ms 9040 KB Output is partially correct
27 Partially correct 235 ms 9052 KB Output is partially correct
28 Partially correct 245 ms 9140 KB Output is partially correct
29 Partially correct 236 ms 9012 KB Output is partially correct
30 Partially correct 260 ms 9036 KB Output is partially correct
31 Partially correct 303 ms 9076 KB Output is partially correct
32 Partially correct 267 ms 9044 KB Output is partially correct
33 Partially correct 272 ms 9084 KB Output is partially correct
34 Partially correct 290 ms 8940 KB Output is partially correct
35 Partially correct 237 ms 9040 KB Output is partially correct
36 Partially correct 288 ms 9028 KB Output is partially correct
37 Partially correct 301 ms 8956 KB Output is partially correct
38 Partially correct 282 ms 9020 KB Output is partially correct
39 Partially correct 61 ms 8912 KB Output is partially correct
40 Partially correct 307 ms 9544 KB Output is partially correct