Submission #136580

#	Time	Username	Problem	Language	Result	Execution time	Memory
136580		Boxworld	Highway Tolls (IOI18_highway)	C++14	5 / 100	38 ms	3320 KiB

highway

#include "highway.h"
#include <bits/stdc++.h>
using namespace std;
int useless[90010],ans;
vector<int> G[90010],u,v;
void dfs(int p){
	int ok=0;
	for (int i=0;i<G[p].size();i++)
	if (!useless[G[p][i]]){
		int rd=G[p][i];ok=1;
		useless[G[p][i]]=1;
		if (p==u[rd])dfs(v[rd]);else dfs(u[rd]);
	}
	if (ok==0)ans=p;
}
void find_pair(int N,std::vector<int> U,std::vector<int> V,int A,int B) {
	int M=U.size();
	u=U;v=V;
	memset(useless,0,sizeof(useless));
	for (int i=0;i<M;i++){
		G[u[i]].push_back(i);
		G[v[i]].push_back(i);
	}
	vector<int> w(M);
    for (int i=0;i<M;i++)w[i]=0;
    long long dist=ask(w);
    for (int i=0;i<M;i++){
    	w[i]=1;
    	long long dis=ask(w);
    	if (dist==dis)useless[i]=1;
    	w[i]=0;
	}
	dfs(0);
	answer(0,ans);
}

Compilation message (stderr)

highway.cpp: In function 'void dfs(int)':
highway.cpp:8:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0;i<G[p].size();i++)
               ~^~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 6
• Subtask 4: 0 / 33
• Subtask 5: 0 / 18
• Subtask 6: 0 / 31