Submission #572943

#TimeUsernameProblemLanguageResultExecution timeMemory
5729432fat2codeRoller Coaster Railroad (IOI16_railroad)C++17
0 / 100
311 ms26076 KiB
#include "railroad.h" #include <bits/stdc++.h> #define fr first #pragma GCC optimize("O3") #pragma GCC optimize("Ofast") #define sc second #define all(s) s.begin(), s.end() #define rc(s) return cout << s, 0 using namespace std; map<int,int>mp; long long plan_roller_coaster(vector<int> s, vector<int> t) { s.push_back(2 * 1e9); t.push_back(1); int n = (int) s.size(); for(int i=0;i<n;i++){ mp[s[i]]++; mp[t[i]]--; } int curr = 0; auto it = mp.begin(); while(it != mp.end()){ curr+=(it->sc); ++it; if(curr > 0){ return 1; } } return 0; } // 1. Solve the problem // 2. ??? // 3. Profit
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...