Submission #123901

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
123901	2019-07-02 09:15:22	nvmdava	Highway Tolls (IOI18_highway)	C++17	100 / 100	411 ms	10588 KiB

highway

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "highway.h"
#define pb push_back
#include <bits/stdc++.h>
using namespace std;
vector<int> adj[100005];
vector<int> path;
long long def;
vector<int> w;
int v[3], p[100005], cat[100005];
vector<int> com[3];
int solve(vector<int>& ve){
  reverse(ve.begin(), ve.end());
  int l = 0, r = ve.size() - 1;
  while(l != r){
    int m = (l + r) >> 1;
    for(int i = 0; i <= m; i++)
      w[p[ve[i]]] = 1;
    if(ask(w) > def) r = m;
    else l = m + 1;
    for(int i = 0; i <= m; i++)
      w[p[ve[i]]] = 0;
  }
  return ve[l];
}
void find_pair(int N, vector<int> U, vector<int> V, int A, int B) {
  int m = U.size();
  for(int i = 0; i < m; i++){
    adj[U[i]].pb(i);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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