제출 #998160

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
998160		Arapak	카니발 티켓 (IOI20_tickets)	C++17	0 / 100	1 ms	348 KiB

tickets

// Author: Kajetan Ramsza
#include "bits/stdc++.h"
#include "tickets.h"
using namespace std;

#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

template<typename F, typename S> ostream& operator<<(ostream& os, const pair<F, S> &p) { return os<<"("<<p.first<<", "<<p.second<<")"; }
template<typename T> ostream &operator<<(ostream & os, const vector<T> &v) { os << "{"; typename vector< T > :: const_iterator it;
    for( it = v.begin(); it != v.end(); it++ ) { if( it != v.begin() ) os << ", "; os << *it; } return os << "}"; }

void dbg_out() { cerr<<'\n'; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr<<' '<<H; dbg_out(T...); }

#ifdef DEBUG
#define dbg(...) cerr<<"(" << #__VA_ARGS__ <<"):", dbg_out(__VA_ARGS__)
#else
#define dbg(...) 
#endif

int n, m, k;
vector<vi> answer;

ll find_maximum(int k_, vector<vi> x) {
	k = k_;
	n = x.size();
	m = x[0].size();
	answer.assign(n, vi(m, -1));
	rep(i,0,n) {
		rep(j,0,m) {
			if (j < k) {
				answer[i][j] = j;
			} else {
				answer[i][j] = -1;
			}
		}
	}
	allocate_tickets(answer);
	return 1;
}

• 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