| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 136470 | Nucleist | 통행료 (IOI18_highway) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 1000000000
#define pb push_back
struct greateri
{
template<class T>
bool operator()(T const &a, T const &b) const { return a > b; }
};
int dist[90001];
vector<int>adj[90001];
bool vis[90001];
map<pair<int,int>,int>gg;
map<pair<int,int>,int>gg1;
map<int,vector<int>>gg2;
int s,t;
int s1;
int n,m;
void dfs_tree(int node)
{
dist[node]=s1;
gg2[s1].pb(node);
s1+=s;
vis[node]=1;
for (int i = 0; i < adj[node].size(); ++i)
{
if(vis[adj[node][i]]!=1)
{ gg[{adj[node][i],node}]=gg1[{min(adj[node][i],node),max(adj[node][i],node)}];
dfs_tree(adj[node][i]);}
}
s1-=s;
}
void find_pair(int N,int U[], int V[], int A, int B)
{
//flash;
n=N;
m=sizeof(U)/sizeof(U[0]);
for (int i = 0; i < m; ++i)
{
int x,y;
x=U[i];
y=V[i];
adj[x].pb(y);
adj[y].pb(x);
gg1[{min(x,y),max(x,y)}]=i;
}
s=A;
t=B;
s1=0;
dfs_tree(0);
int now[m]={0};
int vol = ask(now);
for(auto it:gg2[vol])
{
auto voli = gg.lower_bound({it,-INF});
auto kal = *voli;
int kal1 = kal.second;
int now[m]={0};
now[kal1]=1;
int ans = ask(now);
if(ans!=vol)
answer(0,it);
}
}
//code the AC sol !
// BS/queue/map