Submission #65962

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
65962	2018-08-09 07:44:05	gs13068	Roller Coaster Railroad (IOI16_railroad)	C++17	100 / 100	319 ms	158168 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 "railroad.h"
#include <algorithm>
 
using namespace std;
 
int x[400004], xn;
int a[400004];
int p[400004];
pair<int, pair<int, int> > d[400004];
int dn;
 
int f(int x) {
    return x == p[x] ? x : p[x] = f(p[x]);
}
 
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    long long r = 0;
    int n = (int) s.size();
    int i;
    for (i = 0; i < n; i++) {
        x[xn++] = s[i];
        x[xn++] = t[i];
    }
    sort(x, x + xn);
    xn = unique(x, x + xn) - x;
    for (i = 0; i <= xn; i++) p[i] = i;
    for (i = 0; i < n; i++) {
        s[i] = lower_bound(x, x + xn, s[i]) - x;
        t[i] = lower_bound(x, x + xn, t[i]) - x;
        a[s[i]]++, a[t[i]]--;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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