oj.uz

Submission #567779

# Submission time Handle Problem Language Result Execution time Memory
567779 2022-05-24T07:41:53 Z jamezzz Flights (JOI22_flights) C++17
15 / 100
 71 ms 1784 KB 
#include "Ali.h"
#include <string>
#include <vector>
#include <bits/stdc++.h>
using namespace std;

namespace {

int nn;
int dist[10005];
vector<int> AL[10005];
void dfs(int u){
	for(int v:AL[u]){
		if(dist[v]!=-1)continue;
		dist[v]=dist[u]+1;
		dfs(v);
	}
}

}

void Init(int N, vector<int> U, vector<int> V){
	nn=N;
	for(int i=0;i<N;++i){
		AL[i].clear();
	}
	memset(dist,-1,sizeof dist);
	for(int i=0;i<N-1;++i){
		AL[U[i]].push_back(V[i]);
		AL[V[i]].push_back(U[i]);
	}
	for(int i=0;i<N;++i)SetID(i,i);
}

string SendA(string S){
	int X=0,Y=0;
	for(int i=0;i<14;++i){
		if(S[i]=='1')X+=(1<<i);
	}
	for(int i=0;i<6;++i){
		if(S[i+14]=='1')Y+=(1<<i);
	}
	dist[X]=0;dfs(X);
	
	string ret;
	for(int i=0;i<=nn/64;++i){
		int u=64*i+Y;
		for(int i=0;i<14;++i){
			if((dist[u]&(1<<i))!=0)ret+='1';
			else ret+='0';
		}
	}
	
	return ret;
}

#include "Benjamin.h"
#include <string>
#include <vector>
#include <bits/stdc++.h>
using namespace std;

namespace {

int yy;

}

string SendB(int N, int X, int Y){
	yy=Y;
	string s;
	for(int i=0;i<14;++i){
		if((X&(1<<i))!=0)s+='1';
		else s+='0';
	}
	for(int i=0;i<6;++i){
		if((Y&(1<<i))!=0)s+='1';
		else s+='0';
	}
	return s;
}

int Answer(string T){
	yy/=64;
	int ans=0;
	for(int i=yy*14;i<(yy+1)*14;++i){
		if(T[i]=='1')ans+=(1<<(i-yy*14));
	}
	return ans;
}

Compilation message

grader_ali.cpp:10:8: warning: '{anonymous}::_randmem' defined but not used [-Wunused-variable]
   10 |   char _randmem[12379];
      |        ^~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 656 KB Output is correct
2 Correct 2 ms 656 KB Output is correct
3 Correct 2 ms 744 KB Output is correct
4 Correct 2 ms 656 KB Output is correct
5 Correct 2 ms 656 KB Output is correct
6 Correct 9 ms 1256 KB Output is correct
7 Correct 7 ms 1280 KB Output is correct
8 Correct 9 ms 1260 KB Output is correct
9 Correct 7 ms 1280 KB Output is correct
10 Correct 7 ms 1360 KB Output is correct
11 Correct 6 ms 1168 KB Output is correct
12 Correct 8 ms 1260 KB Output is correct
13 Correct 9 ms 1328 KB Output is correct
14 Correct 7 ms 1256 KB Output is correct
15 Correct 6 ms 1704 KB Output is correct
16 Correct 7 ms 1300 KB Output is correct

Subtask #2
0.0 / 85.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 656 KB Output is correct
2 Partially correct 71 ms 1784 KB Output is partially correct
3 Halted 0 ms 0 KB -