QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #655844 | #9484. Colored Complete Graph | Zako oni.A unpassed. (Xiangqian Wang, Hao Luo, Wenhao Chu)# | WA | 2ms | 6308kb | C++17 | 1.6kb | 2024-10-19 09:58:42 | 2024-10-19 09:58:44 |
Judging History
answer
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dou;
typedef pair<int,int> pii;
#define fi first
#define se second
#define mapa make_pair
typedef long double ld;
typedef unsigned long long ull;
#define ep emplace_back
template <typename T>inline void read(T &x){
x=0;char c=getchar();bool f=0;
for(;c<'0'||c>'9';c=getchar()) f|=(c=='-');
for(;c>='0'&&c<='9';c=getchar())
x=(x<<1)+(x<<3)+(c^48);
x=(f?-x:x);
}
const int N=50005;
int n;
int fa[N], fb[N];
vector<int> ba[N], bb[N];
inline void ma(int x, int y){
if(ba[x].size()<ba[y].size()) swap(x, y);
for(auto t:ba[y]) fa[t]=x, ba[x].ep(t);
}
inline void mb(int x, int y){
if(bb[x].size()<bb[y].size()) swap(x, y);
for(auto t:bb[y]) fb[t]=x, bb[x].ep(t);
}
char str[2];
vector<pii> va, vb;
int main(){
// freopen("D:\\nya\\acm\\A\\test.in","r",stdin);
// freopen("D:\\nya\\acm\\A\\test.out","w",stdout);
scanf("%d", &n);
for(int i=1; i<=n; ++i) fa[i]=fb[i]=i, ba[i].ep(i), bb[i].ep(i);
for(int i=1; i<n; ++i){
for(int j=i+1; j<=n; ++j){
if((fa[i]^fa[j])&&(fb[i]^fb[j])){
printf("? %d %d\n", i, j);
fflush(stdout);
scanf("%s", str);
if(str[0]=='R'){
ma(fa[i], fa[j]);
va.ep(i, j);
if((int)va.size()==n-1){
printf("!\n");
for(auto t:va) printf("%d %d\n", t.fi, t.se);
return 0;
}
}
else{
mb(fa[i], fa[j]);
vb.ep(i, j);
if((int)vb.size()==n-1){
printf("!\n");
for(auto t:vb) printf("%d %d\n", t.fi, t.se);
return 0;
}
}
}
}
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 2ms
memory: 6252kb
input:
3 B R B
output:
? 1 2 ? 1 3 ? 2 3 ! 1 2 2 3
result:
ok AC
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 6308kb
input:
983 B R R B B B B B R B R R R R R R R B B R R B R B R R B B R B R R R R B R B B B R R R B B R R B R B R B B B R B R R B R B B R R R B B B B R B R R B R B B R B R B R B R R R B B B R R B B B R R B R B B B R B B R R B B R R R R B R R B B B R B B B B R B R R B R R R B R R B R R B R R B R B R B B R B R ...
output:
? 1 2 ? 1 3 ? 1 4 ? 1 5 ? 1 6 ? 1 7 ? 1 8 ? 1 9 ? 1 10 ? 1 11 ? 1 12 ? 1 13 ? 1 14 ? 1 15 ? 1 16 ? 1 17 ? 1 18 ? 1 19 ? 1 20 ? 1 21 ? 1 22 ? 1 23 ? 1 24 ? 1 25 ? 1 26 ? 1 27 ? 1 28 ? 1 29 ? 1 30 ? 1 31 ? 1 32 ? 1 33 ? 1 34 ? 1 35 ? 1 36 ? 1 37 ? 1 38 ? 1 39 ? 1 40 ? 1 41 ? 1 42 ? 1 43 ? 1 44 ? 1 45 ...
result:
wrong answer guessed graph is incorrect