Submission #1114881

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1114881	2024-11-19 17:40:38	epicci23	Carnival Tickets (IOI20_tickets)	C++17	27 / 100	682 ms	214088 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 "tickets.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
vector<set<pair<ll,ll> > > se;
int cur[1505];
long long find_maximum(int k, vector<vector<int>> d) {
    ll c = d.size();
    ll s = d[0].size();
    ll sum =0 ,a,b,x,maxn,minx,y,z;
    vector<vector<int>> answer;
    for (int i = 0; i < c; i++) {
        vector<int> row;
        for(int j=0;j<s;j++)row.push_back(-1);
        answer.push_back(row);
    }
    ll i,j;
    for(i=0;i<c;i++){
        set<pair<ll,ll> > temp;
        for(j=0;j<s;j++){
            temp.insert(make_pair(d[i][j],j));
        }
        se.push_back(temp);
    }
    for(i=0;i<k;i++){
        vector<tuple<ll,int,int> > v;
        y = se[0].size();
        for(j=0;j<c;j++){
            auto it = *se[j].begin();
            auto it2 = *(--se[j].end());
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:44:28: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   44 |             if(se[j].size()==y){
      |                ~~~~~~~~~~~~^~~
tickets.cpp:10:22: warning: unused variable 'maxn' [-Wunused-variable]
   10 |     ll sum =0 ,a,b,x,maxn,minx,y,z;
      |                      ^~~~
tickets.cpp:10:27: warning: unused variable 'minx' [-Wunused-variable]
   10 |     ll sum =0 ,a,b,x,maxn,minx,y,z;
      |                           ^~~~
tickets.cpp:10:34: warning: unused variable 'z' [-Wunused-variable]
   10 |     ll sum =0 ,a,b,x,maxn,minx,y,z;
      |                                  ^

• 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