# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
966292 | 2024-04-19T16:22:55 Z | anango | Roller Coaster Railroad (IOI16_railroad) | C++17 | 97 ms | 6724 KB |
#include "railroad.h" #include <bits/stdc++.h> using namespace std; #define int long long int plan_roller_coaster(std::vector<int32_t> s, std::vector<int32_t> t) { int n = (int) s.size(); int INF=10000000000000007; vector<int> S1; vector<int> S2; for (int i=0; i<n; i++) { S1.push_back(s[i]); S2.push_back(t[i]); } sort(S1.begin(), S1.end()); sort(S2.begin(), S2.end()); int fail=0; for (int i=0; i<n; i++) { int ind=(upper_bound(S2.begin(), S2.end(),(S1[i]))-S2.begin()); int i1=(upper_bound(S1.begin(), S1.end(), (S1[i]))-S1.begin()); if (ind>i1+1) { fail=1; } } for (int i=0; i<n; i++) { int ind=(upper_bound(S2.begin(), S2.end(),(S1[i]-1))-S2.begin()); int i1=(upper_bound(S1.begin(), S1.end(), (S1[i]-1))-S1.begin()); if (ind>i1+1) { fail=1; } } return fail; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | answer is not correct: 1 instead of 0 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | answer is not correct: 1 instead of 0 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 97 ms | 6724 KB | answer is not correct: 1 instead of 0 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | answer is not correct: 1 instead of 0 |
2 | Halted | 0 ms | 0 KB | - |