# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
511259 | ArianKheirandish | Long Mansion (JOI17_long_mansion) | C++17 | 316 ms | 68956 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.
// in the name of God//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define debug(x) cerr << #x << " = " << x << endl;
const int maxn = 5e5 + 10;
int n, q;
vector<int> a[maxn], keys[maxn];
int b[maxn], c[maxn];
int dpL[maxn], dpR[maxn];
bool check(int l, int r, int x){
int ind = lower_bound(keys[x].begin(),keys[x].end(), l) - keys[x].begin();
if(ind < keys[x].size() && keys[x][ind] <= r)
return 1;
else
return 0;
}
int main(){
ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin >> n;
for(int i = 1 ; i < n ; i ++)
cin >> c[i];
for(int i = 1 ; i <= n ; i ++){
cin >> b[i];
for(int j = 0 ; j < b[i] ; j ++){
int x;
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... |