problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h> //线段树维护区间和
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 1e5 + 10;
int main() {
int k;
scanf("%d", &k);
ll n = 7;
int ans = 1;
if (k % 2 == 0 || k == 5) {
printf("-1");
return 0;
}
while (1) {
if (n % k == 0) {
printf("%d", an... | #include <bits/stdc++.h> //线段树维护区间和
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 1e5 + 10;
int main() {
int k;
scanf("%d", &k);
ll n = 7;
int ans = 1;
if (k % 2 == 0 || k % 5 == 0) {
printf("-1");
return 0;
}
while (1) {
if (n % k == 0) {
printf("%d"... | replace | 11 | 12 | 11 | 12 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define MAX 10000001
using namespace std;
int main() {
int A = 7;
int K, ans;
cin >> K;
if (K % 2 == 0) {
cout << -1 << endl;
return 0;
}
long long amari = 0;
for (int i = 1;; i++) {
amari += A % K;
if (amari % K == 0) {
ans = i;
break;
} else {
... | #include <bits/stdc++.h>
#define MAX 10000001
using namespace std;
int main() {
int A = 7;
int K, ans;
cin >> K;
if (K % 2 == 0 || K % 5 == 0) {
cout << -1 << endl;
return 0;
}
long long amari = 0;
for (int i = 1;; i++) {
amari += A % K;
if (amari % K == 0) {
ans = i;
break;
... | replace | 8 | 9 | 8 | 9 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int K, sum = 0, count = 1;
cin >> K;
if (K % 2 == 0 || K % 5 == 0) {
cout << "-1";
} else {
while (1) {
sum = 7 + sum * 10;
if (sum % K == 0) {
cout << count;
break;
}
count++;
}
}
}
| #include <iostream>
using namespace std;
int main() {
int K, sum = 0, count = 1;
cin >> K;
if (K % 2 == 0 || K % 5 == 0) {
cout << "-1";
} else {
while (1) {
sum = (7 + sum * 10) % K;
if (sum % K == 0) {
cout << count;
break;
}
count++;
}
}
}
| replace | 12 | 13 | 12 | 13 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
#define int long long int
#define vi vector<int>
#define vvi vector<vector<int>>
using namespace std;
int32_t main() {
// your code goes here
int k, count = 0, sum = 0, i, j;
cin >> k;
if (k % 2 == 0) {
cout << "-1\n";
} else {
while (1) {
sum = 10 *... | #include <bits/stdc++.h>
#include <iostream>
#define int long long int
#define vi vector<int>
#define vvi vector<vector<int>>
using namespace std;
int32_t main() {
// your code goes here
int k, count = 0, sum = 0, i, j;
cin >> k;
if (k % 2 == 0) {
cout << "-1\n";
} else {
while (1) {
if (count ... | insert | 15 | 15 | 15 | 19 | TLE | |
p02596 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using st = string;
using P = pair<int, int>;
using bl = bool;
using ch = char;
#define mrep(i, m, n) for (int i = m; i < (n); i++)
#define rep(i, n) mrep(i, 0, n)
#define chmax(x, y) \
{ x = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using st = string;
using P = pair<int, int>;
using bl = bool;
using ch = char;
#define mrep(i, m, n) for (int i = m; i < (n); i++)
#define rep(i, n) mrep(i, 0, n)
#define chmax(x, y) \
{ x = ... | replace | 13 | 14 | 13 | 14 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int k, c = 1;
cin >> k;
// vector<int> x(n), y(n);
int s = 7;
if (k % 2 == 0 && k % 5 == 5) {
cout << -1 << endl;
return 0;
}
while (s % k != 0) {
s = s % k * 10 + 7;
c = c + 1;
}
cout << c << endl;
r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int k, c = 1;
cin >> k;
// vector<int> x(n), y(n);
int s = 7;
if (k % 2 == 0 || k % 5 == 0) {
cout << -1 << endl;
return 0;
}
while (s % k != 0) {
s = s % k * 10 + 7;
c = c + 1;
}
cout << c << endl;
r... | replace | 9 | 10 | 9 | 10 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll K, count = 1;
cin >> K;
ll mod = 7 % K;
if (K % 2 == 0) {
cout << -1 << endl;
return 0;
}
while (mod > 0) {
mod = (mod * 10 + 7) % K;
count++;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll K, count = 1;
cin >> K;
ll mod = 7 % K;
if (K % 2 == 0 || K % 5 == 0) {
cout << -1 << endl;
return 0;
}
while (mod > 0) {
mod = (mod * 10 + 7) % K;
count++;
}
cout << count << endl;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
const long long MOD = 1000000000 + 7;
const double PI = acos(-1);
int main() {
int K;
cin >> K;
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
const long long MOD = 1000000000 + 7;
const double PI = acos(-1);
int main() {
int K;
cin >> K;
... | replace | 15 | 16 | 15 | 16 | TLE | |
p02596 | C++ | Runtime Error | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
ll K;
cin >> K;
if (K == 2 || K == 5) {
cout << -1 << endl;
return 0;
}
ll ten[3000000];
ten[0] = 7;
for (int i = 1; i < 3000000; i++) {
... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
ll K;
cin >> K;
if (K == 2 || K == 5) {
cout << -1 << endl;
return 0;
}
ll ten[3000000];
ten[0] = 7;
for (int i = 1; i < 3000000; i++) {
... | replace | 21 | 22 | 21 | 22 | -11 | |
p02596 | C++ | Time Limit Exceeded | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include... | insert | 814 | 814 | 814 | 819 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i <= (n); i++)
#define REPD(i, a, b) for (int i = (a); i <= (b); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef v... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i <= (n); i++)
#define REPD(i, a, b) for (int i = (a); i <= (b); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef v... | insert | 93 | 93 | 93 | 97 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int k;
cin >> k;
if (k % 7 == 0)
k /= 7;
int ans = 0;
int ini = 1;
if (k % 2 == 0)
ans = -1;
else
while (ini) {
ans++;
// cout<<ini<<" ";
ini = ini % k;
// cout<<ini<<" ";
if (ini == 0)
break;
in... | #include <iostream>
using namespace std;
int main() {
int k;
cin >> k;
if (k % 7 == 0)
k /= 7;
int ans = 0;
int ini = 1;
if (k % 2 == 0 || k % 5 == 0)
ans = -1;
else
while (ini) {
ans++;
// cout<<ini<<" ";
ini = ini % k;
// cout<<ini<<" ";
if (ini == 0)
b... | replace | 10 | 11 | 10 | 11 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = n - 1; i <= 0; --i)
#define loop while (true)
typedef long long ll;
const ll INF = 1LL << 60;
const ll MOD = 1000000007... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = n - 1; i <= 0; --i)
#define loop while (true)
typedef long long ll;
const ll INF = 1LL << 60;
const ll MOD = 1000000007... | replace | 33 | 34 | 33 | 34 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) v.begin(), v.end()
int main() {
ll K;
cin >> K;
if (K % 7 == 0) {
K /= 7;
}
ll L = 9 * K;
ll am = 1;
ll ans;
bool a = false;
for (ll i = 1; i < 1000000000; i++) {
am *= 10;
if (am % L == 1) {
a = tr... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) v.begin(), v.end()
int main() {
ll K;
cin >> K;
if (K % 7 == 0) {
K /= 7;
}
ll L = 9 * K;
if (L % 2 == 0 || L % 5 == 0) {
cout << -1 << endl;
return 0;
}
ll am = 1;
ll ans;
bool a = false;
for (ll i =... | insert | 13 | 13 | 13 | 17 | TLE | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
string c;
cin >> n >> c;
priority_queue<int> r;
vector<int> w;
for (auto i = 0; i < n; i++) {
if (c[i] == 'R')
r.push(i);
else
w.push_back(i);
}
for (auto i = 0; i < (int)w.size(); i++) {
if (r.top() > w[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
string c;
cin >> n >> c;
priority_queue<int> r;
vector<int> w;
for (auto i = 0; i < n; i++) {
if (c[i] == 'R')
r.push(i);
else
w.push_back(i);
}
if (r.empty() or w.empty()) {
cout << 0 << endl;
return... | insert | 14 | 14 | 14 | 18 | 0 | |
p02597 | Python | Runtime Error | N = int(input())
c = input()
d = list(c)
i = 0
j = N - 1
result = 0
while i != j:
if d[i] == "W":
while d[j] != "R" and i != j:
j -= 1
d[i] = "R"
d[j] = "W"
result += 1
i += 1
print(result)
| N = int(input())
c = input()
d = list(c)
i = 0
j = N - 1
result = 0
while True:
while i < N and d[i] != "W":
i += 1
while j > 0 and d[j] != "R":
j -= 1
if i == N or j == -1 or i >= j:
break
d[i] = "R"
d[j] = "W"
result += 1
print(result)
| replace | 8 | 16 | 8 | 18 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1001001001;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
ll n, r, w;
cin >> n;
vector<char> vec(n);
rep(i, n) {
cin >> vec.at(i);
if (vec.at(i) == 'R')
r++;
else if (vec.at(i) == 'W')
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1001001001;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
ll n, r = 0, w = 0;
cin >> n;
vector<char> vec(n);
rep(i, n) {
cin >> vec.at(i);
if (vec.at(i) == 'R')
r++;
else if (vec.at(i) ... | replace | 7 | 8 | 7 | 8 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 18446744071564325282) >= this->size() (which is 4)
|
p02597 | C++ | Runtime Error | #include <algorithm>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF long long int(1e18 + 1)
#define rep(i, n, m) for (int i = n; i < m; i++)
u... | #include <algorithm>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF long long int(1e18 + 1)
#define rep(i, n, m) for (int i = n; i < m; i++)
u... | replace | 36 | 37 | 36 | 37 | 0 | |
p02597 | C++ | Runtime Error | // ##### ##### ##### ##### ##### # ##### # #//
// # # # # # # # # # # # ## ##//
// ##### ##### ##### # ##### # ##### # # #//
// ## # # # # # # # # # # #//
// # # # # # # # # # #... | // ##### ##### ##### ##### ##### # ##### # #//
// # # # # # # # # # # # ## ##//
// ##### ##### ##### # ##### # ##### # # #//
// ## # # # # # # # # # # #//
// # # # # # # # # # #... | replace | 45 | 46 | 45 | 46 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i))
#define ALL(x) ::std::begin(x), ::std::en... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i))
#define ALL(x) ::std::begin(x), ::std::en... | replace | 18 | 19 | 18 | 19 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
#define eps 0.000001;
using namespace std;
typedef long long ll;
const int inf = 0xfff;
const int maxn = 200005;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
struct node {
int x, y, d;
node() { x = y = d = 0; };
};
int main() {
int ... | #include <bits/stdc++.h>
#define eps 0.000001;
using namespace std;
typedef long long ll;
const int inf = 0xfff;
const int maxn = 200005;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
struct node {
int x, y, d;
node() { x = y = d = 0; };
};
int main() {
int ... | replace | 19 | 28 | 19 | 30 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
// typedef tree<int,null_type,less<int
// >,rb_tree_tag,tree_order_statistics_node_update>indexed_set;
template <class T1, class T2> ostream &operator<<(... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
// typedef tree<int,null_type,less<int
// >,rb_tree_tag,tree_order_statistics_node_update>indexed_set;
template <class T1, class T2> ostream &operator<<(... | replace | 35 | 36 | 35 | 36 | 0 | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int i = 0, j = n - 1, ans = 0;
while (1) {
while (i < j and s[i] == 'R')
++i;
while (i < j and s[j] == 'W')
++j;
if (i == j)
break;
swap(s[i], s[j]);
ans++;
}
cout << an... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int i = 0, j = n - 1, ans = 0;
while (1) {
while (i < j and s[i] == 'R')
++i;
while (i < j and s[j] == 'W')
--j;
if (i == j)
break;
swap(s[i], s[j]);
ans++;
}
cout << an... | replace | 13 | 14 | 13 | 14 | TLE | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
string c;
cin >> c;
vector<ll> rsumv(n, 0);
if (c.at(0) == 'R')
rsumv.at(0)++;
for (int i = 1; i < n; i++) {
if (c.at(i) == 'R') {
rsumv.at(i) = rsumv.at(i - 1) + 1;
} else
rsumv.at... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
string c;
cin >> c;
vector<ll> rsumv(n, 0);
if (c.at(0) == 'R')
rsumv.at(0)++;
for (int i = 1; i < n; i++) {
if (c.at(i) == 'R') {
rsumv.at(i) = rsumv.at(i - 1) + 1;
} else
rsumv.at... | replace | 23 | 24 | 23 | 27 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 2e9;
typedef pair<int, int> pi;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
string s;
cin >> n >> s;
vector<int> a, b;
for (int i = 0; i < n; i++) {
if (s[i] == 'W')
a.push_back(i);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 2e9;
typedef pair<int, int> pi;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
string s;
cin >> n >> s;
vector<int> a, b;
for (int i = 0; i < n; i++) {
if (s[i] == 'W')
a.push_back(i);
... | replace | 22 | 23 | 22 | 23 | 0 | |
p02597 | C++ | Runtime Error | // author: hitch_hiker42;
#include <bits/stdc++.h>
using namespace std;
// solution:
signed main() {
int n, count = n, moves = 0;
cin >> n;
string s;
cin >> s;
for (int i = n - 1; ~i; --i)
count -= (s[i] == 'W');
for (int i = 0; i < count; ++i)
moves += (s[i] == 'W');
cout << moves << "\n";
ret... | // author: hitch_hiker42;
#include <bits/stdc++.h>
using namespace std;
// solution:
signed main() {
int n, count, moves = 0;
cin >> n, count = n;
string s;
cin >> s;
for (int i = n - 1; ~i; --i)
count -= (s[i] == 'W');
for (int i = 0; i < count; ++i)
moves += (s[i] == 'W');
cout << moves << "\n"... | replace | 6 | 8 | 6 | 8 | -11 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
char a[10010];
int main() {
int n, rz = 0, r = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] == 'R')
rz++;
}
for (int i = 1; i <= rz; i++)
if (a[i] == 'R')
r++;
cout << rz - r;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
char a[200010];
int main() {
int n, rz = 0, r = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] == 'R')
rz++;
}
for (int i = 1; i <= rz; i++)
if (a[i] == 'R')
r++;
cout << rz - r;
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02597 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | insert | 35 | 35 | 35 | 37 | TLE | |
p02597 | Python | Time Limit Exceeded | N = int(input())
s = input()
count = 0
while "WR" in s:
w_i = s.find("W")
r_i = s.rfind("R")
s = s[:w_i] + "R" + s[w_i + 1 : r_i] + "W" + s[r_i + 1 :]
count += 1
print(count)
| N = int(input())
s = input()
r_count = s.count("R")
new_s = s[:r_count]
print(new_s.count("W"))
| replace | 2 | 11 | 2 | 5 | TLE | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
int N;
char c[20000];
cin >> N;
cin >> c;
int rs = 0, ws = 0;
rep(i, N) {
if (c[i] == 'R')
rs++;
else
ws++;
}
int diff = 0;
for ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
int N;
char c[200000];
cin >> N;
cin >> c;
int rs = 0, ws = 0;
rep(i, N) {
if (c[i] == 'R')
rs++;
else
ws++;
}
int diff = 0;
for... | replace | 8 | 9 | 8 | 9 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
int n;
char c[20000];
cin >> n;
cin >> c;
int rs = 0, ws = 0;
rep(i, n) {
if (c[i] == 'R')
rs++;
else
ws++;
}
int diff = 0;
for ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
int n;
char c[200000];
cin >> n;
cin >> c;
int rs = 0, ws = 0;
rep(i, n) {
if (c[i] == 'R')
rs++;
else
ws++;
}
int diff = 0;
for... | replace | 8 | 9 | 8 | 9 | 0 | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n - 1); i >= 0; --i)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n - 1); i >= 0; --i)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a)... | replace | 36 | 50 | 36 | 43 | TLE | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int i = 0, j = s.size() - 1;
int count = 0;
while (i < n && j >= 0) {
while (i < n && s[i] == 'R')
i++;
while (j >= 0 && s[j] == 'W')
j--;
if (i < n && j >= 0 && i < j) {
swap(s[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int i = 0, j = s.size() - 1;
int count = 0;
while (i < n && j >= 0 && i < j) {
while (i < n && s[i] == 'R')
i++;
while (j >= 0 && s[j] == 'W')
j--;
if (i < n && j >= 0 && i < j) {
... | replace | 10 | 11 | 10 | 11 | TLE | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define PI 3.141592653589
#define ll long long int
#define ld long double
#define vi vector<int>
#define ii pair<int, int>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pll pair<ll, ll>
#define vv vector
int MOD = 1e9 + 7;
ll power(ll... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.141592653589
#define ll long long int
#define ld long double
#define vi vector<int>
#define ii pair<int, int>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pll pair<ll, ll>
#define vv vector
int MOD = 1e9 + 7;
ll power(ll... | replace | 84 | 85 | 84 | 85 | 0 | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
if (all_of(s.begin(), s.end(), [s](char x) { return s[0] == x; })) {
cout << 0 << endl;
return 0;
}
int ans = 0, l = 0, r = n - 1;
rep(i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int r = count(s.begin(), s.end(), 'R');
int ans = count(s.begin(), s.begin() + r, 'W');
cout << ans << endl;
return 0;
}
| replace | 10 | 28 | 10 | 12 | TLE | |
p02597 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 20000... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 20000... | replace | 54 | 55 | 54 | 55 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string Iro;
cin >> Iro;
int Ans = 0;
int Red = 0;
for (int i = 0; i < N; i++) {
if (Iro.at(i) == 'R') {
Red++;
}
}
if (Red != 0) {
for (int i = 0; i <= Red; i++) {
if (Iro.at(i) == 'W') {
Ans... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string Iro;
cin >> Iro;
int Ans = 0;
int Red = 0;
for (int i = 0; i < N; i++) {
if (Iro.at(i) == 'R') {
Red++;
}
}
if (Red != 0) {
Red--;
for (int i = 0; i <= Red; i++) {
if (Iro.at(i) == 'W') {
... | insert | 18 | 18 | 18 | 19 | 0 | |
p02597 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
int N;
string C;
cin >> N;
cin >> C;
int ans = 0;
int m = 0, n = N - 1;
char ch = C[0];
for (int... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
int N;
string C;
cin >> N;
cin >> C;
int ans = 0;
int m = 0, n = N - 1;
char ch = C[0];
for (int... | replace | 49 | 51 | 49 | 53 | TLE | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double d;
// #define for(i,a,b) for(int i=a;i<b;i++)
// #define f(i,a,b) for(int i=a;i<=b;i++)
int main() {
int n;
string s, r;
int cnt1 = 0, cnt2 = 0;
cin >> n;
cin >> s;
r = s;
for (int i = 0, j = n - 1; j >= 0 && i <= n - 1; j-... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double d;
// #define for(i,a,b) for(int i=a;i<b;i++)
// #define f(i,a,b) for(int i=a;i<=b;i++)
int main() {
int n;
string s, r;
int cnt1 = 0, cnt2 = 0;
cin >> n;
cin >> s;
r = s;
for (int i = 0, j = n - 1; j >= 0 && i <= n - 1; j-... | replace | 31 | 32 | 31 | 32 | 0 | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i, n) for (int i = 0; i < n; i++)
#define fastio ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i, n) for (int i = 0; i < n; i++)
#define fastio ... | insert | 45 | 45 | 45 | 49 | TLE | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
int l;
int sum = 0;
cin >> N >> S;
l = N - 1;
for (int i = 0; i < N; ++i) {
if (i == l)
break;
if (S.at(i) == 'W') {
for (int j = l; j > i; --j) {
if (S.at(j) == 'R') {
swap(S.at(i), S.at(j)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
int l;
int sum = 0;
cin >> N >> S;
l = N - 1;
for (int i = 0; i < N; ++i) {
if (i == l)
break;
if (S.at(i) == 'W') {
for (int j = l; j > i; --j) {
if (S.at(j) == 'R') {
swap(S.at(i), S.at(j)... | insert | 22 | 22 | 22 | 24 | TLE | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define po pop_back
#define fi first
#define se second
#define mxn 100005
#define ll long long int
#define ldb long double
#define fr(i, a, b, k) for (int i = a; i < b; i += k)
#define frr(i, a, b, k) for (int i = a; i > b; i -= k... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define po pop_back
#define fi first
#define se second
#define mxn 100005
#define ll long long int
#define ldb long double
#define fr(i, a, b, k) for (int i = a; i < b; i += k)
#define frr(i, a, b, k) for (int i = a; i > b; i -= k... | insert | 62 | 62 | 62 | 64 | 0 | |
p02597 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
int main(int argc, char *argv[]) {
int N;
std::cin >> N;
std::vector<char> v;
char t;
for (int i = 0; i < N; i++) {
std::cin >> t;
v.push_back(t);
}
// for(int i=0; i<N; i++) {
// std::cout << v[i];
// }
int min = N + 1;
for (int b = 0; b < v.s... | #include <iostream>
#include <vector>
int main(int argc, char *argv[]) {
int N;
std::cin >> N;
std::vector<char> v;
char t;
for (int i = 0; i < N; i++) {
std::cin >> t;
v.push_back(t);
}
// for(int i=0; i<N; i++) {
// std::cout << v[i];
// }
int min = N + 1;
int p = 0, q = 0;
for... | replace | 19 | 28 | 19 | 41 | TLE | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int count = 0;
int left = 0, right = N - 1;
while (left < right) {
if (S[left] == 'W' && S[right] == 'R') {
count++;
left++;
right--;
} else if (S[left] == 'W') {
right--;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int count = 0;
int left = 0, right = N - 1;
while (left < right) {
if (S[left] == 'W' && S[right] == 'R') {
count++;
left++;
right--;
} else if (S[left] == 'W') {
right--;
}... | insert | 19 | 19 | 19 | 22 | TLE | |
p02597 | C++ | Runtime Error | // D - Alter Altar
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define LL long long
#define Lowbit(X) (X & (-X))
#define Lson (X << 1)
#define Rson (X << 1 | 1)
#define Cl(X, Y) memset((X), (Y), sizeof(X))
#define FOR(i, A, B) for (LL i = A; i <= B; i++)
#define BOR(i... | // D - Alter Altar
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define LL long long
#define Lowbit(X) (X & (-X))
#define Lson (X << 1)
#define Rson (X << 1 | 1)
#define Cl(X, Y) memset((X), (Y), sizeof(X))
#define FOR(i, A, B) for (LL i = A; i <= B; i++)
#define BOR(i... | replace | 17 | 18 | 17 | 18 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define ep emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector<ll>
#define vpll vector<pair<ll, ll>>
#define endl '\n'
#define ... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define ep emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector<ll>
#define vpll vector<pair<ll, ll>>
#define endl '\n'
#define ... | replace | 48 | 49 | 48 | 49 | 0 | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
while (cin >> n >> s) {
int ans = 0, now = 0;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == 'R') {
for (int j = now; j < i; j++) {
if (s[j] == 'W') {
now = j + 1;
ans++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
while (cin >> n >> s) {
int ans = 0, now = 0;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == 'R') {
for (int j = now; j < i; j++) {
if (s[j] == 'W') {
now = j + 1;
ans++;
... | insert | 15 | 15 | 15 | 16 | TLE | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 1, i, cou1 = 0, cou2 = 0;
char c[20010];
scanf("%d", &n);
scanf("%s", c);
for (i = 0; i < n; i++)
if (c[i] == 'R')
cou1++;
for (i = 0; i < cou1; i++)
if (c[i] == 'R')
cou2++;
printf("%d\n", cou1 - cou2);
retur... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 1, i, cou1 = 0, cou2 = 0;
char c[200010];
scanf("%d", &n);
scanf("%s", c);
for (i = 0; i < n; i++)
if (c[i] == 'R')
cou1++;
for (i = 0; i < cou1; i++)
if (c[i] == 'R')
cou2++;
printf("%d\n", cou1 - cou2);
retu... | replace | 5 | 6 | 5 | 6 | 0 | |
p02597 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include... | replace | 71 | 80 | 71 | 75 | TLE | |
p02597 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define LL long long int
#define REP(i, n) for (int i = 1; i <= (n); i++)
#define Redge(u) for (int k = h[u], to; k; k = ed[k].nxt)
#define c... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define LL long long int
#define REP(i, n) for (int i = 1; i <= (n); i++)
#define Redge(u) for (int k = h[u], to; k; k = ed[k].nxt)
#define c... | replace | 17 | 18 | 17 | 18 | 0 | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(in... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(in... | insert | 50 | 50 | 50 | 54 | TLE | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#ifdef local
template <class T> void _E(T x) { cerr << x; }
void _E(double x) { cerr << fixed << setprecision(6) << x; }
void _E(string s) { cerr << "\"" << s << "\""; }
template <class A, class B> void _E(pair<A, B> x) {
cerr << '(';
_E(x.first);
cerr << ", ";
_E(... | #include <bits/stdc++.h>
using namespace std;
#ifdef local
template <class T> void _E(T x) { cerr << x; }
void _E(double x) { cerr << fixed << setprecision(6) << x; }
void _E(string s) { cerr << "\"" << s << "\""; }
template <class A, class B> void _E(pair<A, B> x) {
cerr << '(';
_E(x.first);
cerr << ", ";
_E(... | insert | 55 | 55 | 55 | 57 | TLE | |
p02597 | C++ | Time Limit Exceeded |
#include <iostream>
#include <list>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#include <algorithm>
#include <array>
#include <cinttypes>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numer... |
#include <iostream>
#include <list>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#include <algorithm>
#include <array>
#include <cinttypes>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numer... | insert | 56 | 56 | 56 | 58 | TLE | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MAXN 1000010
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll mod = 1e9 + 7;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MAXN 1000010
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll mod = 1e9 + 7;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a =... | insert | 46 | 46 | 46 | 49 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n;
string c;
cin >> n >> c;
int ans = 0;
for (int i = 0, r = n - 1; i < n && i < r; ++i) {
if (c.at(i) == 'R')
continue;
while (r >= 0 && c.at(r) != 'R')
--r;
if (c.at(r) == 'R' &... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n;
string c;
cin >> n >> c;
int ans = 0;
for (int i = 0, r = n - 1; i < n && i < r; ++i) {
if (c.at(i) == 'R')
continue;
while (r > 0 && c.at(r) != 'R')
--r;
if (c.at(r) == 'R' &&... | replace | 12 | 13 | 12 | 13 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (l... | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (l... | replace | 47 | 48 | 47 | 48 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
long long n, a = 1, b, p, i, r = 0, w = 0, ans;
cin >> n;
string s;
for (i = 0; i < n; i++) {
cin >> s[i];
if (s[i] == 'W')
w++;
}
ans = w;
for (i = n - 1; i >= n - w; i--) {
if (s[i] == 'W')
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
long long n, a = 1, b, p, i, r = 0, w = 0, ans;
cin >> n;
char s[n];
for (i = 0; i < n; i++) {
cin >> s[i];
if (s[i] == 'W')
w++;
}
ans = w;
for (i = n - 1; i >= n - w; i--) {
if (s[i] == 'W')
... | replace | 6 | 7 | 6 | 7 | 0 | |
p02597 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
const long long MOD = 1000000000 + 7;
const double PI = acos(-1);
int main() {
int N;
cin >> N;
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
const long long MOD = 1000000000 + 7;
const double PI = acos(-1);
int main() {
int N;
cin >> N;
... | replace | 35 | 37 | 35 | 39 | TLE | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
// #define rep(i,a,b) for(int i=a;i<b;i++)
#define T \
int t; \
cin >> t; \
while (... | #include <bits/stdc++.h>
// #define rep(i,a,b) for(int i=a;i<b;i++)
#define T \
int t; \
cin >> t; \
while (... | replace | 8 | 9 | 8 | 9 | 0 | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define DEBUG 0
int main() {
int N;
cin >> N;
vector<char> c(N);
for (int i = 0; i < N; i++) {
cin >> c.at(i);
}
int counter = 0;
int reverse_count = N - 1;
for (int i = 0; i < N; i++) {
if (c.at(i) == 'W') {
for (int j = reverse_count; ... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG 0
int main() {
int N;
cin >> N;
vector<char> c(N);
for (int i = 0; i < N; i++) {
cin >> c.at(i);
}
int counter = 0;
int reverse_count = N - 1;
for (int i = 0; i < N; i++) {
if (c.at(i) == 'W') {
for (int j = reverse_count; ... | replace | 36 | 37 | 36 | 37 | TLE | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n;
string s;
cin >> n >> s;
int red = 0, white = 0;
vi count(n);
rep(i, n) {
if (s.at(i) ==... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n;
string s;
cin >> n >> s;
int red = 0, white = 0;
vi count(n);
rep(i, n) {
if (s.at(i) ==... | replace | 21 | 22 | 21 | 25 | 0 | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
char a[2000000];
int main() {
int n, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > i; j--) {
if (a[i] == 'W' && a[j] == 'R') {
a[i] = 'R';
a[j] = 'W';
ans... | #include <bits/stdc++.h>
using namespace std;
char a[2000000];
int main() {
int n, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int i = 0;
int j = n - 1;
while (i < j) {
if (a[i] == 'R')
i++;
else if (a[j] == 'W')
j--;
else {
ans++;
i++;
j--... | replace | 9 | 16 | 9 | 20 | TLE | |
p02597 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
vector<bool> flag(n);
rep(i, n) {
if (s[i] == 'R')
flag[i] = false;
if (s[i] == 'W')
flag[i] = true;
}
int ans = 0;
... | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
vector<bool> flag(n);
rep(i, n) {
if (s[i] == 'R')
flag[i] = false;
if (s[i] == 'W')
flag[i] = true;
}
int ans = 0;
... | insert | 30 | 30 | 30 | 32 | TLE | |
p02597 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
unsigned long long int n;
cin >> n;
std::string s;
cin >> s;
int cnt = std::count(s.begin()... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
unsigned long long int n;
cin >> n;
std::string s;
cin >> s;
int cnt = std::count(s.begin()... | insert | 18 | 18 | 18 | 22 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vb vector<bool>
#define pii pair<int, int>
#define mii map<int, int>
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define tr(container, it) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vb vector<bool>
#define pii pair<int, int>
#define mii map<int, int>
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define tr(container, it) ... | replace | 107 | 108 | 107 | 108 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define vv(T) vector<vector<T>>
using namespace std;
using ll = long long;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using vll = vector<long long>;
using vvll = vector<vector<long long>>;
using vbool = vector<bool>;
using vvbool =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define vv(T) vector<vector<T>>
using namespace std;
using ll = long long;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using vll = vector<long long>;
using vvll = vector<vector<long long>>;
using vbool = vector<bool>;
using vvbool =... | insert | 45 | 45 | 45 | 47 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | insert | 32 | 32 | 32 | 36 | 0 | |
p02597 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | insert | 56 | 56 | 56 | 58 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long int
using namespace std;
// Author: Ashish
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string str;
cin >> str;
vector<int> red, white;
for (int i = 0; i < n; i++) {
if (str[i] == 'R')
red.push_back(i);
els... | #include <bits/stdc++.h>
#define int long long int
using namespace std;
// Author: Ashish
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string str;
cin >> str;
vector<int> red, white;
for (int i = 0; i < n; i++) {
if (str[i] == 'R')
red.push_back(i);
els... | replace | 21 | 22 | 21 | 22 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | replace | 57 | 58 | 57 | 58 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using str = string;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
const double PI = 3.141592653589793238;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define REP(i, m, n) for (int i = m; i < (int)n; i++)
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using str = string;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
const double PI = 3.141592653589793238;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define REP(i, m, n) for (int i = m; i < (int)n; i++)
#def... | replace | 23 | 25 | 23 | 25 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int nn;
cin >> nn;
string s;
cin >> s;
vector<int> vec;
bool mrk = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'W') {
vec.push_back(i);
mrk = 1;
}
}
if (!mrk)
cout << 0 << endl;
else {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int nn;
cin >> nn;
string s;
cin >> s;
vector<int> vec;
bool mrk = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'W') {
vec.push_back(i);
mrk = 1;
}
}
if (!mrk)
cout << 0 << endl;
else {
... | insert | 25 | 25 | 25 | 27 | 0 | |
p02597 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {0, 0, 1, -1};
i... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {0, 0, 1, -1};
i... | replace | 100 | 101 | 100 | 101 | 0 | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define MOD 1e9 + 7;
using namespace std;
using ll = long long;
int main() {
int n, ans = 0;
cin >> n;
char str;
vector<int> c(n);
rep(i, n) {
cin >> str;
if (str == 'W')
c[i] = 0;
else
c[i] = 1;
}
int x... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define MOD 1e9 + 7;
using namespace std;
using ll = long long;
int main() {
int n, ans = 0;
cin >> n;
char str;
vector<int> c(n);
rep(i, n) {
cin >> str;
if (str == 'W')
c[i] = 0;
else
c[i] = 1;
}
int x... | insert | 29 | 29 | 29 | 31 | TLE | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector<pair<ll, ll>>
#define plli pair<ll, ll>
#define vps vector<pa... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector<pair<ll, ll>>
#define plli pair<ll, ll>
#define vps vector<pa... | replace | 59 | 60 | 59 | 71 | TLE | |
p02597 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007LL;
const double PI = 3.14159265358979323846;
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -21474... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007LL;
const double PI = 3.14159265358979323846;
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -21474... | replace | 32 | 42 | 32 | 35 | TLE | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) v.begin(), v.end()
int main() {
ll N;
cin >> N;
string S;
cin >> S;
ll ans = 0;
ll red = 0;
for (ll i = 0; i < N; i++) {
if (S[i] == 'W') {
for (ll j = red; j < N - i - 1; j++) {
if (S[N - 1 - j] == 'R') ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) v.begin(), v.end()
int main() {
ll N;
cin >> N;
string S;
cin >> S;
ll ans = 0;
ll red = 0;
for (ll i = 0; i < N; i++) {
if (S[i] == 'W') {
for (ll j = red; j < N - i - 1; j++) {
if (S[N - 1 - j] == 'R') ... | insert | 20 | 20 | 20 | 26 | TLE | |
p02597 | C++ | Runtime Error | // libraries
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// namespace
using namespace std;
using namespace __gnu_pbds;
// typedef
// typedef tree<long long,null_type,less<long
// long>,rb_tree_tag,tree_order_s... | // libraries
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// namespace
using namespace std;
using namespace __gnu_pbds;
// typedef
// typedef tree<long long,null_type,less<long
// long>,rb_tree_tag,tree_order_s... | replace | 75 | 77 | 75 | 76 | -11 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | insert | 83 | 83 | 83 | 88 | 0 | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(); \
cout.tie();
#define MAXX 10... | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(); \
cout.tie();
#define MAXX 10... | replace | 28 | 32 | 28 | 33 | TLE | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (ll i = 0; i < n; i++)
#define IREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < b + 1; i++)
#define all(v) v.begin(), v.end()
#define SENTINEL 2000000000
#define NIL -1
using namespace std;
typedef long long ll;
const ll M... | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (ll i = 0; i < n; i++)
#define IREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < b + 1; i++)
#define all(v) v.begin(), v.end()
#define SENTINEL 2000000000
#define NIL -1
using namespace std;
typedef long long ll;
const ll M... | insert | 79 | 79 | 79 | 82 | 0 | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define PI acos(-1)
#define INF 0x3f3f3f
#define ll long long
#define pb push_back
#define mp make_pair
#define pair pair<int, int>
#define C(a) cout << a << endl;
#define CY cout << "YES" << endl;
#define CN cout << "NO" << endl;
#define Cy cout << "Yes" << endl;
#define C... | #include <bits/stdc++.h>
using namespace std;
#define PI acos(-1)
#define INF 0x3f3f3f
#define ll long long
#define pb push_back
#define mp make_pair
#define pair pair<int, int>
#define C(a) cout << a << endl;
#define CY cout << "YES" << endl;
#define CN cout << "NO" << endl;
#define Cy cout << "Yes" << endl;
#define C... | replace | 20 | 21 | 20 | 21 | TLE | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define INF 1000000000
#define mod 1000000007
#define vi vector<int>
#define vll vector<long long>
#define ii pair<int, int>
#define vii vector<pair<int, int>>
#define ll long long
#define ld long double
#define all(x) x.begin(), x.end()
#define ff firs... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define INF 1000000000
#define mod 1000000007
#define vi vector<int>
#define vll vector<long long>
#define ii pair<int, int>
#define vii vector<pair<int, int>>
#define ll long long
#define ld long double
#define all(x) x.begin(), x.end()
#define ff firs... | replace | 105 | 115 | 105 | 108 | TLE | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int N;
string s;
cin >> N >> s;
int w = s.find_first_of("W");
int r = s.find_last_of("R");
if (r == string::npos || w == string::npos) {
cout... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int N;
string s;
cin >> N >> s;
int rcnt = count(s.cbegin(), s.cend(), 'R');
int wcnt = count(s.cbegin(), s.cbegin() + rcnt, 'W');
cout << wcnt <<... | replace | 11 | 29 | 11 | 14 | TLE | |
p02597 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define speedX \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define speedX \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | insert | 110 | 110 | 110 | 112 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
int main() {
ll n;
cin >> n;
string s;
cin >> s;
vector<ll> r, w;
for (ll i = 0; i < n; i++) {
if (s[i] == 'R')
r.push_back(i);
else
w.push_back(i);
}
ll ans = 0;
ll p = r.size() - 1;
fo... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
int main() {
ll n;
cin >> n;
string s;
cin >> s;
vector<ll> r, w;
for (ll i = 0; i < n; i++) {
if (s[i] == 'R')
r.push_back(i);
else
w.push_back(i);
}
ll ans = 0;
ll p = r.size() - 1;
fo... | replace | 19 | 20 | 19 | 20 | 0 | |
p02597 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a;
string s;
scanf("%d %s", &a, &s);
cout << count(s.begin(), s.begin() + count(s.begin(), s.end(), 'R'), 'W');
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
cout << count(s.begin(), s.begin() + count(s.begin(), s.end(), 'R'), 'W');
return 0;
}
| replace | 8 | 9 | 8 | 9 | -11 | |
p02597 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i > b; i--)
... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i > b; i--)
... | insert | 46 | 46 | 46 | 50 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
const int MAX = 2e5;
int32_t main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int n;
cin >> n;
string s;
cin >> s;
vector<int> R;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
R.emplace_back(i);
}
int cnt = 0;
for ... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
const int MAX = 2e5;
int32_t main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int n;
cin >> n;
string s;
cin >> s;
int cnt = count(s.begin(), s.end(), 'R');
int ans = 0;
for (int i = 0; i < cnt; i++)
if (s[i] == 'W')
an... | replace | 12 | 39 | 12 | 18 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (i = 0; i < n; i++)
typedef long long ll;
int i;
int main() {
ios::sync_with_stdio(false);
cin.tie();
int n;
cin >> n;
string s;
int w = 0;
for (i = 1; i <= n; i++) {
cin >> s[i];
if (s[i] == 'W')
w++;
}
int ans = w;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (i = 0; i < n; i++)
typedef long long ll;
int i;
int main() {
ios::sync_with_stdio(false);
cin.tie();
int n;
cin >> n;
char s[n];
int w = 0;
for (i = 1; i <= n; i++) {
cin >> s[i];
if (s[i] == 'W')
w++;
}
int ans = w;
... | replace | 12 | 13 | 12 | 13 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
// g++ -std=c++17 -Wshadow -Wall -g -fsanitize=address -fsanitize=undefined
// -D_GLIBCXX_DEBUG -o
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> v;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
// g++ -std=c++17 -Wshadow -Wall -g -fsanitize=address -fsanitize=undefined
// -D_GLIBCXX_DEBUG -o
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> v;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')... | replace | 22 | 23 | 22 | 23 | 0 | |
p02597 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
#define speedio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
void __print... |
#include <bits/stdc++.h>
using namespace std;
#define speedio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
void __print... | insert | 110 | 110 | 110 | 114 | 0 | |
p02597 | C++ | Runtime Error | #include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<char> c(N);
int n_red = 0;
for (auto &&e : c) {
std::cin >> e;
if (e == 'R')
n_red++;
}
int r_diff = 0;
for (int i = 0; i < n_red; i++) {
if (c[i] == 'W')
r_diff++;
}
int w_diff = 0;
for (... | #include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<char> c(N);
int n_red = 0;
for (auto &&e : c) {
std::cin >> e;
if (e == 'R')
n_red++;
}
int r_diff = 0;
for (int i = 0; i < n_red; i++) {
if (c[i] == 'W')
r_diff++;
}
int w_diff = 0;
for (... | replace | 20 | 21 | 20 | 21 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
priority_queue<int> red;
priority_queue<int, vector<int>, greater<int>> white;
for (int i = 0; i < N; i++) {
if (S[i] == 'R') {
red.push(i);
} else {
whi... | #include <bits/stdc++.h>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
priority_queue<int> red;
priority_queue<int, vector<int>, greater<int>> white;
for (int i = 0; i < N; i++) {
if (S[i] == 'R') {
red.push(i);
} else {
whi... | insert | 25 | 25 | 25 | 30 | 0 | |
p02597 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int func(int n, int c[], int r_num) {
int re = 0;
for (int i = 0; i < r_num; i++) {
if (c[i] != 1)
re++;
}
return re;
}
int main(void) {
int n;
cin >> n;
int c[n];
int r_num = 0;
char color;
for (int i = 0; i < n; i++) {
cin >> color;
... | #include <bits/stdc++.h>
using namespace std;
int func(int n, int c[], int r_num) {
int re = 0;
for (int i = 0; i < r_num; i++) {
if (c[i] != 1)
re++;
}
return re;
}
int main(void) {
int n;
cin >> n;
int c[n];
int r_num = 0;
char color;
for (int i = 0; i < n; i++) {
cin >> color;
... | replace | 27 | 31 | 27 | 28 | TLE | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define fr(i, n) for (i = 0; i < n; i++)
#define F first
#define S second
#define fast std::ios_base::sync_with_stdio(false)
#define mod 1000000007
#define pi 3.14159265
int main() {
fas... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define fr(i, n) for (i = 0; i < n; i++)
#define F first
#define S second
#define fast std::ios_base::sync_with_stdio(false)
#define mod 1000000007
#define pi 3.14159265
int main() {
fas... | insert | 25 | 25 | 25 | 29 | 0 | |
p02597 | C++ | Runtime Error | #pragma warning(disable : 4996)
#include <algorithm>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, rtow = 0, wtor = 0;
... | #pragma warning(disable : 4996)
#include <algorithm>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, rtow = 0, wtor = 0;
... | insert | 18 | 18 | 18 | 19 | 0 | |
p02597 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
std::string S;
cin >> S;
long long ans = 0;
long long J = 0;
for (long long i = 0; i < N; ++i) {
if (S[i] == 'W') {
for (long long j = J; j <... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
std::string S;
cin >> S;
long long ans = 0;
long long J = 0;
for (long long i = 0; i < N; ++i) {
if (S[i] == 'W') {
for (long long j = J; j <... | insert | 19 | 19 | 19 | 20 | TLE | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
queue<int> ind;
int c = 0;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == 'R')
ind.push(i);
}
for (int i = 0; i < n; i++) {
if (s[i] == 'W' && i < ind.front()) {
int x = ind.front();
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
queue<int> ind;
int c = 0;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == 'R')
ind.push(i);
}
for (int i = 0; i < n; i++) {
if (s[i] == 'W' && !ind.empty() && i < ind.front()) {
int x = ... | replace | 14 | 15 | 14 | 15 | 0 | |
p02597 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ii pair<int, int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ii pair<int, int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f... | replace | 43 | 44 | 43 | 44 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.