# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
130118 | WannnabeIOI | Seats (IOI18_seats) | C++14 | 3419 ms | 214112 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 "seats.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
const int MAXN = 5 + 1000000;
const int MAXT = 2100000;
int n, m;
vector<vector<int>> G;
vector<vector<char>> is_valid;
vector<int> R, C;
pi val[MAXN];
void ADD(pi &a, pi b){
a.first += b.first;
a.second += b.second;
}
struct seg{
pi tree[MAXT];
pi lazy[MAXT];
int cnt_min[MAXT];
void lazydown(int p){
ADD(tree[2*p], lazy[p]);
ADD(tree[2*p+1], lazy[p]);
ADD(lazy[2*p], lazy[p]);
ADD(lazy[2*p+1], lazy[p]);
lazy[p] = pi(0, 0);
}
void eat(int p){
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... |