# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
25194 | minimario | Tug of War (BOI15_tug) | C++14 | 296 ms | 27440 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;
const int MAX = 30005;
set<int> left1[MAX];
set<int> right1[MAX];
int l[2*MAX], r[2*MAX], s[2*MAX]; // the people
int leftpts = 0;
int rightpts = 0;
int ropel[MAX], roper[MAX];
void nosolution() {
printf("NO\n"); exit(0);
}
int main() {
//freopen("a.in", "r", stdin);
//freopen("a.out", "w", stdout);
int n, k; scanf("%d %d", &n, &k);
set<int> students;
for (int i=1; i<=2*n; i++) {
scanf("%d %d %d", &l[i], &r[i], &s[i]);
right1[r[i]].insert(i);
left1[l[i]].insert(i);
students.insert(i);
}
set<pair<int, int>> left_data, right_data;
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... |