# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
120061 | E869120 | Tug of War (BOI15_tug) | C++14 | 3073 ms | 14512 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 <queue>
#include <set>
#include <bitset>
using namespace std;
#pragma warning (disable: 4996)
bitset<1200001>F, H, I;
bool solve(int N, int K, vector<int>G) {
F.set(600000);
for (int i = 0; i < G.size(); i++) {
H = F; F = I;
F |= (H << G[i]);
F |= (H >> G[i]);
}
for (int i = 600000 - K; i <= 600000 + K; i++) {
if (F[i] == 1) return true;
}
return false;
}
set<pair<int, int>> G[60009];
int N, K, V1, V2, A[60009], B[60009], S[60009]; bool used[60009], colored[60009];
vector<pair<int, int>> X[60009];
int main() {
scanf("%d%d", &N, &K);
for (int i = 1; i <= N * 2; i++) {
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... |