# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
984087 | Amaarsaa | Bitaro’s Party (JOI18_bitaro) | C++14 | 2043 ms | 417212 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 pii = pair < int, int >;
int used[100001], cant[100001], c[100001], dp[100001];
vector < int > adj[100001], radj[100001];
vector < pii > good[100001];
int main() {
// freopen("moocast.in", "r", stdin);
// freopen("moocast.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, q, i, ans, x, y, I, I1, i1, t;
cin >> n >> m >> q;
for (i = 0; i < m; i ++) {
cin >> x >> y;
adj[x].push_back(y);
radj[y].push_back(x);
}
for (i = 1; i <= n; i ++) {
vector < pii > v;
for ( int I : radj[i]) {
i1 = I1 = 0;
good[I].push_back({0, I});
while ( v.size() < 350 && (i1 < good[i].size() || I1 < good[I].size())) {
if (i1 == good[i].size() || (I1 != good[I].size() && good[I][I1].first + 1 >= good[i][i1].first )) {
good[I][I1].first ++;
v.push_back(good[I][I1]);
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... |