답안 #426377

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
426377	2021-06-13T21:22:20 Z	Pbezz	통행료 (IOI18_highway)	C++14	6 / 100	154 ms	2456 KB

highway

#include "highway.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
typedef pair<ll,ll> pii;

const ll MAXN = 2e5+5;
const ll INF = 1e9+7;
ll n,M,W;

ll find(){


ll lo=0,hi=M-1,mid,i,x;

while(hi>lo){

mid = lo + (hi-lo)/2;//cout<<hi<<" "<<lo<<" "<<mid<<" ";
std::vector<int> w(M);
for(i=0;i<M;i++){w[i] = i<=mid ;}
x=ask(w);
//cout<<x<<endl;
if(x>W){
hi=mid;
}else{
lo=mid+1;
}
}

return hi;
}

void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
	M = U.size();
	n=N;
std::vector<int> w(M);
	W = ask(w);

	ll s=find();

//	cout<<s<<"\n";

	answer(s,s+(W/A));


}

Subtask #1
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	200 KB	Output is incorrect: {s, t} is wrong.
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	200 KB	Output is incorrect: {s, t} is wrong.
2	Halted	0 ms	0 KB	-

Subtask #3
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	18 ms	488 KB	Output is correct
2	Correct	38 ms	704 KB	Output is correct
3	Correct	30 ms	980 KB	Output is correct
4	Correct	85 ms	2400 KB	Output is correct
5	Correct	146 ms	2400 KB	Output is correct
6	Correct	154 ms	2456 KB	Output is correct
7	Correct	83 ms	2412 KB	Output is correct
8	Correct	126 ms	2404 KB	Output is correct
9	Correct	144 ms	2408 KB	Output is correct