# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
296759 | Bruteforceman | Seats (IOI18_seats) | C++11 | 4089 ms | 174616 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"
#include "seats.h"
using namespace std;
const int maxn = 1e6 + 10;
vector <vector <int>> a;
vector <vector <bool>> can;
vector <int> row, col;
int h, w;
int arr[maxn];
bool inside(int x, int y) {
return (0 <= x && x < h) && (0 <= y && y < w);
}
struct node {
int val, cnt;
int lazy;
void add(int x) {
val += x;
lazy += x;
}
} t[maxn * 4];
void pushdown(int c) {
if(!t[c].lazy) return ;
int l = c << 1;
int r = l + 1;
t[l].add(t[c].lazy);
t[r].add(t[c].lazy);
t[c].lazy = 0;
}
void build(int c = 1, int b = 0, int e = h * w - 1) {
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |