# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
253530 | Markoes | Potatoes and fertilizers (LMIO19_bulves) | C++14 | 3 ms | 2432 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;
int n,a,b[500005],c[500005],id,val;
vector<pair<int,int> > va,slv;
set<int> vb;
int main(){
ios_base::sync_with_stdio(NULL);
cin.tie(0);cout.tie(0);
cin>>n;
for(int i=1;i<=n;i++){
cin>>b[i]>>a;
a -= min(a,b[i]);
b[i] -= min(a,b[i]);
if(a>0){
va.push_back(make_pair(i,a));
}
if(b[i]>0){
vb.insert(i);
}
}
memset(c,0,sizeof c);
for(auto x : va){
id = x.first;
val = x.second;
//cout<<id<<"-id val-"<<val<<endl;;
while(val>0){
auto kanan = vb.lower_bound(id);
//cout<<*kanan<<endl;
# | 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... |