Submission #617810

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
617810	2022-08-01 14:45:50	Bench0310	Roller Coaster Railroad (IOI16_railroad)	C++17	0 / 100	130 ms	12720 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
25
26
27
28
29
30
#include <bits/stdc++.h>
#include "railroad.h"
using namespace std;
typedef long long ll;
ll plan_roller_coaster(vector<int> s,vector<int> t)
{
    int n=s.size();
    s.push_back((1<<30));
    t.push_back(0);
    vector<array<int,2>> one(n+1);
    for(int i=0;i<=n;i++) one[i]={t[i],i};
    vector<array<int,2>> two(n+1);
    for(int i=0;i<=n;i++) two[i]={s[i],i};
    sort(one.begin(),one.end());
    sort(two.begin(),two.end());
    vector<int> h(n+1,0);
    for(int i=0;i<=n;i++) h[one[i][1]]=i;
    for(int i=0;i<=n;i++)
    {
        one[i][1]=i;
        two[i][1]=h[two[i][1]];
        //~ cout << "[" << one[i][0] << "," << one[i][1] << "] [" << two[i][0] << "," << two[i][1] << "]" << endl;
    }
    vector<int> p(n+1,0);
    for(int i=0;i<=n;i++) p[i]=i;
    vector<int> sz(n+1,1);
    function<int(int)> find_set=[&](int a)->int
    {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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