QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#792285	#6568. Space Alignment	lukamosiashvili^#	AC ✓	0ms	3856kb	C++17	1.2kb	2024-11-29 08:49:26	2024-11-29 08:49:27

Judging History

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

[2024-11-29 08:49:27]
评测

测评结果：AC
用时：0ms
内存：3856kb

查看

[2024-11-29 08:49:26]
提交

answer

#include <bits/stdc++.h>
using namespace std;

string s[109];
char ch[109];
int tabs[109], spaces[109], val[109];

int main(){
    ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> s[i];
        ch[i] = s[i].back();
    }

    for(int i = 1; i <= n; i++){
        for(int j = 0; j < s[i].size() - 1; j++){
            if(s[i][j] == 's') spaces[i]++; else tabs[i]++;
        }
    }

    for(int t = 1; t <= 4009; t++){
        for(int i = 1; i <= n; i++){
            val[i] = t * tabs[i] + spaces[i];
        }

        set <int> indent;
        bool flag = 0;
        for(int i = 2; i <= n; i++){
            if(ch[i] != ch[i - 1]){
                if(val[i] != val[i - 1]){
                    flag = 1;
                    break;
                }
                continue;
            }

            if(ch[i] == '{') indent.insert(val[i] - val[i - 1]); else indent.insert(val[i - 1] - val[i]);
        }

        if(indent.size() && (*indent.begin()) <= 0) flag = 1;

        if(indent.size() < 2 && !flag){
            cout << t;
            return 0;
        }
    }

    cout << -1;
    return 0;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3856kb

input:

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

output:

result:

ok single line: '2'

Test #2:

score: 0

Accepted

time: 0ms

memory: 3620kb

input:

2
{
}

output:

result:

ok single line: '1'

Test #3:

score: 0

Accepted

time: 0ms

memory: 3552kb

input:

4
{
ss{
ss}
}

output:

result:

ok single line: '1'

Test #4:

score: 0

Accepted

time: 0ms

memory: 3612kb

input:

4
{
tt{
tt}
}

output:

result:

ok single line: '1'

Test #5:

score: 0

Accepted

time: 0ms

memory: 3776kb

input:

4
{
ss{
s}
}

output:

-1

result:

ok single line: '-1'

Test #6:

score: 0

Accepted

time: 0ms

memory: 3612kb

input:

4
{
tt{
t}
}

output:

-1

result:

ok single line: '-1'

Test #7:

score: 0

Accepted

time: 0ms

memory: 3812kb

input:

4
{
tt{
s}
}

output:

-1

result:

ok single line: '-1'

Test #8:

score: 0

Accepted

time: 0ms

memory: 3616kb

input:

4
{
tt{
sss}
}

output:

-1

result:

ok single line: '-1'

Test #9:

score: 0

Accepted

time: 0ms

memory: 3612kb

input:

4
{
tt{
ssss}
}

output:

result:

ok single line: '2'

Test #10:

score: 0

Accepted

time: 0ms

memory: 3820kb

input:

6
{
}
{
tt{
ssss}
}

output:

result:

ok single line: '2'

Test #11:

score: 0

Accepted

time: 0ms

memory: 3656kb

input:

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

output:

result:

ok single line: '36'

Test #12:

score: 0

Accepted

time: 0ms

memory: 3616kb

input:

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

output:

result:

ok single line: '20'

Test #13:

score: 0

Accepted

time: 0ms

memory: 3624kb

input:

4
{
t{
sssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssss...

output:

result:

ok single line: '999'