QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#175222	#6568. Space Alignment	SolitaryDream^#	AC ✓	1ms	3804kb	C++14	1.0kb	2023-09-10 16:51:38	2023-09-10 16:51:39

Judging History

你现在查看的是最新测评结果

[2023-09-10 16:51:39]
评测

测评结果：AC
用时：1ms
内存：3804kb

查看

[2023-09-10 16:51:38]
提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
const int N = 52;
int n;
vector<pii> num[N];
int main() {
    scanf("%d", &n);
    for (int i = 1, dep = 0; i <= n; ++i) {
        static string s;
        cin >> s;
        int x = 0, y = 0;
        for (auto c : s) {
            if (c == 's') ++x;
            if (c == 't') ++y;
        }
        if (s.back() == '}') --dep;
        if (dep == 0 && x + y) { puts("-1"); return 0; }
        num[dep].push_back(pii(x, y));
        if (s.back() == '{') ++dep;
    }
    if (!num[1].size()) { 
        puts("1"); 
        return 0; 
    }
    for (int p = 1; p <= 1000; ++p) {
        int k = num[1].front().second * p + num[1].front().first;
        bool flag = 1;
        for (int i = 0; i < N && flag; ++i) 
            for (auto [x, y] : num[i])
                if (i * k != x + y * p) {
                    flag = 0;
                    break;
                }
        if (flag) { printf("%d\n", p); return 0; }
    }
    puts("-1");
    return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3724kb

input:

10
{
ss{
sts{
tt}
t}
t{
ss}
}
{
}

output:

result:

ok single line: '2'

Test #2:

score: 0

Accepted

time: 1ms

memory: 3676kb

input:

2
{
}

output:

result:

ok single line: '1'

Test #3:

score: 0

Accepted

time: 1ms

memory: 3672kb

input:

4
{
ss{
ss}
}

output:

result:

ok single line: '1'

Test #4:

score: 0

Accepted

time: 1ms

memory: 3668kb

input:

4
{
tt{
tt}
}

output:

result:

ok single line: '1'

Test #5:

score: 0

Accepted

time: 1ms

memory: 3612kb

input:

4
{
ss{
s}
}

output:

-1

result:

ok single line: '-1'

Test #6:

score: 0

Accepted

time: 1ms

memory: 3420kb

input:

4
{
tt{
t}
}

output:

-1

result:

ok single line: '-1'

Test #7:

score: 0

Accepted

time: 1ms

memory: 3540kb

input:

4
{
tt{
s}
}

output:

-1

result:

ok single line: '-1'

Test #8:

score: 0

Accepted

time: 1ms

memory: 3424kb

input:

4
{
tt{
sss}
}

output:

-1

result:

ok single line: '-1'

Test #9:

score: 0

Accepted

time: 1ms

memory: 3616kb

input:

4
{
tt{
ssss}
}

output:

result:

ok single line: '2'

Test #10:

score: 0

Accepted

time: 1ms

memory: 3720kb

input:

6
{
}
{
tt{
ssss}
}

output:

result:

ok single line: '2'

Test #11:

score: 0

Accepted

time: 1ms

memory: 3804kb

input:

100
{
}
{
}
{
t{
ssssssssssssssssssssssssssssssssssss}
t{
t}
t{
tssssssssssssssssssssssssssssssssssss{
tssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssss{
tsssssssssssssssssssssssssssssssssssst}
ttssssssssssssssssssssssssssssssssssss{
ssssssssssssssssssssssssssssssssssssssssss...

output:

result:

ok single line: '36'

Test #12:

score: 0

Accepted

time: 1ms

memory: 3628kb

input:

100
{
t{
tssssssssssssssssssss{
ttssssssssssssssssssss{
tsssssssssssssssssssstt{
sssssssssssssssssssssssssssssssssssssssssssssssssssssssssssstt{
ttsssssssssssssssssssstssssssssssssssssssssssssssssssssssssssss{
sssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssstsssssssss...

output:

result:

ok single line: '20'

Test #13:

score: 0

Accepted

time: 1ms

memory: 3624kb

input:

4
{
t{
sssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssss...

output:

result:

ok single line: '999'