赛时 T 成 0pts qwq~
为什么呢?
#include <bits/stdc++.h>
using namespace std;
namespace pt5 {
int n, c;
string s;
int main () {
cin >> n >> s;
for (int i = 1; i < s.size (); i++) {
if (s[i - 1] == s[i]) {
c++;
}
}
cout << c;
return 0;
}
}
namespace pt75 {
const int N = 1000010;
int n, p[N], c;
string s[N];
int doit (char c) {
int ans = 0;
bool ok = true, noval = true;
for (int i = 1; i <= n; i++) {
if (p[i] < s[i].size ()) {
ok = false;
if (s[i][p[i]] == c) {
noval = false;
ans++;
p[i]++;
}
}
}
if (ok) {
return 0;
}
return ans + doit (c ^ noval) - noval;
}
int main () {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s[i];
}
c = doit ('0');
for (int i = 1; i <= n; i++) {
p[i] = 0;
}
c = max (c, doit ('1'));
cout << c - 1;
}
}
int main () {
ios::sync_with_stdio (false);
cin.tie (NULL);
cout.tie (NULL);
pt5::main ();
return 0;
}
把pt5::main
改为pt75::main
就是 0 pts,luogu IDE 上测几组没问题。
难道数据超强?