# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1169592 | jadai007 | Exhibition (JOI19_ho_t2) | C++20 | 51 ms | 2748 KiB |
/*
Author : detective conan
Problem : Exhibition
Created : 09:08 UTC+7
*/
#include <bits/stdc++.h>
#define int long long
#define FOR(i, s, t) for(int i = s; i <= t; ++i)
#define rep(i, s, t) for(int i = s; i >= t; --i)
#define HAVE_TESTCASE false
#define conan cin.tie(nullptr)->sync_with_stdio(false)
#define mod (int)(1e9 + 7)
#define vec vector
#define pii pair<int, int>
#define ari(n) array<int, n>
#define pb push_back
#define eb emplace_back
#define ph push
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ANS(n, s) cout << n << s
using namespace std;
using u32 = unsigned;
using i64 = int64_t;
using u64 = unsigned i64;
const int MAX_N = 1e5 + 10, MAX_M = 1e5 + 10;
int s, v, c[MAX_M], n, m, ans;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |