# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1160593 | Cyanmond | COVID tests (CEOI24_covid) | C++20 | 871 ms | 408 KiB |
#include <bits/stdc++.h>
#define AOTSUKI
using namespace std;
constexpr bool isMultiCase = 1;
// #include "angel/math/modint.hpp"
using ll = long long;
template <class T> constexpr int len(const T &c) {
return int(std::ssize(c));
}
template <class T> using V = vector<T>;
template <class T> using RevPq = priority_queue<T, vector<T>, greater<T>>;
constexpr char eoln = '\n';
#define L(i, l, r) for (int i = (l); i < (r); ++i)
#define R(i, l, r) for (int i = (r) - 1; i >= (l); --i)
#define ALL(x) (x).begin(), (x).end()
#define fi first
#define se second
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
/// You may use:
// The number of students
int N;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |