# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
904812 | Tuanlinh123 | Copy and Paste 3 (JOI22_copypaste3) | C++17 | 767 ms | 485456 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>
#define ii __int128_t
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
using namespace std;
const ll maxn=2505;
const ii p=197, Mod=1000000069;
vector <ll> pos[maxn*maxn];
ii Hash[maxn][maxn];
long long check[maxn*maxn];
ll pi[maxn][maxn], idx[maxn][maxn], cnt[maxn][maxn], R[maxn][maxn];
inline ll calc(ll l, ll r, ll q)
{
ll id=idx[l][r], len=r-l+1;
while (1)
{
ll p=upper_bound(pos[id].begin(), pos[id].end(), R[l][r])-pos[id].begin();
if (p>=pos[id].size() || pos[id][p]+len-1>q) break;
cnt[l][r]++, R[l][r]=pos[id][p]+len-1;
// cout << cnt[l][r] << " " << R[l][r] << "\n";
}
return cnt[l][r];
}
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... |