#include "hundred.h"
using namespace std;
int root[100];
int col[100];
int get_root(int x)
{
return root[x] = (root[x] == x ? x : get_root(root[x]));
}
int merge(int x, int y)
{
x = get_root(x);
y = get_root(y);
if(x == y) return 0;
root[x] = y;
col[y] = col[x];
return 1;
}
std::string GetHundredPoints(int A, int B, int C) {
string s = string(A, 'A') + string(B, 'B') + string(C, 'C');
if (C)
{
return s;
}
for(int i=0;i<100;i++)
root[i] = i;
int x = Mark(s);
if(B == 0) return string(A, 'A');
else if(A == 0) return string(B, 'B');
for(int i=0;i<B;i++)
{
int p = 0, q = 99-i;
swap(s[p], s[q]);
int y = Mark(s);
if(y == x+2)
{
col[get_root(p)] = 'B';
col[get_root(q)] = 'A';
}
else if(y == x-2)
{
col[get_root(p)] = 'A';
col[get_root(q)] = 'B';
}
else
{
merge(p, q);
}
swap(s[p], s[q]);
}
for(int i=1;i<A;i++)
{
int p = i, q = 99;
swap(s[p], s[q]);
int y = Mark(s);
if(y == x+2)
{
col[get_root(p)] = 'B';
col[get_root(q)] = 'A';
}
else if(y == x-2)
{
col[get_root(p)] = 'A';
col[get_root(q)] = 'B';
}
else
{
merge(p, q);
}
swap(s[p], s[q]);
}
for(int i=0;i<100;i++)
s[i] = col[get_root(i)];
return s;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
384 KB |
Output is correct |
2 |
Correct |
8 ms |
256 KB |
Output is correct |
3 |
Incorrect |
6 ms |
256 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
384 KB |
Output is correct |
2 |
Correct |
8 ms |
256 KB |
Output is correct |
3 |
Incorrect |
6 ms |
256 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |