| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1071360 | vjudge1 | Art Exhibition (JOI18_art) | C++17 | 1096 ms | 24004 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;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sz size
#define mp make_pair
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fre(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define s second
#define f first
#define ii pair<ll,ll>
const ll mod=1e9+7;
const int N=2e5+6;
const ll inf=1e12+5;
ll n,m,k,d[N],g[N];
int main()
{
ios
cin>>n;
ii v[n];
for(int i=0;i<n;++i)
{
cin>>v[i].f>>v[i].s;
}
sort(v,v+n);
vector<ii> a;
k=0;
for(int i=0;i<n;++i)
{
if (i>0 && v[i].f==v[i-1].f)
{
k+=v[i].s;
}
else
{
if(i>0)
{
a.pb(mp(v[i-1].f,k));
}
k=v[i].s;
}
}
a.pb(mp(v[n-1].f,k));
vector<ll> sum;
ll l=0,r;
for(int i=0;i<a.sz();++i)
{
l+=a[i].s;
sum.pb(l);
}
m=0;
for (int i=0;i<a.sz();++i)
{
r=0;
for (int j=i;j<a.sz();++j)
{
if (i-1<0)k=sum[j];
else k=sum[j]-sum[i-1];
//cout<<k;
r=k-(a[j].f-a[i].f);
m=max(m,r);
}
}
cout<<m;
}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... | ||||
