# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
889632 | vjudge1 | Tourism (JOI23_tourism) | C++17 | 5090 ms | 44612 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;
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int mod = 998244353;
const int N = 1e5;
pair<int, int> chmax(pair<int, int> A, pair<int, int> B){
if(A.ff > B.ff) return A;
return B;
}
pair<int, int> chmin(pair<int, int> A, pair<int, int> B){
if(A.ff > B.ff) return B;
return A;
}
struct sparse{
vector<vector<pair<int, int> > > m_table;
vector<vector<pair<int, int> > > ma_table;
int n;
sparse(int sz){
n = sz;
m_table.resize(18);
ma_table.resize(18);
for(auto &i : m_table){
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |