Submission #160758

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
160758	2019-10-29 20:50:02	Rouge_Hugo	Cloud Computing (CEOI18_clo)	C++14	0 / 100	29 ms	1916 KiB

clo

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
int n,m;
vector<pair<long long,pair<long long ,long long >>>v;
const int M=50*2001;
long long d[2][M+10];
const long long inf=1e15;
void solve()
{
    long long last=0;
    for(int i=0;i<M-1;i++)d[0][i]=-inf;
    d[0][0]=0;
    if (v[0].second.first>0)d[0][v[0].second.first]=v[0].second.second;
    for(int i=1;i<n;i++)
    {
        for(long long  j=0;j<M-1;j++)
        {
            d[i%2][j]=max(d[(i+1)%2][j],-inf);
            if (j+v[i].second.first>0)
                d[i%2][j]=max(d[i%2][j],d[(i+1)%2][j+v[i].second.first]+v[i].second.second);
            last=max(d[i%2][j],last);
        }
    }
    cout<< last;
}
int main()
{
    cin>>n;
    int x,y,z;
    for(int i=0;i<n;i++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 18
• Subtask 2: 0 / 18
• Subtask 3: 0 / 18
• Subtask 4: 0 / 18
• Subtask 5: 0 / 18
• Subtask 6: 0 / 10