제출 #431436

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
431436		Blistering_Barnacles	카니발 티켓 (IOI20_tickets)	C++14	0 / 100	10 ms	13340 KiB

tickets

#include "tickets.h"
#include <vector>
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll q, dp[105][100005], a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
long long find_maximum(int k, vector<vector<int>> x) {
	n = sz(x) ;
	m = sz(x[0]) ;
	for(ll i = 0 ; i < n ; i++){
        l += x[i][0] ;
	}
	vector < vll > v ;
	l /= n ;
	v.resize(n) ;
	for(ll i = 0 ; i < n ; i++){
        p += abs(x[i][0] - l) ;
        v[i].pb(0) ;
	}
	allocate_tickets(v) ;
	R p ;
}

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