QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#449226 | #8544. Colorful Graph 2 | ukuk | WA | 0ms | 3656kb | C++14 | 1.1kb | 2024-06-20 20:21:34 | 2024-06-20 20:21:35 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define i64 long long
#define LL long long
#define i128 __int128
#define ull unsigned long long
#define db long double
#define PII pair<int,int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define lowbit(x) ((x)&-(x))
#define debug(x) cout<<(#x)<<" = "<<(x)<<'\n'
const double eps=1e-8;
const int mod=1e9+7;
//const int mod=998244353;
const int inf=1e9+7;
const i64 INF=1e9+7;
const int N=1e5+5;
const int M=1e6+5;
//const int g=3;
//const int gi=332748118;
LL qmi(LL a,int b){
a=(a%mod+mod)%mod;
LL ret=1;
for(;b;b>>=1,a=a*a%mod)if(b&1)ret=ret*a%mod;
return ret;
}
int Sqrt(int x){
assert(x>=0);
int t=sqrt(x);
while((t+1)*(t+1)<=x)t++;
while(t*t>x)t--;
return t;
}
int n;
int m;
inline void solve(){
cin>>n>>m;
for(int i=0;i<m;i++){
int x,y;cin>>x>>y;
}
for(int i=0;i<n;i++){
if(i&1)cout<<"R";
else cout<<"B";
}
cout<<'\n';
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int _=1;
cin>>_;
while(_--)solve();
return 0;
}
/*
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3656kb
input:
3 3 0 4 1 1 3 6 3 0 2 2 4 4 0
output:
BRB BRBR BRBRBR
result:
wrong answer cycle detected (test case 3)