Submission #1164274

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1164274	2025-03-09 10:17:24	dragst	Garden (JOI23_garden)	C++20	15 / 100	274 ms	20408 KiB

garden

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const long long inf=1e9;
long long d, p[500005], q[500005], r[500005], s[500005], id[500005], nxt[5005], pre[5005], check[5005], check2[5005], mn;
vector<long long> v1, v2, v[5005];
bool sortt(long long x, long long y) {return p[x]<p[y];}
void build()
{
    mn=1e9;
    long long n=v2.size(), i;
    for (i=1; i<n; i++)
    {
        check[v2[i]]=check2[v2[i]];
        pre[v2[i]]=v2[i-1];
        nxt[v2[i-1]]=v2[i];
        mn=min(mn, v2[i-1]+d-v2[i]+1);
    };
    pre[v2[0]]=v2[n-1];
    nxt[v2[n-1]]=v2[0];
    check[v2[0]]=check2[v2[0]];
    mn=min(mn, v2[n-1]-v2[0]+1);
}
void del(long long x)
{
    mn=min(mn, (pre[x]+d-nxt[x])%d+1);
    pre[nxt[x]]=pre[x];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 15 / 15
• Subtask 2: 0 / 6
• Subtask 3: 0 / 8
• Subtask 4: 0 / 16
• Subtask 5: 0 / 30
• Subtask 6: 0 / 25