# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
110298 | polyfish | Coin Collecting (JOI19_ho_t4) | C++14 | 3 ms | 384 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//Pantyhose(black) + glasses = infinity
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " = " << x << '\n';
#define BP() cerr << "OK!\n";
#define PR(A, n) {cerr << #A << " = "; for (int _=1; _<=n; ++_) cerr << A[_] << ' '; cerr << '\n';}
#define PR0(A, n) {cerr << #A << " = "; for (int _=0; _<n; ++_) cerr << A[_] << ' '; cerr << '\n';}
#define FILE_NAME "coincollecting"
const int MAX_N = 200002;
const int INF = 1e9;
int n, cnt[3][MAX_N];
int64_t res;
pair<int, int> a[MAX_N];
void read_input() {
cin >> n;
for (int i=1; i<=2*n; ++i)
cin >> a[i].second >> a[i].first;
}
void init() {
for (int i=1; i<=2*n; ++i) {
vector<int> p = {1, n};
if (0<a[i].second && a[i].second<=n)
p.push_back(a[i].second);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |