# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
985641 | SmuggingSpun | Bitaro’s Party (JOI18_bitaro) | C++14 | 2 ms | 3596 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 taskname "A"
using namespace std;
template<class T>void maximize(T& a, T b){
if(a < b){
a = b;
}
}
int n, m, q;
namespace sub12{
const int lim = 1e5 + 5;
vector<int>e[lim];
int deg[lim], dp[lim];
void solve(){
memset(deg, 0, sizeof(deg));
for(int _ = 0; _ < m; _++){
int u, v;
cin >> u >> v;
e[u].emplace_back(v);
deg[v]++;
}
int t, y;
cin >> t >> y;
bitset<lim>busy;
busy.reset();
for(int _ = 0; _ < y; _++){
int x;
cin >> x;
busy.set(x);
}
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... |