Submission #1161197

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1161197	2025-03-04 02:19:41	fatman87878	Arranging Tickets (JOI17_arranging_tickets)	C++20	0 / 100	1 ms	576 KiB

arranging_tickets

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;
#define IOS cin.tie(nullptr)->sync_with_stdio(0),cin.exceptions(cin.failbit);
#define lb(x) (x)&-(x)
#define all(x) (x).begin(),(x).end()
#define ll long long
constexpr int maxN=3e5+5;
int n,a[2][maxN<<1],b[2][maxN],spp[2][maxN<<1],valid[2][maxN];
inline int chk(int guess){
    for(int t:{0,1}){
        fill(valid[0],valid[0]+n+1,0);
        fill(valid[1],valid[1]+n+1,0);
        for(int i = 0;i<n;i++){
            int _l = lower_bound(b[t],b[t]+n,a[0][i]-guess)-b[t]-1;
            int _r = upper_bound(b[t],b[t]+n,a[0][i]+guess)-b[t]-1;
            swap(_l,_r);
            int pos0 = i,l = 0,r = 0;
            if(pos0-_l>spp[0][i])l = n;
            else l = pos0-_l;
            if(pos0-_r<=spp[0][i])r = pos0-_r;
            else r = n;
            l = max(0,l);
            r = max(l,r);
            r = min(i+1,r);
            l = min(l,r);
            valid[0][l]++;
            valid[0][r]--;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 10
• Subtask 2: 0 / 35
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 15