# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
118433 | str0ct | 화살표 그리기 (KOI18_arrowH) | C++14 | 2 ms | 1152 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;
long long ipt[101010],w[101010],color[101010],opt[101010],sum;
int main(){
int N;
scanf("%d",&N);
for(int i=0;i<N;i++)
scanf("%lld%lld",&w[i],&ipt[i]);
memset(color,-1,sizeof(color));
for(int i=0;i<N;i++){
if(color[ipt[i]]!=-1)
opt[i]=w[i]-color[ipt[i]];
color[ipt[i]]=w[i];
}
memset(color,-1,sizeof(color));
for(int i=N-1;i>=0;i--){
if(color[ipt[i]]!=-1&&(opt[i]==0||opt[i]>color[ipt[i]]-w[i]))
opt[i]=color[ipt[i]]-w[i];
color[ipt[i]]=w[i];
}
for(int i=0;i<N;i++)
sum+=opt[i];
printf("%lld",sum);
}
Compilation message (stderr)
# | 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... |