oj.uz

Submission #955039

# Submission time Handle Problem Language Result Execution time Memory
955039 2024-03-29T08:28:26 Z Trisanu_Das Carnival Tickets (IOI20_tickets) C++17
27 / 100
 414 ms 73192 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
 
long long find_maximum(int k, vector<vector<int> > x) {
  int n = x.size(), m = x[0].size();
  vector<vector<int> > ans(n, vector<int>(m, -1));
  if(k == 1){
    long long sum = 0;
    priority_queue<pair<long long, long long>,  vector<pair<long long, long long> >, greater<pair<long long, long long> > > pq;
    for(int i = 0; i < n; i++){
      sum += x[i][m - 1];
      pq.push({x[i][0] + x[i][m - 1], i});
    }
    for(int i = 0; i < n; i++){
      if(i < n / 2){
        sum -= pq.top().first;
        ans[pq.top().second][0] = 0;
      }else ans[pq.top().second][m - 1] = 0;
      pq.pop();
    }
    allocate_tickets(ans);
    return sum;
  }
}

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:7:49: warning: control reaches end of non-void function [-Wreturn-type]
    7 |   vector<vector<int> > ans(n, vector<int>(m, -1));
      |                                                 ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 860 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 17 ms 3164 KB Output is correct
6 Correct 414 ms 73192 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 600 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 17 ms 3164 KB Output is correct
12 Correct 414 ms 73192 KB Output is correct
13 Runtime error 2 ms 600 KB Execution killed with signal 6
14 Halted 0 ms 0 KB -