oj.uz

Submission #260452

# Submission time Handle Problem Language Result Execution time Memory
260452 2020-08-10T09:44:09 Z rrrr10000 Cloud Computing (CEOI18_clo) C++14
100 / 100
 505 ms 1408 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
int main(){
    ll n;cin>>n;
    vector<PP> v;
    rep(i,n){
        ll c,f,t;cin>>c>>f>>t;
        v.eb(f,t,c);
    }
    ll m;cin>>m;
    rep(i,m){
        ll c,f,t;cin>>c>>f>>t;
        v.eb(f,-t,c);
    }
    sort(all(v));reverse(all(v));
    vi dp(50*n+5,-inf);dp[0]=0;
    rep(i,n+m){
        ll f,t,c;tie(f,t,c)=v[i];
        if(t>0){
            for(int j=dp.size()-1;j>=c;j--)if(dp[j-c]!=-inf)chmax(dp[j],dp[j-c]-t);
        }
        else{
            rep(j,dp.size()-c)if(dp[j+c]!=-inf)chmax(dp[j],dp[j+c]-t);
        }
    }
    ll ans=0;
    for(ll x:dp)chmax(ans,x);
    out(ans);
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 508 KB Output is correct
8 Correct 5 ms 384 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 44 ms 768 KB Output is correct
6 Correct 41 ms 768 KB Output is correct
7 Correct 250 ms 1280 KB Output is correct
8 Correct 222 ms 1280 KB Output is correct
9 Correct 201 ms 1152 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 7 ms 384 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 113 ms 1024 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 396 ms 1280 KB Output is correct
6 Correct 486 ms 1280 KB Output is correct
7 Correct 406 ms 1280 KB Output is correct
8 Correct 397 ms 1280 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 372 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 28 ms 640 KB Output is correct
4 Correct 79 ms 768 KB Output is correct
5 Correct 459 ms 1280 KB Output is correct
6 Correct 505 ms 1280 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 508 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 44 ms 768 KB Output is correct
14 Correct 41 ms 768 KB Output is correct
15 Correct 250 ms 1280 KB Output is correct
16 Correct 222 ms 1280 KB Output is correct
17 Correct 201 ms 1152 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 7 ms 384 KB Output is correct
25 Correct 7 ms 384 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 113 ms 1024 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 396 ms 1280 KB Output is correct
31 Correct 486 ms 1280 KB Output is correct
32 Correct 406 ms 1280 KB Output is correct
33 Correct 397 ms 1280 KB Output is correct
34 Correct 1 ms 372 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 28 ms 640 KB Output is correct
37 Correct 79 ms 768 KB Output is correct
38 Correct 459 ms 1280 KB Output is correct
39 Correct 505 ms 1280 KB Output is correct
40 Correct 30 ms 512 KB Output is correct
41 Correct 87 ms 768 KB Output is correct
42 Correct 230 ms 1152 KB Output is correct
43 Correct 492 ms 1408 KB Output is correct
44 Correct 471 ms 1408 KB Output is correct
45 Correct 457 ms 1408 KB Output is correct
46 Correct 105 ms 768 KB Output is correct
47 Correct 219 ms 1152 KB Output is correct
48 Correct 219 ms 1152 KB Output is correct