Submission #1031015

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1031015	2024-07-22 13:30:47	Warinchai	Roller Coaster Railroad (IOI16_railroad)	C++14	0 / 100	361 ms	28604 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<bits/stdc++.h>
using namespace std;
int p[2000005];
int fp(int a){
    return p[a]==a?a:p[a]=fp(p[a]);
}
void un(int a,int b){
    p[fp(a)]=fp(b);
}
vector<int>ids;
map<int,int>mp;
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = (int) s.size();
    vector<pair<int,int>>v;
    for(int i=0;i<n;i++){
        v.push_back({s[i],1});
        v.push_back({t[i],-1});
        if(!mp[s[i]])ids.push_back(s[i]),mp[s[i]]++;
        if(!mp[t[i]])ids.push_back(t[i]),mp[t[i]]++;
    }
    sort(ids.begin(),ids.end());
    sort(v.begin(),v.end());
    for(int i=1;i<=mp.size();i++)p[i]=i;
    for(int i=0;i<n;i++){
        un(lower_bound(ids.begin(),ids.end(),s[i])-ids.begin()+1,lower_bound(ids.begin(),ids.end(),t[i])-ids.begin()+1);
    }
    int val=0;
    for(int i=0;i<v.size();){
        int sp=v[i].first;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

railroad.cpp: In function 'long long int plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:24:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::map<int, int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for(int i=1;i<=mp.size();i++)p[i]=i;
      |                 ~^~~~~~~~~~~
railroad.cpp:29:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for(int i=0;i<v.size();){
      |                 ~^~~~~~~~~
railroad.cpp:31:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |         while(i<v.size()&&v[i].first==sp){
      |               ~^~~~~~~~~
railroad.cpp:36:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |         else if(val==0&&i!=v.size()-1)un(lower_bound(ids.begin(),ids.end(),v[i-1].first)-ids.begin()+1,lower_bound(ids.begin(),ids.end(),v[i].first)-ids.begin()+1);
      |                         ~^~~~~~~~~~~~
railroad.cpp:38:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::map<int, int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for(int i=1;i<=mp.size();i++){
      |                 ~^~~~~~~~~~~

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