# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
693181 | four_specks | Bitaro’s Party (JOI18_bitaro) | C++17 | 10 ms | 4316 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;
namespace
{
} // namespace
void solve()
{
const int SQ = 400;
int n, m, q;
cin >> n >> m >> q;
vector<vector<int>> adj(n), adj_rev(n);
for (int i = 0; i < m; i++)
{
int u, v;
cin >> u >> v, --u, --v;
adj[v].push_back(u);
}
vector<vector<pair<int, int>>> take(n);
for (int i = 0; i < n; i++)
{
take[i].emplace_back(0, i);
for (int j : adj[i])
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |