# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
299615 | square1001 | Werewolf (IOI18_werewolf) | C++14 | 2764 ms | 159596 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 "werewolf.h"
#include <queue>
#include <string>
#include <vector>
#include <numeric>
#include <iostream>
#include <algorithm>
using namespace std;
class history {
public:
int tl, tr, x;
history() : tl(0), tr(0), x(-1) {};
history(int tl_, int tr_, int x_) : tl(tl_), tr(tr_), x(x_) {};
};
class rectangle {
public:
int xl, yl, xr, yr;
rectangle() : xl(0), yl(0), xr(0), yr(0) {};
rectangle(int xl_, int yl_, int xr_, int yr_) : xl(xl_), yl(yl_), xr(xr_), yr(yr_) {};
};
class query {
public:
int y, x, tp;
query() : y(0), x(0), tp(-1) {};
query(int y_, int x_, int tp_) : y(y_), x(x_), tp(tp_) {};
};
std::vector<int> check_validity(int N, std::vector<int> X, std::vector<int> Y, std::vector<int> S, std::vector<int> E, std::vector<int> L, std::vector<int> R) {
// step #1. setup
int M = X.size(), Q = S.size();
vector<vector<int> > GU(N), GD(N);
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... |