# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43184 | yusufake | Wiring (IOI17_wiring) | C++98 | 85 ms | 10732 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 pb push_back
#define mp make_pair
#define st first
#define nd second
typedef long long ll;
const ll inf = 1e18 + 1;
const int mod = 1e9 + 7;
const int N = 2e5 + 5;
pair < ll , int > T[N];
ll L[N],R[N],t,dp[N],p[N];
ll bld(ll l, ll r, ll x, ll y){
ll i,sz,p=0;
for(sz=1,i=r; i>=l ;i--, sz++){
p += T[i].st;
L[sz] = min(dp[i],dp[i-1]) - p + sz*x;
R[sz] = min(dp[i],dp[i-1]) - p + sz*y;
}
if(L[sz] < mod || R[sz] < mod) assert(0);
return sz-1;
}
ll min_total_length(vector < int > a, vector < int > b){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |