QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#349043 | #6568. Space Alignment | realcomplex0# | WA | 1ms | 3724kb | C++20 | 1.5kb | 2024-03-09 23:18:55 | 2024-03-09 23:18:55 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int main(){
fastIO;
int n;
cin >> n;
string s;
vector<int> a(n), b(n), dep(n);
int d = -1;
for(int i = 0; i < n; i ++) {
cin >> s;
char l = s.back();
s.pop_back();
for(char x : s){
if(x == 's') b[i] ++ ;
else a[i] ++ ;
}
if(l == '{'){
d ++ ;
dep[i]=d;
}
else{
dep[i]=d;
d -- ;
}
}
int r;
for(int K = 1; K <= (int)1e5 + 10; K ++ ){
r = -2;
int cur;
for(int i = 0 ; i < n; i ++) {
if(K * dep[i] - b[i] >= 0){
if(a[i] == 0){
if(K * dep[i] != b[i]){
r = -1;
break;
}
}
else{
cur = (K * dep[i] - b[i]) / a[i];
if(r != -2 && r != cur) r = -1;
else r = cur;
}
}
else{
r = -1;
break;
}
}
if(r != -1){
r=max(r,1);
cout << r << "\n";
return 0;
}
}
cout << "-1\n";
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3556kb
input:
10 { ss{ sts{ tt} t} t{ ss} } { }
output:
2
result:
ok single line: '2'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3500kb
input:
2 { }
output:
1
result:
ok single line: '1'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3512kb
input:
4 { ss{ ss} }
output:
1
result:
ok single line: '1'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
4 { tt{ tt} }
output:
1
result:
ok single line: '1'
Test #5:
score: 0
Accepted
time: 1ms
memory: 3724kb
input:
4 { ss{ s} }
output:
-1
result:
ok single line: '-1'
Test #6:
score: 0
Accepted
time: 1ms
memory: 3592kb
input:
4 { tt{ t} }
output:
-1
result:
ok single line: '-1'
Test #7:
score: -100
Wrong Answer
time: 0ms
memory: 3508kb
input:
4 { tt{ s} }
output:
1
result:
wrong answer 1st lines differ - expected: '-1', found: '1'