oj.uz

Submission #201829

# Submission time Handle Problem Language Result Execution time Memory
201829 2020-02-12T06:19:24 Z theStaticMind Two Dishes (JOI19_dishes) C++14
10 / 100
 1584 ms 1048580 KB 
#include<bits/stdc++.h>
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;
vector<int> Ta(1000005);
vector<int> Tb(1000005);
vector<int> Sa(1000005);
vector<int> Sb(1000005);
vector<int> Va(1000005);
vector<int> Vb(1000005);
vector<int> Pa(1000005, 0);
vector<int> Pb(1000005, 0);
int32_t main(){
      ios_base::sync_with_stdio(false);
      cin.tie(NULL);
//      freopen("q.gir","r",stdin);
//      freopen("q.cik","w",stdout);
      int n, m;
      cin >> n >> m;
      for(int i = 1; i <= n; i++) cin >> Sa[i] >> Ta[i] >> Va[i];
      for(int i = 1; i <= m; i++) cin >> Sb[i] >> Tb[i] >> Vb[i];
      for(int i = 1; i <= n; i++) Pa[i] = Pa[i - 1] + Sa[i];
      for(int i = 1; i <= m; i++) Pb[i] = Pb[i - 1] + Sb[i];
      vector<vector<int> > dp(n + 1, vector<int> (m + 1, 0));
      dp[0][0] = 0;
      for(int i = 0; i <= n; i++){
            for(int j = 0; j <= m; j++){
                  int q = -INF, w = -INF;
                  if(i > 0) q = dp[i - 1][j];
                  if(j > 0) w = dp[i][j - 1];
                  if(Pa[i] + Pb[j] <= Ta[i]){
                        dp[i][j] = max(dp[i][j], q + Va[i]);
                  }
                  if(Pa[i] + Pb[j] <= Tb[j]){
                        dp[i][j] = max(dp[i][j], w + Vb[j]);
                  }
                  dp[i][j] = max(dp[i][j], max(q, w));
            }
      }
      cout << dp[n][m];
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 1584 ms 1048580 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 62968 KB Output is correct
2 Correct 40 ms 63096 KB Output is correct
3 Correct 41 ms 62968 KB Output is correct
4 Correct 39 ms 62968 KB Output is correct
5 Correct 39 ms 62968 KB Output is correct
6 Correct 38 ms 62968 KB Output is correct
7 Correct 39 ms 62968 KB Output is correct
8 Correct 41 ms 62968 KB Output is correct
9 Correct 39 ms 62968 KB Output is correct
10 Correct 42 ms 62968 KB Output is correct
11 Correct 38 ms 62968 KB Output is correct
12 Correct 39 ms 62968 KB Output is correct
13 Correct 39 ms 62968 KB Output is correct
14 Correct 40 ms 62968 KB Output is correct
15 Correct 38 ms 62968 KB Output is correct
16 Correct 52 ms 62968 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 62968 KB Output is correct
2 Correct 40 ms 63096 KB Output is correct
3 Correct 41 ms 62968 KB Output is correct
4 Correct 39 ms 62968 KB Output is correct
5 Correct 39 ms 62968 KB Output is correct
6 Correct 38 ms 62968 KB Output is correct
7 Correct 39 ms 62968 KB Output is correct
8 Correct 41 ms 62968 KB Output is correct
9 Correct 39 ms 62968 KB Output is correct
10 Correct 42 ms 62968 KB Output is correct
11 Correct 38 ms 62968 KB Output is correct
12 Correct 39 ms 62968 KB Output is correct
13 Correct 39 ms 62968 KB Output is correct
14 Correct 40 ms 62968 KB Output is correct
15 Correct 38 ms 62968 KB Output is correct
16 Correct 52 ms 62968 KB Output is correct
17 Correct 93 ms 94456 KB Output is correct
18 Correct 76 ms 94456 KB Output is correct
19 Correct 99 ms 94584 KB Output is correct
20 Correct 83 ms 92152 KB Output is correct
21 Correct 88 ms 93304 KB Output is correct
22 Correct 91 ms 94456 KB Output is correct
23 Correct 87 ms 94456 KB Output is correct

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 62968 KB Output is correct
2 Correct 40 ms 63096 KB Output is correct
3 Correct 41 ms 62968 KB Output is correct
4 Correct 39 ms 62968 KB Output is correct
5 Correct 39 ms 62968 KB Output is correct
6 Correct 38 ms 62968 KB Output is correct
7 Correct 39 ms 62968 KB Output is correct
8 Correct 41 ms 62968 KB Output is correct
9 Correct 39 ms 62968 KB Output is correct
10 Correct 42 ms 62968 KB Output is correct
11 Correct 38 ms 62968 KB Output is correct
12 Correct 39 ms 62968 KB Output is correct
13 Correct 39 ms 62968 KB Output is correct
14 Correct 40 ms 62968 KB Output is correct
15 Correct 38 ms 62968 KB Output is correct
16 Correct 52 ms 62968 KB Output is correct
17 Correct 93 ms 94456 KB Output is correct
18 Correct 76 ms 94456 KB Output is correct
19 Correct 99 ms 94584 KB Output is correct
20 Correct 83 ms 92152 KB Output is correct
21 Correct 88 ms 93304 KB Output is correct
22 Correct 91 ms 94456 KB Output is correct
23 Correct 87 ms 94456 KB Output is correct
24 Execution timed out 152 ms 70076 KB Time limit exceeded (wall clock)
25 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 62968 KB Output is correct
2 Correct 40 ms 63096 KB Output is correct
3 Correct 41 ms 62968 KB Output is correct
4 Correct 39 ms 62968 KB Output is correct
5 Correct 39 ms 62968 KB Output is correct
6 Correct 38 ms 62968 KB Output is correct
7 Correct 39 ms 62968 KB Output is correct
8 Correct 41 ms 62968 KB Output is correct
9 Correct 39 ms 62968 KB Output is correct
10 Correct 42 ms 62968 KB Output is correct
11 Correct 38 ms 62968 KB Output is correct
12 Correct 39 ms 62968 KB Output is correct
13 Correct 39 ms 62968 KB Output is correct
14 Correct 40 ms 62968 KB Output is correct
15 Correct 38 ms 62968 KB Output is correct
16 Correct 52 ms 62968 KB Output is correct
17 Correct 93 ms 94456 KB Output is correct
18 Correct 76 ms 94456 KB Output is correct
19 Correct 99 ms 94584 KB Output is correct
20 Correct 83 ms 92152 KB Output is correct
21 Correct 88 ms 93304 KB Output is correct
22 Correct 91 ms 94456 KB Output is correct
23 Correct 87 ms 94456 KB Output is correct
24 Execution timed out 152 ms 70076 KB Time limit exceeded (wall clock)
25 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 62968 KB Output is correct
2 Correct 40 ms 63096 KB Output is correct
3 Correct 41 ms 62968 KB Output is correct
4 Correct 39 ms 62968 KB Output is correct
5 Correct 39 ms 62968 KB Output is correct
6 Correct 38 ms 62968 KB Output is correct
7 Correct 39 ms 62968 KB Output is correct
8 Correct 41 ms 62968 KB Output is correct
9 Correct 39 ms 62968 KB Output is correct
10 Correct 42 ms 62968 KB Output is correct
11 Correct 38 ms 62968 KB Output is correct
12 Correct 39 ms 62968 KB Output is correct
13 Correct 39 ms 62968 KB Output is correct
14 Correct 40 ms 62968 KB Output is correct
15 Correct 38 ms 62968 KB Output is correct
16 Correct 52 ms 62968 KB Output is correct
17 Correct 93 ms 94456 KB Output is correct
18 Correct 76 ms 94456 KB Output is correct
19 Correct 99 ms 94584 KB Output is correct
20 Correct 83 ms 92152 KB Output is correct
21 Correct 88 ms 93304 KB Output is correct
22 Correct 91 ms 94456 KB Output is correct
23 Correct 87 ms 94456 KB Output is correct
24 Execution timed out 152 ms 70076 KB Time limit exceeded (wall clock)
25 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 1584 ms 1048580 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 1584 ms 1048580 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -