# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
617615 | 2022-08-01T12:27:19 Z | Sergio_2357 | 장난감 기차 (IOI17_train) | C++17 | 9 ms | 1144 KB |
#include "train.h" #include <bits/stdc++.h> using namespace std; #define int long long typedef vector<int> vi; vector<signed> who_wins(vector<signed> a, vector<signed> r, vector<signed> u, vector<signed> v) { vector<signed> res(a.size()); vi ws, ls; set<int> brk; for (int i = 0; i < a.size(); i++) brk.insert(i); for (int i = 0; i < u.size(); i++) { if (u[i] == v[i]) { if (r[u[i]] && a[u[i]]) ws.push_back(u[i]); if (!r[u[i]] && !a[u[i]]) ls.push_back(u[i]); } else { brk.erase(u[i]); } } sort(ws.begin(), ws.end()); sort(ls.begin(), ls.end()); for (int i = 0; i < a.size(); i++) { auto wit = lower_bound(ws.begin(), ws.end(), i); auto lit = lower_bound(ls.begin(), ls.end(), i); auto l2it = brk.lower_bound(i); int nw = (wit != ws.end() ? *wit : INT_MAX); int nl = (lit != ls.end() ? *lit : INT_MAX); int nl2 = (l2it != brk.end() ? *l2it : INT_MAX); if (nw < nl && nw < nl2) res[i] = 1; } return res; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 696 KB | Output is correct |
2 | Incorrect | 5 ms | 724 KB | 3rd lines differ - on the 2541st token, expected: '1', found: '0' |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | 3rd lines differ - on the 2nd token, expected: '1', found: '0' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 1108 KB | Output is correct |
2 | Correct | 7 ms | 1144 KB | Output is correct |
3 | Correct | 7 ms | 1116 KB | Output is correct |
4 | Incorrect | 8 ms | 1068 KB | 3rd lines differ - on the 1st token, expected: '1', found: '0' |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 7 ms | 944 KB | 3rd lines differ - on the 1st token, expected: '1', found: '0' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 9 ms | 1104 KB | 3rd lines differ - on the 1st token, expected: '1', found: '0' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 696 KB | Output is correct |
2 | Incorrect | 5 ms | 724 KB | 3rd lines differ - on the 2541st token, expected: '1', found: '0' |
3 | Halted | 0 ms | 0 KB | - |