Submission #1078976

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1078976	2024-08-28 08:53:04	KaleemRazaSyed	Carnival Tickets (IOI20_tickets)	C++17	27 / 100	395 ms	89336 KiB

tickets

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>
#include "tickets.h"
using namespace std;
typedef long long ll;
long long find_maximum(int k, vector<vector<int> > d)
{
  int n = d.size(), m = d[0].size();
  vector<vector<int> > sol(n, vector<int> (m, -1));
  ll sm = 0;
  if(k == 1)
    {
      // assuming my k = 1
      int par[n + 1][n + 1];
      ll dp[n + 1][n + 1];
      for(int i = 0; i <= n; i ++)
  for(int j = 0; j <= n; j ++)
    dp[i][j] = -1e18;
  
      dp[0][0] = 0;
  
      for(int i = 1; i <= n; i ++)
  for(int j = 0; j <= i; j++)
    {
      dp[i][j] = max(dp[i][j], dp[i - 1][j] - d[i - 1][0]);
      par[i][j] = j;
  
      if(j > 0 && dp[i][j] < dp[i - 1][j - 1] + d[i - 1].back())
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:53:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |       for(int i = 0; i < vec.size() / 2; i ++)
      |                      ~~^~~~~~~~~~~~~~~~
tickets.cpp:69:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |       for(int i = 0; i < vec.size() / 2; i ++)
      |                      ~~^~~~~~~~~~~~~~~~
tickets.cpp:71:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |       for(int i = vec.size() / 2; i < vec.size(); i ++)
      |                                   ~~^~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 16 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10