제출 #1225250

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1225250		Nonoze	Carnival Tickets (IOI20_tickets)	C++20	0 / 100	1 ms	320 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
#define fi first
#define se secod
#define sz(x) (int)x.size()
#define cmin(a, b) a=min(a, b)
#define cmax(a, b) a=max(a, b)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pb push_back
#define int long long

using namespace std;

int n, m, k;
vector<vector<int>> a;

long long find_maximum(signed K, vector<vector<signed>> x) {
	n=sz(x), m=sz(x[0]), k=K;
	for (int i=0; i<n; i++) for (int j=0; j<m; j++) a[i][j]=x[i][j];
	int res=0; for (int i=0; i<n; i++) res+=a[i][0];
	vector<vector<signed>> ans; for (int i=0; i<n; i++) ans[i][0]=0;
	allocate_tickets(ans);
	return (res+n/2)/n;
}

• 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