# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
83099 | chunghan | 막대기 (KOI13_game) | C++17 | 107 ms | 19324 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long int lld;
typedef pair<int, int> pii;
int N, l;
vector<pii> S;
vector<int> U, L;
lld D[100005], E[100005];
inline int getx(int x) {
return lower_bound(U.begin(), U.end(), x) - U.begin();
}
inline int gety(int y) {
return lower_bound(L.begin(), L.end(), y) - L.begin();
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
cin >> N >> l;
for(int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
S.push_back(pii(x, y));
U.push_back(x);
L.push_back(y);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |