이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
using I=int;
const I N=100000;
const I MIN=-1e9;
vector<I>adjs[N];
map<I,I>pres[N];
vector<pair<I,I>>tops[N];
vector<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));
for(I i=0;i<n;i++){
tops[i].push_back({0,i});
for(auto[j,dis]:pres[i])tops[i].push_back({dis,j});
sort(tops[i].begin(),tops[i].end());
while(tops[i].size()>siz)tops[i].pop_back();
for(auto j:adjs[i])for(auto[dis,k]:tops[i])pres[j][k]=min(pres[j][k],dis-1);
pres[i].clear();
}
while(q--){
I t,y;cin>>t>>y,t--;
curs.clear();
for(I i=0;i<y;i++){I c;cin>>c,curs.push_back(c-1);}
sort(curs.begin(),curs.end());
I res=MIN;
for(auto[dis,i]:tops[t])if(!binary_search(curs.begin(),curs.end(),i)){res=-dis;break;}
if(res!=MIN){printf("%i\n",res);continue;}
if(curs.size()<=siz){printf("-1\n");continue;}
fill_n(dp,t+1,0);
for(auto c:curs)dp[c]=MIN;
for(I i=0;i<t;i++)if(dp[i]!=MIN)for(auto j:adjs[i])if(j<=t)dp[j]=max(dp[j],dp[i]+1);
printf("%i\n",dp[t]==MIN?-1:dp[t]);
}
}
컴파일 시 표준 에러 (stderr) 메시지
bitaro.cpp: In function 'I main()':
bitaro.cpp:23:25: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'I' {aka 'int'} [-Wsign-compare]
23 | while(tops[i].size()>siz)tops[i].pop_back();
| ~~~~~~~~~~~~~~^~~~
bitaro.cpp:35:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'I' {aka 'int'} [-Wsign-compare]
35 | if(curs.size()<=siz){printf("-1\n");continue;}
| ~~~~~~~~~~~^~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |