# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
373292 | Seanliu | Port Facility (JOI17_port_facility) | C++17 | 4528 ms | 492400 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 <algorithm>
#define ericxiao ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
const long long int MOD = 1e9 + 7;
const int maxN = 2e6 + 326;
int N, A[maxN], B[maxN], col[maxN], isIn[maxN], arr[maxN];
inline long long int mpow(long long int b, int e){
long long int r = 1;
for(int i = 0; i < 32; i++){
if((e >> i) & 1) r = r * b % MOD;
b = b * b % MOD;
}
return r;
}
struct Query{
int l, r, id;
Query(){}
Query(int l, int r, int id): l(l), r(r), id(id){}
};
vector<Query> ques;
bool has[maxN << 2][2];
vector<int> adj[maxN], seg[maxN << 2];
int query(int id, int l, int r, int p, int u){
# | 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... |