QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#140369 | #6568. Space Alignment | smosp# | WA | 50ms | 3468kb | C++17 | 1.4kb | 2023-08-15 20:04:43 | 2023-08-15 20:04:47 |
Judging History
answer
#include "bits/stdc++.h"
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >>n;
vector<int> spaces(n), tabs(n), indent(n);
for (int i =0; i < n; i++) {
string s;
cin >> s;
int l = (int)s.size();
for (int j = 0; j+1<l; j++) {
spaces[i] += (s[j] == 's');
tabs[i] += (s[j] == 't');
}
if (s[l-1] == '{') {
if (i) indent[i] += indent[i-1]+1;
} else if (s[l-1] == '}') {
if (i && i+1 < n) {
indent[i] += indent[i-1];
indent[i+1] += -1;
}
} else assert(false);
}
const int MAX_CHECK = 3e6;
int ans = -1;
for (int width = 1; width <= MAX_CHECK; width++) {
bool ok = true;
vector<int64_t> width_by_depth(n, -1);
int64_t mult = -1;
for (int i =0 ; i < n; i++) {
int64_t tot_width = int64_t(tabs[i])*width + spaces[i];
if (width_by_depth[indent[i]] != -1 && width_by_depth[indent[i]] != tot_width) {
ok = false;
break;
}
width_by_depth[indent[i]] = tot_width;
if (indent[i]) {
int64_t this_mult = tot_width/indent[i];
if (mult != -1 && this_mult != mult) {
ok = false;
break;
}
mult = this_mult;
}
}
if (!ok) continue;
ans = width;
break;
}
cout << ans << '\n';
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3468kb
input:
10 { ss{ sts{ tt} t} t{ ss} } { }
output:
2
result:
ok single line: '2'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3456kb
input:
2 { }
output:
1
result:
ok single line: '1'
Test #3:
score: -100
Wrong Answer
time: 50ms
memory: 3444kb
input:
4 { ss{ ss} }
output:
-1
result:
wrong answer 1st lines differ - expected: '1', found: '-1'