# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1130228 | fzyzzz_z | Tower (JOI24_tower) | C++20 | 269 ms | 20400 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll A = 1'000'000'000'000LL;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
ll d, ca, cb;
cin >> d >> ca >> cb;
vector<ll> v(2 * n + 2);
v[0] = 0;
v[2 * n + 1] = A;
for (int i = 1; i <= 2 * n; ++i) {
cin >> v[i];
if (i % 2) v[i]--;
else v[i]++;
}
vector<pair<ll, ll>> segs;
for (int i = 0; i <= n; ++i) {
segs.emplace_back(v[2 * i], v[2 * i + 1]);
}
set<pair<ll, ll>> st;
st.insert(segs[0]);
for (int i = 1; i <= n; ++i) {
# | 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... |