QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#792989 | #7738. Equivalent Rewriting | einekleine18 | Compile Error | / | / | Python3 | 1.6kb | 2024-11-29 15:35:12 | 2024-11-29 15:35:13 |
Judging History
This is the latest submission verdict.
- [2024-11-29 15:35:13]
- Judged
- Verdict: Compile Error
- Time: 0ms
- Memory: 0kb
- [2024-11-29 15:35:12]
- Submitted
answer
#include <algorithm>
#include<bits/stdc++.h>
#include <functional>
#include <queue>
#include <vector>
#define int long long
using namespace std;
#define endl '\n'
using a2=std::array<int,2>;
void solve(){
int n,m;
std::cin>>n>>m;
std::vector<int>last(m,-1);
std::vector<int>dep(n);
for(int i=0;i<n;++i){
int p;
std::cin>>p;
for(int j=0;j<p;++j){
int x;
std::cin>>x;
--x;
if(last[x]!=-1){
dep[i]=std::max(dep[i],dep[last[x]]+1);
}
last[x]=i;
}
}
std::vector ng(n,std::vector<int>());
for(int i=0;i<n;++i){
ng[dep[i]].push_back(i);
}
std::vector<int>ans;
int f=0;
for(int i=0;i<n;++i){
if((int)ng[i].size()>1){
f=1;
std::sort(ng[i].begin(),ng[i].end(),std::greater<int>());
}
for(auto &x:ng[i]){
ans.push_back(x);
}
}
if(f){
std::cout<<"Yes\n";
int cnt=0;
assert(ans.size()==n);
for(auto &x:ans){
std::cout<<x+1;
++cnt;
if(cnt<n) std::cout<<' ';
}
std::cout<<'\n';
}else{
std::cout<<"No\n";
}
}
signed main(){
#ifdef LOCAL
std::freopen("in.txt","r",stdin);
std::freopen("out.txt","w",stdout);
#endif
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
int _=1;
std::cin>>_;
for(int i=0;i<_;++i){
solve();
}
}
Details
File "answer.code", line 8 using namespace std; ^^^^^^^^^ SyntaxError: invalid syntax