Submission #1036320

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1036320	2024-07-27 08:43:45	12345678	Roller Coaster Railroad (IOI16_railroad)	C++17	0 / 100	311 ms	29228 KiB

railroad

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
const int nx=4e5+5;
int n, T, qsl[nx], qsr[nx], ans;
map<int, int> mp;
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    n=s.size();
    for (int i=0; i<n; i++) mp[s[i]]=mp[t[i]]=0;
    for (auto &[x, y]:mp) y=++T;
    for (int i=0; i<n; i++)
    {
        if (s[i]<t[i]) qsr[mp[s[i]]]++, qsr[mp[t[i]]]--;
        else qsl[mp[t[i]]]++, qsl[mp[s[i]]]--;
    }
    for (int i=1; i<=2*n; i++) qsr[i]+=qsr[i-1], qsl[i]+=qsl[i-1];
    for (int i=1; i<=2*n; i++) if (qsr[i]-1>qsl[i]) ans=1;
    return ans;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 11
• Subtask 2: 0 / 23
• Subtask 3: 0 / 30
• Subtask 4: 0 / 36