QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#310645 | #8130. Yet Another Balanced Coloring Problem | do_while_true | AC ✓ | 80ms | 39568kb | C++14 | 2.8kb | 2024-01-21 16:34:24 | 2024-01-21 16:34:24 |
Judging History
answer
#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<random>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n'
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n'
#define DE(fmt,...) fprintf(stderr, "Line %d : " fmt "\n",__LINE__,##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pll>vpll;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
r=0;bool w=0;char ch=getchar();
while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
const int mod=998244353;
inline void cadd(int &x,int y){x=(x+y>=mod)?(x+y-mod):(x+y);}
inline void cdel(int &x,int y){x=(x-y<0)?(x-y+mod):(x-y);}
inline int add(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
inline int del(int x,int y){return (x-y<0)?(x-y+mod):(x-y);}
int qpow(int x,int y){
int s=1;
while(y){
if(y&1)s=1ll*s*x%mod;
x=1ll*x*x%mod;
y>>=1;
}
return s;
}
const int N=200010;
int n,m;
int fa[N],siz[N],vis[N],tot,ot[N],ok[N],cur[N];
vi eg[N];
vpii tr[N];
void dfs1(int x){
if(!eg[x].size()){
if(x<=n){
++tot;ot[x]=tot;vis[tot]=0;
tr[x].pb(x+n,tot);
tr[x+n].pb(x,tot);
}
siz[x]=1;
}
for(auto v:eg[x])dfs1(v),siz[x]+=siz[v];
if(siz[x]&1){
++tot;vis[tot]=0;
tr[x].pb(fa[x],tot);
tr[fa[x]].pb(x,tot);
}
}
void dfs2(int x){
ok[x]=1;
for(int &i=cur[x];i<(int)tr[x].size();i++){
int v=tr[x][i].fi,id=tr[x][i].se;
if(!vis[id]){
vis[id]=x;
dfs2(v);
}
}
}
void solve(){
read(n,m);
for(int i=1;i<=n+m+1;i++)vi().swap(eg[i]),vpii().swap(tr[i]),ot[i]=ok[i]=cur[i]=siz[i]=0;
for(int i=1;i<n;i++)read(fa[i]);
fa[n]=n+m+1;
for(int i=n+1;i<n+m;i++)read(fa[i]),fa[i]+=n;
fa[n+m]=n+m+1;
for(int i=1;i<=n+m;i++)eg[fa[i]].pb(i);
tot=0;
dfs1(n+m+1);
for(int i=1;i<=n+m+1;i++)
if(!ok[i])
dfs2(i);
for(int i=1;i<=n;i++)if(ot[i])putchar(vis[ot[i]]<=n?'R':'B');
puts("");
}
signed main(){
#ifdef do_while_true
// assert(freopen("data.in","r",stdin));
// assert(freopen("data.out","w",stdout));
#endif
int T;read(T);
while(T--)solve();
#ifdef do_while_true
// cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
#endif
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 16976kb
input:
2 7 7 5 5 6 6 7 7 5 6 5 6 7 7 5 4 4 4 5 5 4 4 4
output:
RBBR RBB
result:
ok ok (2 test cases)
Test #2:
score: 0
Accepted
time: 14ms
memory: 16008kb
input:
10000 6 6 5 5 5 5 6 5 6 6 6 6 9 6 7 9 7 7 6 8 9 9 6 6 6 6 6 9 8 9 9 8 7 7 8 8 9 7 7 8 7 7 7 8 6 10 4 5 5 6 6 4 6 5 7 8 9 8 9 10 6 9 6 6 6 6 6 6 9 7 8 8 9 9 9 8 9 8 6 6 7 6 7 8 7 9 7 6 7 8 9 9 9 8 6 7 7 5 8 8 8 9 7 5 6 5 8 7 8 8 7 6 6 5 5 6 7 8 5 7 6 6 7 7 9 9 8 9 8 8 8 8 9 9 9 9 8 8 9 9 8 9 9 8 8 8 ...
output:
RBRB RBRBB RBRBRB RRB RBRRB RRBRB RRBB RBRB RBBRBRR RBBRBRR RBR RBBRBR RRB RBRBRBR RRBBRB RBBR RRB RRRBB RRB RRBBB RRBBR RBBR RRBBR RBR RBRBR RRBB RBRBRB RRBRBB RBBR RRRBBB RRBRBB RBRRB RRBRBB RBRBRB RRBBRB RBB RRBB RRB RRB RRRBB RRBB RBRBRB RBR RRBRB RBB RBRBRB RRBBRB RRB RBRBRB RRB RBB RBRB RBRBR ...
result:
ok ok (10000 test cases)
Test #3:
score: 0
Accepted
time: 17ms
memory: 15876kb
input:
1000 98 96 41 39 52 47 34 37 45 33 68 54 74 35 65 58 49 46 53 42 87 30 43 48 38 36 56 40 88 66 32 31 72 44 91 96 51 85 83 61 60 59 80 63 70 80 75 61 51 83 50 69 86 55 79 62 67 57 73 93 96 64 69 91 78 73 80 83 81 91 91 71 76 81 75 90 92 77 82 89 82 86 98 84 96 89 97 96 91 97 94 93 95 97 97 95 96 97 9...
output:
RBRBBRBRBRRRBBBBRRBBBBRRRRRBR RRBBRRRRRRRRBBRBBBBRBBBB RBRRBRBBBRRBRRBRBBBBRRBBRRBBRRBBBRRRRRRBRBBBBBRRBBBRRRRBBBRRRBBBRBRRBRBRBBBRBRR RRRRRBRRBBBRRBBBBBBBBRRRR RBBBBRBBBRRBBRBBBBRRRRBBBRRRRRRBBRBRRBBRRRRRBBBRBR RRBBBBRBBRBRRBRRBRRBBRRRBBRBRBBBRRBR RBBRRRBRRRBBRBBRBBRBRBRRRRBBRRBBBBBBRR RRRBBRB RBBR...
result:
ok ok (1000 test cases)
Test #4:
score: 0
Accepted
time: 35ms
memory: 18600kb
input:
10 9442 9473 6729 7355 6467 7301 7964 7025 7066 7206 8711 8044 7401 6634 6594 9405 7767 7253 7611 6730 6630 8250 6872 6720 8868 8644 9280 7272 6808 8887 7965 7384 6376 9115 8340 7618 8377 9351 8690 8842 9014 6913 7207 7552 8087 9013 9340 6509 8152 6963 8666 8716 7681 6447 8097 7014 6854 8576 6915 92...
output:
RBBBBRRBBRBRRRBBBRRBBRBRBBBBRRBBRRRBBRRRRBBRBRBRBRRBRRBBRRRBRBRBRRBBBBBBRBBRRBRBRRBRRBRBRBRRBBRBRBRBRBBRBRBBRBRBBBRBRRRBBBBBBBRBBBRRBBRBBRBBBRRRBRRBBRRBBBRBBBBBBBRRRRRBRRRBBBRRBBRBRBRRRBRBBRBRBBBBRBBBRRBBBBBBRBBRBRRRRRBBBBRBBBRRBBBRRBRRRBBBBBRRBRRRRRBBBRBRRBRRRRRRRBBRRBRBBBBBRBBRBRBRRRRRRRRBBBBBBBBR...
result:
ok ok (10 test cases)
Test #5:
score: 0
Accepted
time: 23ms
memory: 39568kb
input:
1 100000 100000 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 9...
output:
R
result:
ok ok (1 test case)
Test #6:
score: 0
Accepted
time: 36ms
memory: 35388kb
input:
1 100000 100000 27 17 44 12 22 19 14 21 15 11 48 13 16 20 34 18 24 26 25 28 43 23 33 29 31 30 46 45 41 36 32 38 90 35 40 37 39 55 47 42 59 52 65 72 49 50 54 53 51 64 56 57 66 58 63 82 62 61 60 69 86 95 85 71 68 67 83 70 74 73 77 75 81 76 78 88 89 79 80 84 94 96 123 106 110 87 92 91 99 102 93 98 101 ...
output:
RRRRBBBBBR
result:
ok ok (1 test case)
Test #7:
score: 0
Accepted
time: 61ms
memory: 35144kb
input:
1 100000 100000 218 381 317 660 186 296 679 224 357 361 193 231 232 288 310 183 209 206 182 300 400 344 250 440 519 563 203 333 346 543 427 447 245 289 202 386 221 249 256 359 257 370 200 393 263 270 340 191 240 644 489 522 380 453 241 207 345 719 261 336 364 260 211 541 178 215 383 220 886 403 441 ...
output:
RRRRRBRRRBBRRRBBBRRBRRRRRBRBRBRRRRBBBBRBBBRRBBBBRBBBBRRBBBBRBRRBRRBBBBRBRBBRRRRBBBRBBRRBBRBRBBBBBRRBRRBRRBBBRBRRBRRBRBRBRBBRRRBRRBRBRBRRRRRBRBRBRRBRRBRRBBBBBRRBRBRBRRBBBBBBBRRB
result:
ok ok (1 test case)
Test #8:
score: 0
Accepted
time: 66ms
memory: 35284kb
input:
1 100000 100000 1421 2788 1423 1160 1112 1488 1236 5948 1163 1757 1410 2312 1361 2923 1593 1342 1999 1293 1081 2501 1942 2294 1893 1059 1610 1844 1256 1287 3866 2443 1668 2351 2721 1191 1618 1058 2556 1182 4821 1303 1528 2149 1564 1294 2339 1490 2179 3047 1645 1178 1536 3950 1275 8455 1068 2870 2234...
output:
RRRBBRRBRRRRBBBBBRRRRRRRRBBBRRRRRBRBRBBBRRBRRBBRRRRBBRRRRRBRRBBRRBRRRBBBBRBRBRRBRRBBRBRBBBRRBRRRRBBRBRBBBBRRBRRBBRRBBBRRBRBRRRBRRBBRRRRBBBBRBRBBRRRBBBBRBRBRBRRRBRBBRRBRRBRRBRRRBBRRRBBRBBRRBBBBBRBRBBRBRBRBRRRRRBBRRRBRRBBBRBBRBRRBRBBBRRRBBRBRRRRBBRBBRBRBRBBBRBBBRBRBBBBBBRRRBBBBBRRRRRBBBBBBRRBRBRRRRBBR...
result:
ok ok (1 test case)
Test #9:
score: 0
Accepted
time: 80ms
memory: 34852kb
input:
1 100000 100000 13732 23027 27029 18787 13613 22155 13102 24134 16692 14811 14984 38995 53389 15109 14007 13571 39616 23329 57926 78696 15054 18000 18665 15849 48065 15896 12897 14354 18446 27792 19390 19744 32923 16980 18489 27104 17926 43496 25322 21020 16210 38766 16458 32680 31819 51489 16147 16...
output:
RRBBBBBBBBRRBBBBRBBRBBBBRRRRBBBRRRRBBRRRRBBBBBBBRBBBRBBRRRRRRBRRBRBRBBBRRRRBRRRRRBRRRRBBRBBBBBBBBBRBBRRRBBRBRBBRBBRRRBBRRRRRRBBRRRBBRRRBRRBBRBRRBBRBRBRRRBBBRRRBRRRRBBBBRRRBRBBBBBRRBBRBBBRRBRRBBBBBRRBRBRBRBBBBRBRBBRBBBBBBRRRRBRRBBBBRRBBRRRRRBRRRRBBRBBBRRBBRBRRBRBBRBRRBRBRRBBRBBRBRRRRRRRRRRBBRBRRRRBRB...
result:
ok ok (1 test case)
Test #10:
score: 0
Accepted
time: 65ms
memory: 34620kb
input:
1 100000 100000 96980 98039 98580 93297 93757 97307 99757 94452 92927 98214 98011 93924 93860 95890 92565 93639 93376 92841 93009 93010 98649 93905 99583 97162 96430 99638 99287 94535 94294 98896 92712 98796 96197 94388 99111 96453 94989 97747 95737 96731 97796 98914 95663 93712 93423 94795 96869 98...
output:
RBBBRBRBRBBBRBBRRRBBRBRBBRBBRRBRBRRRBBBRBBRRBRBRRBRRBRBRBBRBRRRBRRRBBBRRBBBRRRBRRRBRBBBBBBRBRRBRBBRRBRBBBBRRBBBBBBBBBRRRBBBBBRBBBRRBRRBRBRRBRRBBRRBBBBBRBBBRRBRBRRRRRRRBBBBRBRBBRRBRBRRRRBRRBRBRBBRRBRRBRRRRRBBRBRRRRBRRBBBBRBRRBBBRBBRBBBBBRBBBRBBBBBRRRRRRRBRBRRRBRBBBBRRBRRRRBRRBBRRRBBRRRRBRRRBBRRBRRRRR...
result:
ok ok (1 test case)
Test #11:
score: 0
Accepted
time: 23ms
memory: 25308kb
input:
1 100000 30 51 28 32 13 22 18 19 20 12 25 21 14 15 16 23 17 29 33 27 24 39 35 26 34 37 46 42 31 30 36 41 40 38 50 48 71 44 79 45 58 43 68 47 93 54 49 53 60 66 57 52 55 63 56 62 67 76 59 64 61 78 65 69 74 70 89 75 118 77 72 73 81 80 84 111 95 87 82 98 85 83 86 90 96 121 91 88 94 92 99 97 100 101 102 ...
output:
RRBBRRRBBBR
result:
ok ok (1 test case)
Test #12:
score: 0
Accepted
time: 0ms
memory: 16964kb
input:
1 3 3 3 3 3 3
output:
RB
result:
ok ok (1 test case)
Extra Test:
score: 0
Extra Test Passed