# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1157040 | irmuun | Two Transportations (JOI19_transportations) | C++20 | 104 ms | 960 KiB |
#include "Azer.h"
#include <vector>
#include <bits/stdc++.h>
namespace {
int N;
int variable_example[500000];
int cnt;
} // namespace
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define pii pair<int,int>
const int maxq=58000,maxn=2000,inf=1e9;
int cur=0,tot=0,pos=0,S=-1;
bool in[maxq];
int dist[maxn];
vector<pii>adj[maxn];
void calc(){
fill(dist,dist+maxn,inf);
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |