| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 674965 | Denkata | Bitaro’s Party (JOI18_bitaro) | C++14 | Compilation error | 0 ms | 0 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 endl '\n'using namespace std;vector <int> v[100006];int i,j,p,q,n,m,k,y,t;int Q;vector <pair <int,int>> best[100006];const int crit = 1;int used[100006];int dp[100006];int covered[100006];int dfs(int u){ if(covered[u]==Q+1) return dp[u]; covered[u]=Q+1; dp[u]=-1; if(used[u]!=Q+1)dp[u]=0; for(auto j:v[u]) { int val = dfs(j); if(val!=-1) dp[u]=max(dp[u],1+val); } return dp[u];}int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin>>n>>m>>Q; for(i=1; i<=m; i++) { cin>>p>>q; v[q].push_back(p); } for(i=1; i<=n; i++) { for(auto j:v[i]) { best[i].push_back({-1,j}); for(auto k:best[j]) best[i].push_back({k.first-1,k.second}); } sort(best[i].begin(),best[i].end()); while(best[i].size()>crit) best[i].pop_back(); } while(Q--) { int party; cin>>party; cin>>y; for(i=1; i<=y; i++) { cin>>t; used[t]=Q+1; } bool fl=0; for(i=0; i<best[party].size(); i++) { if(used[best[party][i].second]!=Q+1) { cout<<abs(best[party][i].first)<<endl; fl=1; break; } } if(fl)continue; if(y<crit) { if(used[party]==Q+1) cout<<-1<<endl; else cout<<0<<endl; continue; } cout<<dfs(party)<<endl; } return 0;}
Compilation message (stderr)
bitaro.cpp:1:24: warning: extra tokens at end of #include directive
1 | #include<bits/stdc++.h>#define endl '\n'using namespace std;vector <int> v[100006];int i,j,p,q,n,m,k,y,t;int Q;vector <pair <int,int>> best[100006];const int crit = 1;int used[100006];int dp[100006];int covered[100006];int dfs(int u){ if(covered[u]==Q+1) return dp[u]; covered[u]=Q+1; dp[u]=-1; if(used[u]!=Q+1)dp[u]=0; for(auto j:v[u]) { int val = dfs(j); if(val!=-1) dp[u]=max(dp[u],1+val); } return dp[u];}int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin>>n>>m>>Q; for(i=1; i<=m; i++) { cin>>p>>q; v[q].push_back(p); } for(i=1; i<=n; i++) { for(auto j:v[i]) { best[i].push_back({-1,j}); for(auto k:best[j]) best[i].push_back({k.first-1,k.second}); } sort(best[i].begin(),best[i].end()); while(best[i].size()>crit) best[i].pop_back(); } while(Q--) { int party; cin>>party; cin>>y; for(i=1; i<=y; i++) { cin>>t; used[t]=Q+1; } bool fl=0; for(i=0; i<best[party].size(); i++) { if(used[best[party][i].second]!=Q+1) { cout<<abs(best[party][i].first)<<endl; fl=1; break; } } if(fl)continue; if(y<crit) { if(used[party]==Q+1) cout<<-1<<endl; else cout<<0<<endl; continue; } cout<<dfs(party)<<endl; } return 0;}
| ^
bitaro.cpp:1:236: error: extended character is not valid in an identifier
1 | #include<bits/stdc++.h>#define endl '\n'using namespace std;vector <int> v[100006];int i,j,p,q,n,m,k,y,t;int Q;vector <pair <int,int>> best[100006];const int crit = 1;int used[100006];int dp[100006];int covered[100006];int dfs(int u){ if(covered[u]==Q+1) return dp[u]; covered[u]=Q+1; dp[u]=-1; if(used[u]!=Q+1)dp[u]=0; for(auto j:v[u]) { int val = dfs(j); if(val!=-1) dp[u]=max(dp[u],1+val); } return dp[u];}int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin>>n>>m>>Q; for(i=1; i<=m; i++) { cin>>p>>q; v[q].push_back(p); } for(i=1; i<=n; i++) { for(auto j:v[i]) { best[i].push_back({-1,j}); for(auto k:best[j]) best[i].push_back({k.first-1,k.second}); } sort(best[i].begin(),best[i].end()); while(best[i].size()>crit) best[i].pop_back(); } while(Q--) { int party; cin>>party; cin>>y; for(i=1; i<=y; i++) { cin>>t; used[t]=Q+1; } bool fl=0; for(i=0; i<best[party].size(); i++) { if(used[best[party][i].second]!=Q+1) { cout<<abs(best[party][i].first)<<endl; fl=1; break; } } if(fl)continue; if(y<crit) { if(used[party]==Q+1) cout<<-1<<endl; else cout<<0<<endl; continue; } cout<<dfs(party)<<endl; } return 0;}
| ^
bitaro.cpp:1:260: error: extended character is not valid in an identifier
1 | #include<bits/stdc++.h>#define endl '\n'using namespace std;vector <int> v[100006];int i,j,p,q,n,m,k,y,t;int Q;vector <pair <int,int>> best[100006];const int crit = 1;int used[100006];int dp[100006];int covered[100006];int dfs(int u){ if(covered[u]==Q+1) return dp[u]; covered[u]=Q+1; dp[u]=-1; if(used[u]!=Q+1)dp[u]=0; for(auto j:v[u]) { int val = dfs(j); if(val!=-1) dp[u]=max(dp[u],1+val); } return dp[u];}int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin>>n>>m>>Q; for(i=1; i<=m; i++) { cin>>p>>q; v[q].push_back(p); } for(i=1; i<=n; i++) { for(auto j:v[i]) { best[i].push_back({-1,j}); for(auto k:best[j]) best[i].push_back({k.first-1,k.second}); } sort(best[i].begin(),best[i].end()); while(best[i].size()>crit) best[i].pop_back(); } while(Q--) { int party; cin>>party; cin>>y; for(i=1; i<=y; i++) { cin>>t; used[t]=Q+1; } bool fl=0; for(i=0; i<best[party].size(); i++) { if(used[best[party][i].second]!=Q+1) { cout<<abs(best[party][i].first)<<endl; fl=1; break; } } if(fl)continue; if(y<crit) { if(used[party]==Q+1) cout<<-1<<endl; else cout<<0<<endl; continue; } cout<<dfs(party)<<endl; } return 0;}
| ^
bitaro.cpp:1:263: error: extended character is not valid in an identifier
1 | #include<bits/stdc++.h>#define endl '\n'using namespace std;vector <int> v[100006];int i,j,p,q,n,m,k,y,t;int Q;vector <pair <int,int>> best[100006];const int crit = 1;int used[100006];int dp[100006];int covered[100006];int dfs(int u){ if(covered[u]==Q+1) return dp[u]; covered[u]=Q+1; dp[u]=-1; if(used[u]!=Q+1)dp[u]=0; for(auto j:v[u]) { int val = dfs(j); if(val!=-1) dp[u]=max(dp[u],1+val); } return dp[u];}int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin>>n>>m>>Q; for(i=1; i<=m; i++) { cin>>p>>q; v[q].push_back(p); } for(i=1; i<=n; i++) { for(auto j:v[i]) { best[i].push_back({-1,j}); for(auto k:best[j]) best[i].push_back({k.first-1,k.second}); } sort(best[i].begin(),best[i].end()); while(best[i].size()>crit) best[i].pop_back(); } while(Q--) { int party; cin>>party; cin>>y; for(i=1; i<=y; i++) { cin>>t; used[t]=Q+1; } bool fl=0; for(i=0; i<best[party].size(); i++) { if(used[best[party][i].second]!=Q+1) { cout<<abs(best[party][i].first)<<endl; fl=1; break; } } if(fl)continue; if(y<crit) { if(used[party]==Q+1) cout<<-1<<endl; else cout<<0<<endl; continue; } cout<<dfs(party)<<endl; } return 0;}
| ^
bitaro.cpp:1:266: error: extended character is not valid in an identifier
1 | #include<bits/stdc++.h>#define endl '\n'using namespace std;vector <int> v[100006];int i,j,p,q,n,m,k,y,t;int Q;vector <pair <int,int>> best[100006];const int crit = 1;int used[100006];int dp[100006];int covered[100006];int dfs(int u){ if(covered[u]==Q+1) return dp[u]; covered[u]=Q+1; dp[u]=-1; if(used[u]!=Q+1)dp[u]=0; for(auto j:v[u]) { int val = dfs(j); if(val!=-1) dp[u]=max(dp[u],1+val); } return dp[u];}int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin>>n>>m>>Q; for(i=1; i<=m; i++) { cin>>p>>q; v[q].push_back(p); } for(i=1; i<=n; i++) { for(auto j:v[i]) { best[i].push_back({-1,j}); for(auto k:best[j]) best[i].push_back({k.first-1,k.second}); } sort(best[i].begin(),best[i].end()); while(best[i].size()>crit) best[i].pop_back(); } while(Q--) { int party; cin>>party; cin>>y; for(i=1; i<=y; i++) { cin>>t; used[t]=Q+1; } bool fl=0; for(i=0; i<best[party].size(); i++) { if(used[best[party][i].second]!=Q+1) { cout<<abs(best[party][i].first)<<endl; fl=1; break; } } if(fl)continue; if(y<crit) { if(used[party]==Q+1) cout<<-1<<endl; else cout<<0<<endl; continue; } cout<<dfs(party)<<endl; } return 0;}
| ^
bitaro.cpp:1:284: error: extended character is not valid in an identifier
1 | #include<bits/stdc++.h>#define endl '\n'using namespace std;vector <int> v[100006];int i,j,p,q,n,m,k,y,t;int Q;vector <pair <int,int>> best[100006];const int crit = 1;int used[100006];int dp[100006];int covered[100006];int dfs(int u){ if(covered[u]==Q+1) return dp[u]; covered[u]=Q+1; dp[u]=-1; if(used[u]!=Q+1)dp[u]=0; for(auto j:v[u]) { int val = dfs(j); if(val!=-1) dp[u]=max(dp[u],1+val); } return dp[u];}int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin>>n>>m>>Q; for(i=1; i<=m; i++) { cin>>p>>q; v[q].push_back(p); } for(i=1; i<=n; i++) { for(auto j:v[i]) { best[i].push_back({-1,j}); for(auto k:best[j]) best[i].push_back({k.first-1,k.second}); } sort(best[i].begin(),best[i].end()); while(best[i].size()>crit) best[i].pop_back(); } while(Q--) { int party; cin>>party; cin>>y; for(i=1; i<=y; i++) { cin>>t; used[t]=Q+1; } bool fl=0; for(i=0; i<best[party].size(); i++) { if(used[best[party][i].second]!=Q+1) { cout<<abs(best[party][i].first)<<endl; fl=1; break; } } if(fl)continue; if(y<crit) { if(used[party]==Q+1) cout<<-1<<endl; else cout<<0<<endl; continue; } cout<<dfs(party)<<endl; } return 0;}
| ^
bitaro.cpp:1:304: error: extended character is not valid in an identifier
1 | #include<bits/stdc++.h>#define endl '\n'using namespace std;vector <int> v[100006];int i,j,p,q,n,m,k,y,t;int Q;vector <pair <int,int>> best[100006];const int crit = 1;int used[100006];int dp[100006];int covered[100006];int dfs(int u){ if(covered[u]==Q+1) return dp[u]; covered[u]=Q+1; dp[u]=-1; if(used[u]!=Q+1)dp[u]=0; for(auto j:v[u]) { int val = dfs(j); if(val!=-1) dp[u]=max(dp[u],1+val); } return dp[u];}int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin>>n>>m>>Q; for(i=1; i<=m; i++) { cin>>p>>q; v[q].push_back(p); } for(i=1; i<=n; i++) { for(auto j:v[i]) { best[i].push_back({-1,j}); for(auto k:best[j]) best[i].push_back({k.first-1,k.second}); } sort(best[i].begin(),best[i].end()); while(best[i].size()>crit) best[i].pop_back(); } while(Q--) { int party; cin>>party; cin>>y; for(i=1; i<=y; i++) { cin>>t; used[t]=Q+1; } bool fl=0; for(i=0; i<best[party].size(); i++) { if(used[best[party][i].second]!=Q+1) { cout<<abs(best[party][i].first)<<endl; fl=1; break; } } if(fl)continue; if(y<crit) { if(used[party]==Q+1) cout<<-1<<endl; else cout<<0<<endl; continue; } cout<<dfs(party)<<endl; } return 0;}
| ^
bitaro.cpp:1:318: error: extended character is not valid in an identifier
1 | #include<bits/stdc++.h>#define endl '\n'using namespace std;vector <int> v[100006];int i,j,p,q,n,m,k,y,t;int Q;vector <pair <int,int>> best[100006];const int crit = 1;int used[100006];int dp[100006];int covered[100006];int dfs(int u){ if(covered[u]==Q+1) return dp[u]; covered[u]=Q+1; dp[u]=-1; if(used[u]!=Q+1)dp[u]=0; for(auto j:v[u]) { int val = dfs(j); if(val!=-1) dp[u]=max(dp[u],1+val); } return dp[u];}int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin>>n>>m>>Q; for(i=1; i<=m; i++) { cin>>p>>q; v[q].push_back(p); } for(i=1; i<=n; i++) { for(auto j:v[i]) { best[i].push_back({-1,j}); for(auto k:best[j]) best[i].push_back({k.first-1,k.second}); } sort(best[i].begin(),best[i].end()); while(best[i].size()>crit) best[i].pop_back(); } while(Q--) { int party; cin>>party; cin>>y; for(i=1; i<=y; i++) { cin>>t; used[t]=Q+1; } bool fl=0; for(i=0; i<best[party].size(); i++) { if(used[best[party][i].second]!=Q+1) { cout<<abs(best[party][i].first)<<endl; fl=1; break; } } if(fl)continue; if(y<crit) { if(used[party]==Q+1) cout<<-1<<endl; else cout<<0<<endl; continue; } cout<<dfs(party)<<endl; } return 0;}
| ^
bitaro.cpp:1:347: error: extended character is not valid in an identifier
1 | #include<bits/stdc++.h>#define endl '\n'using namespace std;vector <int> v[100006];int i,j,p,q,n,m,k,y,t;int Q;vector <pair <int,int>> best[100006];const int crit = 1;int used[100006];int dp[100006];int covered[100006];int dfs(int u){ if(covered[u]==Q+1) return dp[u]; covered[u]=Q+1; dp[u]=-1; if(used[u]!=Q+1)dp[u]=0; for(auto j:v[u]) { int val = dfs(j); if(val!=-1) dp[u]=max(dp[u],1+val); } return dp[u];}int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin>>n>>m>>Q; for(i=1; i<=m; i++) { cin>>p>>q; v[q].push_back(p); } for(i=1; i<=n; i++) { for(auto j:v[i]) { best[i].push_back({-1,j}); for(auto k:best[j]) best[i].push_back({k.first-1,k.second}); } sort(best[i].begin(),best[i].end()); while(best[i].size()>crit) best[i].pop_back(); } while(Q--) { int party; cin>>party; cin>>y; for(i=1; i<=y; i++) { cin>>t; used[t]=Q+1; } bool fl=0; for(i=0; i<best[party].size(); i++) { if(used[best[party][i].second]!=Q+1) { cout<<abs(best[party][i].first)<<endl; fl=1; break; } } if(fl)continue; if(y<crit) { if(used[party]==Q+1) cout<<-1<<endl; else cout<<0<<endl; continue; } cout<<dfs(party)<<endl; } return 0;}
| ^
bitaro.cpp:1:368: error: extended character is not valid in an identifier
1 | #include<bits/stdc++.h>#define endl '\n'using namespace std;vector <int> v[100006];int i,j,p,q,n,m,k,y,t;int Q;vector <pair <int,int>> best[100006];const int crit = 1;int used[100006];int dp[100006];int covered[100006];int dfs(int u){ if(covered[u]==Q+1) return dp[u]; covered[u]=Q+1; dp[u]=-1; if(used[u]!=Q+1)dp[u]=0; for(auto j:v[u]) { int val = dfs(j); if(val!=-1) dp[u]=max(dp[u],1+val); } return dp[u];}int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin>>n>>m>>Q; for(i=1; i<=m; i++) { cin>>p>>q; v[q].push_back(p); } for(i=1; i<=n; i++) { for(auto j:v[i]) { best[i].push_back({-1,j}); for(auto k:best[j]) best[i].push_back({k.first-1,k.second}); } sort(best[i].begin(),best[i].end()); while(best[i].size()>crit) best[i].pop_back(); } while(Q--) { int party; cin>>party; cin>>y; for(i=1; i<=y; i++) { cin>>t; used[t]=Q+1; } bool fl=0; for(i=0; i<best[party].size(); i++) { if(used[best[party][i].second]!=Q+1) { cout<<abs(best[party][i].first)<<endl; fl=1; break; } } if(fl)continue; if(y<crit) { if(used[party]==Q+1) cout<<-1<<endl; else cout<<0<<endl; continue; } cout<<dfs(party)<<endl; } return 0;}
| ^
bitaro.cpp:1:374: error: extended character is not valid in an identifier
1 | #include<bits/stdc++.h>#define endl '\n'using namespace std;vector <int> v[100006];int i,j,p,q,n,m,k,y,t;int Q;vector <pair <int,int>> best[100006];const int cr