# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1136661 | dombly | Sequence (APIO23_sequence) | C++20 | 2098 ms | 59236 KiB |
#include "sequence.h"
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
using namespace std;
const int N = 5e5 + 10;
map<int,vector<int>>m;
int g(int i,int rr) {
int l = 0,r = m[i].size() - 1,ans = -1;
while(l <= r) {
int mid = (l + r) / 2;
if(m[i][mid] <= rr) {
ans = mid;
l = mid + 1;
}else {
r = mid - 1;
}
}
return ans + 1;
}
int f(int x,int l,int r) {
return g(x,r) - g(x,l - 1);
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |