oj.uz

Submission #302371

# Submission time Handle Problem Language Result Execution time Memory
302371 2020-09-18T16:03:50 Z Sho10 Carnival Tickets (IOI20_tickets) C++14
27 / 100
 810 ms 87252 KB 
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#include "tickets.h"
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll a[2005][2005],res[2005][2005],ans=0;
ll find_maximum(int K,vector<vector<int>>x){
ll n=x.size();
ll m=x[0].size();
ll k=K;
for(ll i=1;i<=n;i++)
{
    for(ll j=1;j<=m;j++)
    {
        a[i][j]=x[i-1][j-1];
    }
}
priority_queue<pair<ll,ll>>q;
for(ll i=1;i<=n;i++)
{
    ans-=a[i][1];
    q.push(mp(a[i][1]+a[i][m],i));
    res[i][1]=1;
}
for(ll i=0;i<n/2;i++)
{
    pair<ll,ll>p=q.top();
    q.pop();
    ans+=p.f;
    res[p.s][1]=0;
    res[p.s][m]=1;
}
vector<vector<int>>rasp;
rasp.resize(n);
for(ll i=1;i<=n;i++){
    for(ll j=1;j<=m;j++)
    {
        rasp[i-1].pb(res[i][j]-1);
    }
}
allocate_tickets(rasp);
return ans;
}
/*
int32_t main(){
CODE_START;
*/

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:29:4: warning: unused variable 'k' [-Wunused-variable]
   29 | ll k=K;
      |    ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 2 ms 2816 KB Output is correct
6 Correct 7 ms 12800 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 1184 KB Output is correct
5 Correct 34 ms 6136 KB Output is correct
6 Correct 810 ms 87252 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB There is no ticket of color 0 on day 1
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB There is no ticket of color 0 on day 1
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB There is no ticket of color 0 on day 1
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB There is no ticket of color 0 on day 1
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 2 ms 2816 KB Output is correct
6 Correct 7 ms 12800 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 3 ms 1184 KB Output is correct
11 Correct 34 ms 6136 KB Output is correct
12 Correct 810 ms 87252 KB Output is correct
13 Incorrect 1 ms 384 KB There is no ticket of color 0 on day 1
14 Halted 0 ms 0 KB -