# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1081856 | Thunnus | Bitaro’s Party (JOI18_bitaro) | C++17 | 609 ms | 286408 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 i64 = long long;
#define int i64
#define vi vector<int>
#define vvi vector<vi>
#define vb vector<bool>
#define pii pair<int, int>
#define fi first
#define se second
#define sz(x) (int)(x).size()
signed main(){
ios_base::sync_with_stdio(false); cin.tie(0);
const int SZ = 100;
int n, m, q, a, b;
cin >> n >> m >> q;
vvi adj(n), radj(n);
for(int i = 0; i < m; i++){
cin >> a >> b;
adj[--a].emplace_back(--b);
radj[b].emplace_back(a);
}
vector<vector<pii>> bestSZ(n);
vi starting(n, -1);
for(int v = 0; v < n; v++){ // Duplicates are the issue
vi from;
bestSZ[v].emplace_back(0, v);
for(int &u : radj[v]){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |