# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101164 | square1001 | Wall (CEOI14_wall) | C++14 | 926 ms | 17152 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 <queue>
#include <vector>
#include <cassert>
#include <iostream>
#include <functional>
using namespace std;
const long long inf = 1LL << 61;
class edge {
public:
int to, bit; long long cost;
edge() : to(-1), cost(0), bit(0) {};
edge(int to_, long long cost_, int bit_) : to(to_), cost(cost_), bit(bit_) {};
};
class state {
public:
int pos, bit; long long cost;
state() : pos(-1), cost(0), bit(0) {};
state(int pos_, long long cost_, int bit_) : pos(pos_), cost(cost_), bit(bit_) {};
bool operator>(const state& s) const {
return cost > s.cost;
}
};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int H, W;
cin >> H >> W;
vector<vector<int> > A(H, vector<int>(W));
vector<pair<int, int> > points;
for (int i = 0; i < H; ++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... |