# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
936126 | Baizho | Bitaro’s Party (JOI18_bitaro) | C++14 | 76 ms | 19676 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e5)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
//const long double eps = 1e-15L;
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
int n, m, q, dis[N];
vector<int> g[N], gr[N];
vector<int> del;
void calc(int r) {
int p = 0;
for(int i = 1; i <= r; i ++) {
dis[i] = 0;
for(auto to : gr[i]) {
dis[i] = max(dis[to] + 1, dis[i]);
}
if(p < del.size() && i == del[p]) {
if(dis[i] == 0) dis[i] = -1;
p ++;
}
}
}
void Baizho() {
cin>>n>>m>>q;
int block = 316;
for(int i = 1; i <= m; i ++) {
int u, v; cin>>u>>v;
// always u < v so like people can go to party where town_people <= town_party
g[u].pb(v);
// reverse need so we can have ideas of reverse like max distance from party to people where town_party >= town_people
gr[v].pb(u);
}
for(int i = 1; i <= q; i ++) {
int t, y; cin>>t>>y;
for(int j = 0; j < y; j ++) {
int c; cin>>c;
del.pb(c);
}
if(y >= block || q == 1) {
calc(t);
cout<<dis[t]<<"\n";
return;
}
}
}
signed main() {
// Freopen("nondec");
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
// precalc();
int ttt = 1;
// cin>>ttt;
for(int i=1; i<=ttt; i++) {Baizho(); }
}
컴파일 시 표준 에러 (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... |