Codeforce 957 Div2 A. Tritonic Iridescence
2018-03-27 10:16
369 查看
outputstandard outputOverlooking the captivating blend of myriads of vernal hues, Arkady the painter lays out a long, long canvas.Arkady has a sufficiently large amount of paint of three colours: cyan, magenta, and yellow. On the one-dimensional canvas split into nconsecutive segments, each segment needs to be painted in one of the colours.Arkady has already painted some (possibly none or all) segments and passes the paintbrush to you. You are to determine whether there are at least two ways of colouring all the unpainted segments so that no two adjacent segments are of the same colour. Two ways are considered different if and only if a segment is painted in different colours in them.InputThe first line contains a single positive integer n (1 ≤ n ≤ 100) — the length of the canvas.The second line contains a string s of n characters, the i-th of which is either 'C' (denoting a segment painted in cyan), 'M' (denoting one painted in magenta), 'Y' (one painted in yellow), or '?' (an unpainted one).OutputIf there are at least two different ways of painting, output "Yes"; otherwise output "No" (both without quotes).You can print each character in any case (upper or lower).ExamplesinputCopy
using namespace std;
string s;
int main()
{
int n;
cin>>n;
getchar();
cin>>s;
int sum=0,flag=0,flag1=0,flag2=1;
for(int i=0;i<s.size();i++)
{
if(s[i]==s[i+1]&&s[i]!='?'&&s[i+1]!='?')
{
flag2=0;
break;
}
else
{
if(s[i]=='?')
{
sum++;
if(s[i-1]=='?'||s[i+1]=='?')
flag=1;
else
if(s[i-1]==s[i+1])
flag1=1;
}
}
}
if(n==1&&s[0]=='?')
{
puts("Yes");
return 0;
}
if(!flag2||sum==0||n==1)
puts("No");
else
{
if(sum==1)
{
if(s[0]=='?'||s[s.size()-1]=='?')
puts("Yes");
else
{
if(!flag1)
puts("No");
else
puts("Yes");
}
}
else
{
if(flag)
{
puts("Yes");
}
else if(s[0]=='?'||s[s.size()-1]=='?')
puts("Yes");
else
{
if(!flag1)
puts("No");
else
puts("Yes");
}
}
}
return 0;
}
5 CY??Youtput
YesinputCopy
5 C?C?Youtput
YesinputCopy
5 ?CYC?output
YesinputCopy
5 C??MMoutput
NoinputCopy
3 MMYoutput
NoNoteFor the first example, there are exactly two different ways of colouring: CYCMY and CYMCY.For the second example, there are also exactly two different ways of colouring: CMCMY and CYCMY.For the third example, there are four ways of colouring: MCYCM, MCYCY, YCYCM, and YCYCY.For the fourth example, no matter how the unpainted segments are coloured, the existing magenta segments will prevent the painting from satisfying the requirements. The similar is true for the fifth example.#include<bits/stdc++.h>
using namespace std;
string s;
int main()
{
int n;
cin>>n;
getchar();
cin>>s;
int sum=0,flag=0,flag1=0,flag2=1;
for(int i=0;i<s.size();i++)
{
if(s[i]==s[i+1]&&s[i]!='?'&&s[i+1]!='?')
{
flag2=0;
break;
}
else
{
if(s[i]=='?')
{
sum++;
if(s[i-1]=='?'||s[i+1]=='?')
flag=1;
else
if(s[i-1]==s[i+1])
flag1=1;
}
}
}
if(n==1&&s[0]=='?')
{
puts("Yes");
return 0;
}
if(!flag2||sum==0||n==1)
puts("No");
else
{
if(sum==1)
{
if(s[0]=='?'||s[s.size()-1]=='?')
puts("Yes");
else
{
if(!flag1)
puts("No");
else
puts("Yes");
}
}
else
{
if(flag)
{
puts("Yes");
}
else if(s[0]=='?'||s[s.size()-1]=='?')
puts("Yes");
else
{
if(!flag1)
puts("No");
else
puts("Yes");
}
}
}
return 0;
}
相关文章推荐
- 【比赛总结】Codeforce 451 Div2
- 【CodeForce】Codeforces Round #140 (Div. 2) A B C
- codeforce 310 div2 D题 Case of Fugitive
- codeforce 416 div2 C - Vladik and Memorable Trip 线性dp
- codeforce 386(div2) D. Green and Black Tea
- Codeforces 924 A Tritonic Iridescence(暴力集合交集、相等)
- CodeForce 204 Div2. C Jeff And Rounding
- Codeforces Round #377 (Div. 2) D. Exams && codeforce 732 D 详解(贪心+二分)
- codeforce 315 div2
- Codeforce 217 div2
- codeforce 285 div2 d 题解
- codeforce 385 div1 a
- codeforce 344 div2 前三题
- Codeforce 218 div2
- Codeforces Round #381 (Div. 2) &&Codeforce_740
- Codeforce 220 div2
- 20130805-codeforce 108-div2-CF训练
- codeforce 263 div2D Gargari and Permutations
- CodeForce 78 Div2
- 【CodeForce】Codeforces Round #142 (Div. 2) A B C