# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1071093 | thinknoexit | Arranging Tickets (JOI17_arranging_tickets) | C++17 | 0 ms | 348 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>
using namespace std;
using ll = long long;
const int N = 303;
int s[N], e[N];
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int r, c;
cin >> r >> c;
int n;
cin >> n;
for (int i = 1;i <= n;i++) cin >> s[i] >> e[i];
set<int> up, down;
for (int i = 1;i <= n;i++) {
int all = s[i] - 1;
up.insert(all);
up.insert(all / 2);
up.insert((all + 1) / 2);
all = r - s[i];
down.insert(all);
down.insert(all / 2);
down.insert((all + 1) / 2);
}
for (int i = 1;i <= n;i++) {
for (int j = i + 1;j <= n;j++) {
int all = abs(s[i] - s[j]) - 1;
up.insert(all + 1);
down.insert(all + 1);
if (all <= 0) continue;
up.insert(all);
# | 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... |