제출 #1212061

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1212061		mychecksedad	Roller Coaster Railroad (IOI16_railroad)	C++20	30 / 100	277 ms	38000 KiB

railroad

#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
  int n = s.size();
  vector<array<ll, 3>> A, B;
  multiset<pair<ll, int>> T, T2;
  for(int i = 1; i <= n; ++i){
    A.pb({s[i-1], t[i-1], i-1});
    B.pb({t[i-1], s[i-1], i-1});
    T.insert({s[i-1], i-1});
    T2.insert({t[i-1], i-1});
  }
  T.insert({MOD, n+1});
  T2.insert({-MOD, n+1});
  sort(all(A));
  sort(all(B));

  ll ans = 0;
  for(int i = n-1; i >= 0; --i){
    int pos = B[i][2];
    auto it = T.lower_bound(pair<ll,int>{B[i][0], -1});
    if(it == T.end()){
      ans += B[i][0];
    }else{
      if((*it).ss == pos){
        if(next(it) != T.end()){
          ++it;
          T.erase(it);
        }else{
          ans += B[i][0];
        }
      }else{
        T.erase(it);  
      }
    }
  }
  // cerr << ans << '\n';
  for(int i = 0; i < n; ++i){
    int pos = A[i][2];
    auto it = T2.upper_bound(pair<ll,int>{A[i][0], MOD});
    if(it == T2.begin()){
      ans -= A[i][0];
    }else{
      --it;
      if((*it).ss == pos){
        if(it != T2.begin()){
          --it;
          T2.erase(it);
        }else{
          ans -= A[i][0];
        }
      }else{
        T2.erase(it);  
      }
    }
  }

  return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

railroad.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
railroad_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

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