QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #70003 | #2113. Zbalansowane słowa | Qingyu | Compile Error | / | / | C++ | 1.0kb | 2023-01-06 19:30:47 | 2023-01-06 20:08:48 |
Judging History
This is the latest submission verdict.
- [2023-08-10 23:21:45]
- System Update: QOJ starts to keep a history of the judgings of all the submissions.
- [2023-01-06 20:08:48]
- Judged
- Verdict: Compile Error
- Time: 0ms
- Memory: 0kb
- [2023-01-06 19:30:47]
- Submitted
answer
//
// Created by hydd on 2022/9/5.
//
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
string s;
int n;
map<pii, int> mp, mp1, mp2, mp3, mp4, mp5, mp6;
int main() {
cin >> s;
n = s.length();
mp[pii(0, 0)] = 1;
mp1[pii(0, 0)] = 1;
mp2[pii(0, 0)] = 1;
mp3[pii(0, 0)] = 1;
mp4[pii(0, 0)] = 1;
mp5[pii(0, 0)] = 1;
mp6[pii(0, 0)] = 1;
int A = 0, B = 0, C = 0;
ll ans = 0;
for (int i = 0; i < n; i++) {
A += (s[i] == 'a');
B += (s[i] == 'b');
C += (s[i] == 'c');
ans += mp[pii(A - B, B - C)] + mp1[pii(A - B, C)] + mp2[pii(A - C, B)] + mp3[pii(B - C, A)];
ans += mp4[pii(A, B)] + mp5[pii(A, C)] + mp6[pii(B, C)];
mp[pii(A - B, B - C)]++;
mp1[pii(A - B, C)]++;
mp2[pii(A - C, B)]++;
mp3[pii(B - C, A)]++;
mp4[pii(A, B)]++;
mp5[pii(A, C)]++;
mp6[pii(B, C)]++;
}
cout << ans << '\n';
return 0;
}
詳細信息
Compiler Dangerous Syscalls