# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
469930 | luciocf | 역사적 조사 (JOI14_historical) | C++14 | 1832 ms | 134896 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>
using namespace std;
typedef long long ll;
const int maxn = 1e5+10;
const int sq = 320;
int n;
int a[maxn], b[maxn];
int fq[maxn][sq], fq_aux[maxn];
ll best[sq][sq];
int soma(int l, int r, int v)
{
if (l == 0) return fq[v][r];
return fq[v][r] - fq[v][l-1];
}
int main(void)
{
int q;
scanf("%d %d", &n, &q);
map<int, int> mp;
for (int i = 1; i <= n; i++)
{
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... |