# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
995259 | gmroh06 | Collecting Stamps 3 (JOI20_ho_t3) | C++14 | 63 ms | 129624 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;
using ll = long long;
inline void fastio() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
}
const ll INF = 0x3f3f3f3f3f3f3f3f;
ll n, l, ans;
ll arr[202], t[202];
ll cdp[202][202][202], rdp[202][202][202]; // 시계, 반시계, 개수
int main() {
fastio();
cin >> n >> l;
for (ll i = 1; i <= n; i++) {
cin >> arr[i];
}
arr[n + 1] = l;
for (ll i = 1; i <= n; i++) {
cin >> t[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... |