Submission #1146754

#TimeUsernameProblemLanguageResultExecution timeMemory
1146754woodRoller Coaster Railroad (IOI16_railroad)C++17
0 / 100
2124 ms333952 KiB
#include "railroad.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> p32; typedef pair<ll,ll> p64; #define pb push_back #define eb emplace_back #define fi first #define se second #define vi vector<int> #define vp32 vector<p32> #define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) #define MOD %1000000007 #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; //never guess //never debug without reviewing code //never try adding ones or subtracting them //only step by step debug when necessary long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) { vp32 arr; for(int i = 0; i<s.size(); i++) arr.eb(s[i],t[i]); sort(arr.begin(),arr.end()); int result = INT_MAX; do{ int res = 0; for(int i = 1; i<arr.size(); i++){ cout<<arr[i+1].fi<<' '<<arr[i].se<<'\n'; res+=max(0,arr[i].se-arr[i+1].fi); } result = min(result,res); }while(next_permutation(arr.begin(),arr.end())); return result; }

Compilation message (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
      |         ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...