# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
209275 | stefdasca | Tug of War (BOI15_tug) | C++14 | 2102 ms | 11256 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 pb push_back
#define fi first
#define se second
using namespace std;
int n, maxdif, skill[60002];
set<int> v[60002];
pair<int, int> vals[60002];
bool viz[60002];
int dif;
bitset<20 * 60002> dp;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> maxdif;
for(int i = 1; i <= n+n; ++i)
{
int a, b;
cin >> a >> b >> skill[i];
b += n;
v[a].insert(i);
v[b].insert(i);
vals[i] = {a, b};
}
deque<int> d;
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... |