| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1052104 | YassineBenYounes | Highway Tolls (IOI18_highway) | C++17 | 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>
#include<chrono>
#include<random>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vdd vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<pii, null_type, less<pii>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
////////////////////Only Clear Code//////////////////////////
void usaco_problem(){
freopen("milkvisits.in", "r", stdin);
freopen("milkvisits.out", "w", stdout);
}
void init(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE
}
const int mx = 1e6+5;
const int LOG = 22;
const int inf = 1e9;
const ll mod = 1e9+7;
const int sq = 300;
#include "highway.h"
/*
ll ask(vi v){
return 0;
}
void answer(int l, int r){
}
*/
void find_pair(int n, vi U, vi V, ll A, ll B){
ll dis = 0;
int m = U.size();
vi w(m);
for(int i = 0; i < m;i++){
w[i] = 0;
}
ll toll = ask(w);
dis = toll / A;
int l = 0, r = n-1;
while(l <= r){
if(r == (l+1)){
answer(l, r);
break;
}
int md = (l+r)/2;
vi w(m, 0);
for(int i = 0; i < md;i++){
w[i] = 1;
}
ll toll = ask(w);
if(toll == (A*dis)){
l = md;
}
else if(toll == (B*dis)){
r = md;
}
else{
int ans = md+1;
int low = md+1, high = r;
while(low <= high){
int mid = (low + high)/2;
vi w(m, 1);
w[mid-1] = 0;
ll toll = ask(w);
if(toll % B == 0){
high = mid-1;
}
else{
ans = mid;
low = mid;
}
}
answer(ans, ans - dis);
}
}
//answer(0, N - 1);
}
/*
int32_t main(){
init();
speed;
//create_circuit(4, {1, 2, 1, 3, 1, 4});
}*/
/*
NEVER GIVE UP!
DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
Your Guide when stuck:
- Continue keyword only after reading the whole input
- Don't use memset with testcases
- Check for corner cases(n=1, n=0)
- Check where you declare n(Be careful of declaring it globally and in main)
*/