Submission #1074661

#TimeUsernameProblemLanguageResultExecution timeMemory
1074661woodHighway Tolls (IOI18_highway)C++17
6 / 100
67 ms2540 KiB
#include "highway.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> p32; typedef pair<ll,ll> p64; #define pb push_back #define eb emplace_back #define fi first #define se second #define vi vector<int> #define vp32 vector<p32> #define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) #define MOD %1000000007 #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; //never guess //never debug without reviewing code //never try adding ones or substracting them //only step by step debug when necessay void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) { int m = U.size(), n = N; vi w(m); ll cost = ask(w); int l = -1, r = n-1; while(r-l>1){ int mid = (r+l)/2; vi souel(m); for(int i = l+1; i<=mid;i++){ souel[i] = true; } if(ask(souel)==cost) l = mid; else r = mid; } answer(r,r+cost/A); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...