# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
208202 | E869120 | Scissors and Tape (CEOI19_scissors) | C++14 | 66 ms | 68476 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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#pragma warning (disable: 4996)
int N; vector<pair<int, int>> X;
int M; vector<pair<int, int>> Y;
int G;
int ax[1 << 18], ay[1 << 18], bx[1 << 18], by[1 << 18];
int cx[1 << 18], cy[1 << 18], dx[1 << 18], dy[1 << 18]; bool trans[1 << 18];
void solve(int H1, int W1, int H2, int W2, int idx) {
if (H1 == H2 && W1 == W2) {
ax[idx] = 0; ay[idx] = 0; bx[idx] = H1; by[idx] = W1;
cx[idx] = 0; cy[idx] = 0; dx[idx] = H2; dy[idx] = W2;
trans[idx] = false;
G = idx;
return;
}
if (H1 == W2 && H2 == W1) {
ax[idx] = 0; ay[idx] = 0; bx[idx] = H1; by[idx] = W1;
cx[idx] = 0; cy[idx] = 0; dx[idx] = H2; dy[idx] = W2;
trans[idx] = true;
G = idx;
return;
}
int c[4] = { H1, H2, W1, W2 }; sort(c, c + 4);
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |