QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#187582 | #6634. Central Subset | qzzyq | WA | 7ms | 8312kb | C++14 | 1.7kb | 2023-09-24 18:23:32 | 2023-09-24 18:23:33 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define maxn 200005
#define put() putchar('\n')
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
using namespace std;
void read(int &x){
int f=1;x=0;char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
while (c>='0'&&c<='9') {x=x*10+c-'0';c=getchar();}
x*=f;
}
namespace Debug{
Tp void _debug(char* f,Ty t){cerr<<f<<'='<<t<<endl;}
Ts void _debug(char* f,Ty x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
Tp ostream& operator<<(ostream& os,vector<Ty>& V){os<<"[";for(auto& vv:V) os<<vv<<",";os<<"]";return os;}
#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
#define fi first
#define se second
#define mk make_pair
const int mod=1e9+7;
int power(int x,int y=mod-2) {
int sum=1;
while (y) {
if (y&1) sum=sum*x%mod;
x=x*x%mod;y>>=1;
}
return sum;
}
int n,m;
vector<int>to[maxn];
int vis[maxn],ans[maxn],cnt,block,total;
void dfs(int x,int deep) {
if (deep==0) ans[++cnt]=x,deep=block;
vis[x]=1;
for (auto y:to[x]) if (!vis[y]) {
dfs(y,deep-1);
}
}
const int N=100;
void solve(void) {
int i,x,y;
read(n);read(m);
block=sqrt(n);block+=(block*block!=n);
for (i=1;i<=n;i++) to[i].clear(),vis[i]=0;cnt=0;
if (total==N) printf("%d %d\n",n,m);
for (i=1;i<=m;i++) {
if (total==N) printf("%d %d ",x,y);
read(x),read(y);
to[x].push_back(y);
to[y].push_back(x);
}
if (total==N) return ;
dfs(1,block);
if (cnt==0) ans[cnt=1]=1;
printf("%d\n",cnt);
for (i=1;i<=cnt;i++) printf("%d ",ans[i]);put();
}
signed main(void){
++total;
int T;read(T);while (T--) solve(),++total;
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 8312kb
input:
2 4 3 1 2 2 3 3 4 6 7 1 2 2 3 3 1 1 4 4 5 5 6 6 4
output:
1 3 1 6
result:
ok correct (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 7ms
memory: 8304kb
input:
10000 15 14 13 12 5 4 9 8 11 12 15 14 10 9 14 13 2 3 2 1 6 5 10 11 3 4 7 6 8 7 6 5 2 1 2 4 4 6 2 3 3 5 10 9 8 3 9 4 5 6 5 10 3 2 5 4 2 7 1 2 4 3 2 1 2 1 2 1 2 1 9 8 9 8 5 4 1 2 6 5 3 4 3 2 7 8 7 6 2 1 1 2 14 13 3 10 5 6 2 9 11 4 2 3 2 1 8 7 13 6 5 4 5 12 6 7 4 3 7 14 16 15 2 3 2 1 6 10 6 9 6 4 9 11 ...
output:
3 5 9 13 2 6 5 2 9 5 1 1 1 1 2 4 7 1 1 2 11 5 3 6 15 5 1 1 3 6 11 16 2 4 5 2 5 9 2 10 9 1 1 3 5 9 13 3 7 5 6 1 1 4 5 7 6 8 1 1 1 3 2 4 7 2 11 5 2 12 11 1 1 3 5 9 13 2 4 6 4 12 5 16 9 1 3 1 1 4 6 11 16 21 4 12 10 6 7 2 5 11 4 9 8 7 16 1 1 1 4 2 4 5 2 10 5 5 7 21 ...
result:
wrong answer Integer 4 violates the range [1, 3] (test case 19)