# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
966254 | A7med_Mousa | Bitaro’s Party (JOI18_bitaro) | C++14 | 2 ms | 604 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 <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <array>
#include <cassert>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
vector<int>val;
bool comp(int &a, int &b){
return val[a] > val[b];
}
void solve(){
int n, m, q; cin >> n >> m >> q;
vector<int>adj[n];
for (int i = 0 ; i < m; ++i){
int u, v; cin >> u >> v;
--u, --v;
adj[v].emplace_back(u);
}
vector<int>vis(n);
val.resize(n);
int sq = sqrt(n);
vector<vector<pair<int ,int>>>dp(n);
for (int node = 0; node < n; ++node){
vector<int>cur;
cur.emplace_back(node);
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... |