Submission #1009662

#	Time	Username	Problem	Language	Result	Execution time	Memory
1009662		aaaaaarroz	통행료 (IOI18_highway)	C++17	5 / 100	9 ms	1168 KiB

highway

    #include<bits/stdc++.h>
    #include "highway.h"
     
    using namespace std;
     
    #define ll long long
    #define pb push_back
    #define ff first
    #define ss second
    #define all(s) s.begin(),s.end()
    #define rall(s) s.rbegin(),s.rend()
     
    void find_pair(int n,vector<int>u,vector<int>v,int A, int B){
        int m=u.size();
        vector<int>w(m,0);
        vector<pair<int,int>>adj[n];
        for(int i=0;i<m;i++){
            adj[u[i]].pb({v[i],i});
            adj[v[i]].pb({u[i],i});
        }
        ll C=ask(w);
        for(int t=1;t<n;t++){
            for(auto [_,i]:adj[t]){
                w[i]=1;
            }
            ll cost=ask(w);
            if(cost==C-A+B){
                answer(0,t);
                break;
            }
            for(auto [_,i]:adj[t]){
                w[i]=0;
            }
        }
        return;
    }

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