# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1167360 | gyg | 카니발 티켓 (IOI20_tickets) | C++20 | 355 ms | 92752 KiB |
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sig signed
#define arr array
#define vec vector
#define pii pair<int, int>
#define fir first
#define sec second
#define mp make_pair
const int N = 1505, M = 1505, INF = 1e18;
int n, m, k;
arr<arr<int, M>, N> a;
arr<int, N> lst, mst;
void prp_cmp() {
for (int i = 1; i <= n; i++) {
lst[i] = *min_element(a[i].begin() + 1, a[i].begin() + m + 1);
mst[i] = *max_element(a[i].begin() + 1, a[i].begin() + m + 1);
// cout << i << ": " << lst[i] << " " << mst[i] << '\n';
}
}
arr<arr<pii, N>, N> dp;
void dp_cmp() {
dp[0].fill({-INF, -1});
dp[0][0] = {0, -1};
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |