Submission #263204

#	Time	Username	Problem	Language	Result	Execution time	Memory
263204		salma	Highway Tolls (IOI18_highway)	C++14	5 / 100	15 ms	512 KiB

highway

#include "highway.h"
#include<bits/stdc++.h>
using namespace std;

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

    std::vector<int> w(M);
    map<int,int>a;
    for (int i = 0; i < M; ++i) {
      w[i] = 0;
    }
    long long toll = ask(w);
    int cnt = toll/A;

    for(int i=0;i<N;i++){
        if(cnt == 0)break;
        w[i]=1;
        if(toll != ask(w)){
            a[V[i]]++;
            a[U[i]]++;
            cnt--;
        }
        w[i]=0;
    }
    map<int,int>::iterator it = a.begin();
    int ans1=-1 , ans2=-1;
    for(;it!=a.end();it++){
        if(it->second == 1){
            if(ans1==-1)ans1=it->first;
            else{
                ans2 = it->first;
                break;
            }
        }
    }
  answer(ans1 , ans2);
}

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