# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
278871 | shrek12357 | Dominance (CEOI08_dominance) | C++14 | 35 ms | 768 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.
#include <bits/stdc++.h>
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define sorv(V) sort(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define upmin(a,b) (a)=min((a),(b))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
vector<pii> EV[6005];
int S[2][6005];
int SY[3005], EY[3005], SX[3005], EX[3005];
int A[3005], B[3005], C[3005];
bitset<3005> D;
ll AnsW, AnsB;
int N;
void process() {
vector<int> YV, XV;
for(int i = 0; i < N; i++) {
EY[i]++; EX[i]++;
YV.eb(SY[i]); YV.eb(EY[i]);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |