# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
56694 | khsoo01 | Bitaro’s Party (JOI18_bitaro) | C++11 | 1820 ms | 211152 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>
#define X first
#define Y second
using namespace std;
typedef pair<int,int> pii;
const int N = 100005, X = 255, inf = 1e9;
int n, m, q, o, k, b[N], opt[N];
bool vis[N];
vector<int> adj[N], usd;
vector<pii> dt[N];
void upd (vector<pii> &V, const pii &T) {
V.push_back(T);
vis[T.Y] = true;
usd.push_back(T.Y);
}
int main()
{
scanf("%d%d%d",&n,&m,&q);
for(int i=1;i<=m;i++) {
int A, B;
scanf("%d%d",&A,&B);
adj[B].push_back(A);
}
for(int i=1;i<=n;i++) {
for(auto &T : adj[i]) {
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... |