# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
707406 | EthanKim8683 | Bitaro’s Party (JOI18_bitaro) | C++17 | 2052 ms | 346500 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 I=int;
const I N=100000;
const I MIN=-1e9;
vector<I>adjs[N];
set<I>viss;
vector<pair<I,I>>pres[N];
vector<pair<I,I>>tops[N];
set<I>curs;
I dp[N];
I main(){
cin.tie(0)->sync_with_stdio(0);
I n,m,q;cin>>n>>m>>q;
for(I i=0;i<m;i++){
I s,e;cin>>s>>e,s--,e--;
adjs[s].push_back(e);
}
I siz=sqrt(n/log2(n))*2;
for(I i=0;i<n;i++){
pres[i].push_back({0,i});
sort(pres[i].begin(),pres[i].end());
viss.clear();
for(I j=0;tops[i].size()<siz&&j<pres[i].size();j++){
auto[dis,k]=pres[i][j];
if(viss.count(k))continue;
viss.insert(k),tops[i].push_back({dis,k});
}
pres[i].clear();
for(auto j:adjs[i])for(auto[dis,k]:tops[i])pres[j].push_back({dis-1,k});
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... |