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", ans);
break;
}
ans++;
n = n * 10 + 7;
n %= k;
}
return 0;
}
| #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", ans);
break;
}
ans++;
n = n * 10 + 7;
n %= k;
}
return 0;
}
| 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 {
A *= 10;
A %= K;
}
}
cout << ans << endl;
return 0;
} | #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;
} else {
A *= 10;
A %= K;
}
}
cout << ans << endl;
return 0;
} | 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 * sum + 7;
count++;
sum %= k;
if (!sum) {
cout << count << "\n";
break;
}
}
}
return 0;
}
| #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 > k) {
cout << "-1\n";
break;
}
sum = 10 * sum + 7;
count++;
sum %= k;
if (!sum) {
cout << count << "\n";
break;
}
}
}
return 0;
}
| 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 = max(x, y); }
#define chmin(x, y) \
{ x = min(x, y); }
#define INF 1e10
vector<int> a(INF);
int main() {
int k;
cin >> k;
a.at(0) = 7 % k;
mrep(i, 1, k) { a.at(i) = (a.at(i - 1) * 10 + 7) % k; }
rep(i, k) {
if (a.at(i) == 0) {
cout << i + 1 << endl;
return 0;
}
}
cout << -1 << endl;
/*while(true){
if(k % 2 == 0 || k % 5 == 0){
ans = -1;
break;
}
if(seven % k == 0){
break;
}
seven = seven * 10 + 7;
ans++;
}*/
} | #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 = max(x, y); }
#define chmin(x, y) \
{ x = min(x, y); }
#define INF 1e7
vector<int> a(INF);
int main() {
int k;
cin >> k;
a.at(0) = 7 % k;
mrep(i, 1, k) { a.at(i) = (a.at(i - 1) * 10 + 7) % k; }
rep(i, k) {
if (a.at(i) == 0) {
cout << i + 1 << endl;
return 0;
}
}
cout << -1 << endl;
/*while(true){
if(k % 2 == 0 || k % 5 == 0){
ans = -1;
break;
}
if(seven % k == 0){
break;
}
seven = seven * 10 + 7;
ans++;
}*/
} | 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;
return 0;
} | #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;
return 0;
}
| 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;
if (K % 2 == 0) {
cout << -1;
return 0;
}
int num = 0;
int k = 1;
int count = 0;
while (true) {
++count;
num += 7 * k;
num %= K;
if (num == 0)
break;
k *= 10;
k %= K;
}
cout << count;
} | #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;
if (K % 2 == 0 || K % 5 == 0) {
cout << -1;
return 0;
}
int num = 0;
int k = 1;
int count = 0;
while (true) {
++count;
num += 7 * k;
num %= K;
if (num == 0)
break;
k *= 10;
k %= K;
}
cout << count;
} | 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++) {
ten[i] = (ten[i - 1] * 10) % K;
}
ll now = 0;
ll ans = 0;
while (0 == 0) {
now += ten[ans];
now %= K;
ans++;
if (now == 0) {
cout << ans << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
} | #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++) {
ten[i] = (ten[i - 1] * 10) % K;
}
ll now = 0;
ll ans = 0;
for (ans = 0; ans < 3000000;) {
now += ten[ans];
now %= K;
ans++;
if (now == 0) {
cout << ans << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
} | 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 <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline long long toint(string s) {
long long v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef long long ll;
typedef long long LL;
typedef vector<int> vi;
typedef vector<long long> VLL;
typedef vector<long long> vll;
typedef vector<string> ves;
typedef vector<char> vech;
typedef pair<long long, long long> pll;
typedef pair<long long, long long> PLL;
typedef map<ll, ll> mll;
typedef map<int, int> mii;
typedef map<char, int> mci;
typedef map<char, ll> mcl;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define VECMAX(x) *max_element(ALL(x))
#define VECMIN(x) *min_element(ALL(x))
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// #define MULTIPLE(i,n,k) for(int i = (k) ; i<(n) ; i+=k+1)//倍数ループ
// constant
//------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
#define SIZEOF(x) sizeof(x) / sizeof(x[0])
const long long INF = 100000000000000;
const long long NINF = -100000000000000;
#define CIN(a) REP(i, a.size()) cin >> a[i];
//-------------------------------------------------------------
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
ll nCr(ll n, ll r) {
if (n == 0) {
return 0;
}
if (r == 0) {
return 1;
}
if (r == 1) {
return n;
}
if (n == r) {
return 1;
}
if (r > n / 2) {
r = n / 2;
}
ll result = 1;
for (ll i = 1; i <= r; i++) {
result *= (n - i + 1) / i;
}
return (result);
}
// firstが最大値（最小値） , second が index
pair<LL, LL> maxP(vll a, ll size) {
pair<ll, ll> p;
vll::iterator iter = max_element(a.begin(), a.end());
p.first = *iter;
p.second = distance(a.begin(), iter);
return p;
}
pair<LL, LL> minP(vll a, ll size) {
pair<ll, ll> p;
vll::iterator iter = min_element(a.begin(), a.end());
p.first = *iter;
p.second = distance(a.begin(), iter);
return p;
}
ll sumL(vll a, ll size) {
ll sum = 0;
REP(i, size) { sum += a[i]; }
return sum;
}
// aのなかにtがいくつあるか
ll counT(VLL a, ll t) {
sort(a.begin(), a.end());
return upper_bound(a.begin(), a.end(), t) -
lower_bound(a.begin(), a.end(), t);
}
#define COUNT(a, b) counT((a), (b))
#define MAX(x) maxP(x, x.size())
#define MIN(x) minP(x, x.size())
#define SUM(x) sumL(x, x.size())
//-------------------DIVIDE----------------------
// DIV[i][j] は i の j分割数 j == 0 && i != 0 なら 0
// 並び順を区別しない
ll DIV[1000 + 1][1000 + 1];
void divide(ll n, ll m) {
DIV[0][0] = 1;
FOR(i, 1, n + 1) { DIV[i][0] = 0; }
REP(i, n + 1) { DIV[i][1] = 1; }
FOR(i, 1, m + 1) {
FOR(t, 0, n + 1) {
if (DIV[t][i] > 0)
continue;
if (t >= i) {
DIV[t][i] = DIV[t - i][i] + DIV[t][i - 1];
} else {
DIV[t][i] = DIV[t][i - 1];
}
}
}
}
#define DIVIDE(a, b) (DIV[a][b] - DIV[a][(b)-1]) // DIV[a-b][b]と同じ
//-------要素を見つける-----------
ll search(vll &a, ll n) { // a内のnのindexを返す
std::vector<ll>::iterator iter = std::find(a.begin(), a.end(), n);
size_t index = distance(a.begin(), iter);
return index;
}
//------------素数判定-----------------
//------------素数判定-----------------
class Judge {
public:
vector<bool> IS_PRIME_CONTAINER;
Judge(int max_) : IS_PRIME_CONTAINER(max_, true) { max = max_; }
int max; // この値-1まで素数判定する
// メモリを圧迫する可能性あり
void IsPrime_init() {
IS_PRIME_CONTAINER[0] = false;
IS_PRIME_CONTAINER[1] = false;
FOR(i, 2, sqrt(max) + 1) {
if (IS_PRIME_CONTAINER[i]) {
FOR(j, 2, (max) / i + 1) {
if (j * i <= max) {
IS_PRIME_CONTAINER[i * j] = false;
}
}
}
}
}
inline bool IsPrime(ll num) { return IS_PRIME_CONTAINER[num]; }
};
//---------ベルマンフォード----------
// 頂点の値はindexとする
class Bellman {
public:
vll DIST;
// max は 頂点の数
Bellman(int max_) : DIST(max_, INF) { max = max_; }
~Bellman() { std::vector<ll>().swap(DIST); }
int max;
// int m;//辺の数
struct E {
// classの外で構造体Eを宣言するときは Bellman::E と宣言する
// from から toは一方通行であることに注意
ll from, to, cost;
};
// はじめに必ず初期化
void init() {
REP(i, max) { DIST[i] = INF; }
}
// startはindex(0から)
// start と 辺の数 m 辺の情報 x を入力
// 頂点a,bが両方向に繋がってるなら、
// vector<Bellman::E>には(a,b,c)と(b,a,c)の両方を入れないといけない
void shortest(LL s, vector<E> &x) {
REP(i, 100000) { DIST[i] = INF; }
DIST[s] = 0;
while (1) {
bool t = false;
REP(i, x.size()) {
E h = x[i];
if (DIST[h.from] != INF && DIST[h.to] > DIST[h.from] + h.cost) {
DIST[h.to] = DIST[h.from] + h.cost;
t = true;
}
}
if (!t) {
break;
}
}
}
};
//----------ダイクストラ------------
class dijkstra {
// 頂点の値はindexとする
public:
int V; // Vは頂点の個数
struct edge {
int to;
int cost;
};
public:
// G[i]には頂点iから出る辺の情報が入ってる
vll dist; // 最短距離をまとめたvector
// 全ての辺からの距離を求めたい場合は、
//
/*
vector<vector<int> >vecを用意
↓ ↓ ↓
REP(i,V_){
DIJKSTRA.shortest(i);
vec.push_back(DIJKSTRA.dist);
}
DIJKSTRA.init();
これはO(N*N*log2(N))
*/
vector<vector<edge>> G;
// 頂点a,bが両方向に繋がってるなら、
// Gには(a,b)と(b,a)の場合の両方を入れないといけない
/*
REP(i ,G.size()){
while(頂点iに繋がってる辺の個数){
G[i].push_back(辺の情報edge);
}
}
*/
dijkstra(ll V_) : G(V_ * V_) {
REP(i, V_) { dist.push_back(INF); }
V = V_;
}
~dijkstra() {
std::vector<ll>().swap(dist);
vector<std::vector<edge>>().swap(G);
}
void init() { REP(i, dist.size()) dist[i] = INF; }
void shortest(int s) {
priority_queue<pll, vector<pll>, greater<pll>> que;
dist[s] = 0;
que.push(pll(0, s));
while (!que.empty()) {
pll p = que.top();
que.pop();
int v = p.second;
if (dist[v] < p.first)
continue;
for (int i = 0; i < G[v].size(); ++i) {
edge e = G[v][i];
if (dist[e.to] > dist[v] + e.cost) {
dist[e.to] = dist[v] + e.cost;
que.push(pll(dist[e.to], e.to));
}
}
}
}
};
//----UnionFind-----
class UnionFind {
public:
vll par;
vll rank; // rankが高いほど上の親である
UnionFind(LL N) : par(N), rank(N) {
REP(i, N) par[i] = i;
REP(i, N) rank[i] = 0;
}
~UnionFind() {}
LL root(LL x) {
if (par[x] == x)
return x; // ここが親
else {
par[x] = root(par[x]); // 親を再起的に見つける
return par[x];
}
}
void unite(LL x, LL y) {
LL rx = root(x);
LL ry = root(y);
if (rx == ry)
return;
if (rank[rx] < rank[ry]) {
// 親をくっつけて同じグループにする
par[rx] = ry; // rankの高い方を親にする(この場合、rxの親がry)
} else {
par[ry] = rx; // ryの親をrxにした
if (rank[rx] == rank[ry]) {
// rankがどちらも同じ時、親にした方のrankを1上げる
rank[rx]++;
}
}
}
bool same(LL x, LL y) {
LL rx = root(x);
LL ry = root(y);
return rx == ry;
}
};
//--------BFS---------
class BFS {
public:
BFS(vector<vector<char>> field_, ll h_, ll w_) {
field = field_;
h = h_;
w = w_;
initial_number = INF;
REP(i, h) { dist.push_back(vector<LL>(w, initial_number)); }
}
~BFS() {
std::vector<std::vector<ll>>().swap(dist);
std::vector<std::vector<char>>().swap(field);
}
vector<vector<char>> field;
ll h;
ll w;
ll initial_number; // 初期化用数値
vector<vector<LL>> dist; // この変数に書き込む
pair<LL, LL> plus(pair<LL, LL> &a, pair<LL, LL> &b) {
pair<LL, LL> p;
p.first = a.first + b.first;
p.second = a.second + b.second;
return p;
}
bool equal(pair<LL, LL> &a, pair<LL, LL> &b) {
return (a.first == b.first && a.second == b.second);
}
bool is_in_field(int h, int w, const pair<LL, LL> &point) {
const int c = point.second;
const int r = point.first;
return (0 <= c && c < w) && (0 <= r && r < h);
}
// fieldの中身を初期化
// 最短距離がh*w*2になることはないのでこれで初期化する
void init() {
REP(i, dist.size()) {
REP(t, dist[i].size()) { dist[i][t] = initial_number; }
}
}
// sy , sx はスタート位置の 『INDEX』!!
// syが縦 sx が横
// .を道、#を障害物とする
void shortest(ll sy, ll sx) {
// 初期化
init();
pair<LL, LL> c[4];
c[0].first = 0;
c[0].second = 1;
c[1].first = 0;
c[1].second = -1;
c[2].first = 1;
c[2].second = 0;
c[3].first = -1;
c[3].second = 0;
queue<pair<LL, LL>> Q;
pair<LL, LL> s;
s.first = sy;
s.second = sx;
dist[sy][sx] = 0; // スタート位置のみ0で初期化
Q.push(s);
while (Q.empty() == false) {
pair<LL, LL> now = Q.front();
Q.pop();
for (int u = 0; u < 4; u++) {
pair<LL, LL> x = c[u];
pair<LL, LL> next = plus(now, x);
if (is_in_field(h, w, next)) {
if (field[next.first][next.second] == '.') {
// まだ到達してない ＝＝ distの値が initial_number
if (dist[next.first][next.second] == initial_number) {
dist[next.first][next.second] = dist[now.first][now.second] + 1;
Q.push(next);
} else {
// すでに到達済みである＝＝これ以前にQueueから出てきたpairがすでに
// 到達している＝＝すでにdistの値が最小値である;
}
}
}
}
}
}
};
//-----------動的計画法---------------//
// b < a => true , a = b;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// b > a => true , a = b;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
//-----------２つの順番を考慮しないintをもつ型-------------
// unorder <typename> instance(para , para2);
template <class T> class unorder {
public:
T a, b;
unorder(T a_, T b_) {
(a = a_);
(b = b_);
}
~unorder() {}
public:
bool operator==(unorder y) {
return (this->a + this->b == y.a + y.b && this->a * this->b == y.a * y.b);
}
bool operator!=(unorder y) {
return (this->a + this->b != y.a + y.b || this->a * this->b != y.a * y.b);
}
void operator=(pair<T, T> p) {
this->a = p.first;
this->b = p.second;
}
};
//-------素因数分解---------------
vector<pair<ll, ll>> PrimeFactors(ll n) {
std::map<ll, ll> out;
vector<pair<ll, ll>> answer;
while (n % 2 == 0) {
++out[2];
n = n / 2;
}
if (out[2])
answer.push_back(make_pair(2, out[2]));
for (ll i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) {
++out[i];
n = n / i;
}
if (out[i])
answer.push_back(make_pair(i, out[i]));
}
if (n > 2)
++out[n];
if (out[n])
answer.push_back(make_pair(n, out[n]));
return answer;
}
void StringSort(vector<string> &S) {
map<int, int> SwapInd;
int maxi = 0; // Sに含まれる文字列の最大文字列長
for (int i = 0; i < S.size(); i++) {
if (S[i].size() > maxi)
maxi = S[i].size();
}
for (int i = 0; i < maxi; i++) { // ここが右端の文字から左の文字へのループ
int k =
maxi -
i; // 今考えている文字が左から何文字目かを表す(indexではないので-1することに注意)
int sort_num = 0; // 文字列長がk+1以上ある要素の個数
// ソートしたい文字列の個数と言い換えられる
for (int j = 0; j < S.size(); j++) {
if (S[j].size() >= k) { // S[j]にk+1文字目が存在すればSwapInd[j]に記録
SwapInd[j] = 1;
sort_num++; // インクリメント
}
}
int swapped = 0; // Sの右側グループの左端indexを0としたきのindex
// ここからグループ分けをします
for (int j = 0; j < S.size(); j++) {
// ここで、S.size() - sort_num は右側と左側の境界である
if (SwapInd[j] == 1 && j < S.size() - sort_num) {
// j番目の文字列がソート対象（文字列長k以上）
// かつ、S[j]が右側グループに入っていない
if (SwapInd[S.size() - sort_num + swapped] == 0) {
// 右側グループの左からswapped番目の文字列がソート対象でない場合
iter_swap(S.begin() + j, S.begin() + S.size() - sort_num + swapped);
// 入れ替える
} else {
// 右側グループの左からswapped番目の文字列がソート対象である場合
// 右側グループの左からswapped番目の文字列がソート対象でなくなるまで
// swappedをインクリメントする
while (SwapInd[S.size() - sort_num + swapped] != 0) {
swapped++;
if (S.size() - sort_num + swapped >= S.size()) {
break; // out of index
}
if (S.size() - sort_num + swapped < S.size()) {
iter_swap(S.begin() + j,
S.begin() + S.size() - sort_num + swapped);
}
}
}
SwapInd[j] = 0; // 更新
SwapInd[S.size() - sort_num + swapped] = 0; // 更新
swapped++; // 左右境界から何番目に要素を追加するかを表す
} // Sのグループ分け完了
}
vector<string> WhatSorted(sort_num);
vector<pair<int, int>> char_and_index(sort_num);
// sortする文字とそのindex,
for (int j = 0; j < sort_num; j++) {
if (S[S.size() - sort_num + j][k - 1] >= 65 &&
S[S.size() - sort_num + j][k - 1] <= 90) {
char_and_index[j].first = (int)S[S.size() - sort_num + j][k - 1] + 32;
} else {
char_and_index[j].first = (int)S[S.size() - sort_num + j][k - 1];
}
char_and_index[j].second = j;
WhatSorted[j] = S[S.size() - sort_num + j]; // 境界からj番目の文字列
}
sort(char_and_index.begin(), char_and_index.end());
for (int j = 0; j < sort_num; j++) {
S[S.size() - sort_num + j] = WhatSorted[char_and_index[j].second];
}
}
}
//-----------MODつきCombination------------//
class ModComb {
public:
vll fac;
vll finv;
vll inv;
ModComb(ll MAX_, ll MOD_) : fac(MAX_), finv(MAX_), inv(MAX_) {
MAX = MAX_;
MOD = MOD_;
}
~ModComb() {
std::vector<ll>().swap(fac);
std::vector<ll>().swap(finv);
std::vector<ll>().swap(inv);
}
int MAX;
int MOD;
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
};
//-------------bit全探索---------------
// aは空の二重配列
// aに格納する
// a[i]には小さい方からi個目のn桁のbinaryで1が現れる桁の情報が入っている
// a[i][j]はa[i]のbitが1になる桁を表す。
// a[i]の値はpow(2,0)<=pow(2,k)<=pow(2,n-1)となるkが昇順で入っている
void BIT(vector<vll> &a, ll n) {
for (ll bit = 0; bit < (1 << n); bit++) {
vll P;
a.push_back(P);
for (ll i = 0; i < n; i++) {
if (bit & (1 << i)) {
a[bit].push_back(i);
}
}
}
}
// 桁数
int getdigit(ll n) { return log10(n) + 1; }
ll keta(ll n, ll k) {
if (k > getdigit(n)) {
return -1;
} else if (k == 1) {
return n % 10;
} else {
ll p = 1;
REP(i, k) p *= 10;
return (n % p) / (p / 10);
}
}
ll kiriage(ll a, ll b) { return a / b + (a % b == 0); }
template <class T> // Tはvector or string
pair<vector<ll>, T> seqence(T x) { // xの連続してる部分をvectorにまとめる
// firstが連続する個数、secondが値
pair<vll, T> s;
bool flag = 0; // 今連続しているかどうか
ll now;
ll seq = 1;
ll next;
REP(i, x.size()) {
if (i + 1 >= x.size()) { // 次の数が範囲外になるとき
now = x[i];
s.first.push_back(seq);
s.second.push_back(now);
break;
} else {
now = x[i];
next = x[i + 1];
if (flag) {
if (now == next) {
seq++;
} else {
s.first.push_back(seq);
s.second.push_back(now);
seq = 1;
flag = 0;
}
} else {
if (now == next) {
seq++;
flag = 1;
} else {
s.first.push_back(seq);
s.second.push_back(now);
seq = 1;
}
}
}
}
return s;
}
// パスカルの三角形
vector<vector<ll>> pascal(66); // 65段までならいける
vll getpascal(ll n) {
if (pascal[n].size() > 0)
return pascal[n];
vll e;
if (n == 0) {
e.push_back(1);
} else {
e.push_back(1);
vll ajj = getpascal(n - 1);
REP(i, ajj.size() - 1) { e.push_back(ajj[i] + ajj[i + 1]); }
e.push_back(1);
}
return pascal[n] = e;
}
void pascal_calc(ll n) { pascal[n] = getpascal(n); }
// すぐにオーバーフローするから使わない方がいいシグマ計算
vector<vector<long long>> Sigma(11, vll(1000005));
// sigma(a,n) := (k^a)の和(0->n)
long long sigmaCalc(ll a, ll n) {
if (Sigma[a][n] != 0) {
return Sigma[a][n];
}
pascal_calc(a + 1);
ll ans = 0;
if (a == 0) {
ans = n;
} else {
ll coefficient = pascal[a + 1][1];
ans += pow(n + 1, a + 1) - 1;
REP(i, a) { ans -= sigmaCalc(a - 1 - i, n) * pascal[a + 1][2 + i]; }
ans /= coefficient;
}
return Sigma[a][n] = ans;
}
//-----------MAIN------------//
// 注意::::DPの配列、vectorはグローバル変数を使え！！そして引数として与えるな！！
// Sqrは２乗 sqrtはルート
//
int main() {
LL n, m, k, A, B;
string s;
map<ll, ll> p;
vector<pll> Pairs;
pll Ap;
cin >> k;
ll ind = 1;
n = 7;
n %= k;
ll ch = INF;
ll mnow = n % k;
while (1) {
if (n % k == 0) {
break;
} else {
mnow = ((mnow)*10) % k;
n += mnow;
ind++;
}
}
cout << ind;
return 0;
}
| // 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 <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline long long toint(string s) {
long long v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef long long ll;
typedef long long LL;
typedef vector<int> vi;
typedef vector<long long> VLL;
typedef vector<long long> vll;
typedef vector<string> ves;
typedef vector<char> vech;
typedef pair<long long, long long> pll;
typedef pair<long long, long long> PLL;
typedef map<ll, ll> mll;
typedef map<int, int> mii;
typedef map<char, int> mci;
typedef map<char, ll> mcl;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define VECMAX(x) *max_element(ALL(x))
#define VECMIN(x) *min_element(ALL(x))
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// #define MULTIPLE(i,n,k) for(int i = (k) ; i<(n) ; i+=k+1)//倍数ループ
// constant
//------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
#define SIZEOF(x) sizeof(x) / sizeof(x[0])
const long long INF = 100000000000000;
const long long NINF = -100000000000000;
#define CIN(a) REP(i, a.size()) cin >> a[i];
//-------------------------------------------------------------
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
ll nCr(ll n, ll r) {
if (n == 0) {
return 0;
}
if (r == 0) {
return 1;
}
if (r == 1) {
return n;
}
if (n == r) {
return 1;
}
if (r > n / 2) {
r = n / 2;
}
ll result = 1;
for (ll i = 1; i <= r; i++) {
result *= (n - i + 1) / i;
}
return (result);
}
// firstが最大値（最小値） , second が index
pair<LL, LL> maxP(vll a, ll size) {
pair<ll, ll> p;
vll::iterator iter = max_element(a.begin(), a.end());
p.first = *iter;
p.second = distance(a.begin(), iter);
return p;
}
pair<LL, LL> minP(vll a, ll size) {
pair<ll, ll> p;
vll::iterator iter = min_element(a.begin(), a.end());
p.first = *iter;
p.second = distance(a.begin(), iter);
return p;
}
ll sumL(vll a, ll size) {
ll sum = 0;
REP(i, size) { sum += a[i]; }
return sum;
}
// aのなかにtがいくつあるか
ll counT(VLL a, ll t) {
sort(a.begin(), a.end());
return upper_bound(a.begin(), a.end(), t) -
lower_bound(a.begin(), a.end(), t);
}
#define COUNT(a, b) counT((a), (b))
#define MAX(x) maxP(x, x.size())
#define MIN(x) minP(x, x.size())
#define SUM(x) sumL(x, x.size())
//-------------------DIVIDE----------------------
// DIV[i][j] は i の j分割数 j == 0 && i != 0 なら 0
// 並び順を区別しない
ll DIV[1000 + 1][1000 + 1];
void divide(ll n, ll m) {
DIV[0][0] = 1;
FOR(i, 1, n + 1) { DIV[i][0] = 0; }
REP(i, n + 1) { DIV[i][1] = 1; }
FOR(i, 1, m + 1) {
FOR(t, 0, n + 1) {
if (DIV[t][i] > 0)
continue;
if (t >= i) {
DIV[t][i] = DIV[t - i][i] + DIV[t][i - 1];
} else {
DIV[t][i] = DIV[t][i - 1];
}
}
}
}
#define DIVIDE(a, b) (DIV[a][b] - DIV[a][(b)-1]) // DIV[a-b][b]と同じ
//-------要素を見つける-----------
ll search(vll &a, ll n) { // a内のnのindexを返す
std::vector<ll>::iterator iter = std::find(a.begin(), a.end(), n);
size_t index = distance(a.begin(), iter);
return index;
}
//------------素数判定-----------------
//------------素数判定-----------------
class Judge {
public:
vector<bool> IS_PRIME_CONTAINER;
Judge(int max_) : IS_PRIME_CONTAINER(max_, true) { max = max_; }
int max; // この値-1まで素数判定する
// メモリを圧迫する可能性あり
void IsPrime_init() {
IS_PRIME_CONTAINER[0] = false;
IS_PRIME_CONTAINER[1] = false;
FOR(i, 2, sqrt(max) + 1) {
if (IS_PRIME_CONTAINER[i]) {
FOR(j, 2, (max) / i + 1) {
if (j * i <= max) {
IS_PRIME_CONTAINER[i * j] = false;
}
}
}
}
}
inline bool IsPrime(ll num) { return IS_PRIME_CONTAINER[num]; }
};
//---------ベルマンフォード----------
// 頂点の値はindexとする
class Bellman {
public:
vll DIST;
// max は 頂点の数
Bellman(int max_) : DIST(max_, INF) { max = max_; }
~Bellman() { std::vector<ll>().swap(DIST); }
int max;
// int m;//辺の数
struct E {
// classの外で構造体Eを宣言するときは Bellman::E と宣言する
// from から toは一方通行であることに注意
ll from, to, cost;
};
// はじめに必ず初期化
void init() {
REP(i, max) { DIST[i] = INF; }
}
// startはindex(0から)
// start と 辺の数 m 辺の情報 x を入力
// 頂点a,bが両方向に繋がってるなら、
// vector<Bellman::E>には(a,b,c)と(b,a,c)の両方を入れないといけない
void shortest(LL s, vector<E> &x) {
REP(i, 100000) { DIST[i] = INF; }
DIST[s] = 0;
while (1) {
bool t = false;
REP(i, x.size()) {
E h = x[i];
if (DIST[h.from] != INF && DIST[h.to] > DIST[h.from] + h.cost) {
DIST[h.to] = DIST[h.from] + h.cost;
t = true;
}
}
if (!t) {
break;
}
}
}
};
//----------ダイクストラ------------
class dijkstra {
// 頂点の値はindexとする
public:
int V; // Vは頂点の個数
struct edge {
int to;
int cost;
};
public:
// G[i]には頂点iから出る辺の情報が入ってる
vll dist; // 最短距離をまとめたvector
// 全ての辺からの距離を求めたい場合は、
//
/*
vector<vector<int> >vecを用意
↓ ↓ ↓
REP(i,V_){
DIJKSTRA.shortest(i);
vec.push_back(DIJKSTRA.dist);
}
DIJKSTRA.init();
これはO(N*N*log2(N))
*/
vector<vector<edge>> G;
// 頂点a,bが両方向に繋がってるなら、
// Gには(a,b)と(b,a)の場合の両方を入れないといけない
/*
REP(i ,G.size()){
while(頂点iに繋がってる辺の個数){
G[i].push_back(辺の情報edge);
}
}
*/
dijkstra(ll V_) : G(V_ * V_) {
REP(i, V_) { dist.push_back(INF); }
V = V_;
}
~dijkstra() {
std::vector<ll>().swap(dist);
vector<std::vector<edge>>().swap(G);
}
void init() { REP(i, dist.size()) dist[i] = INF; }
void shortest(int s) {
priority_queue<pll, vector<pll>, greater<pll>> que;
dist[s] = 0;
que.push(pll(0, s));
while (!que.empty()) {
pll p = que.top();
que.pop();
int v = p.second;
if (dist[v] < p.first)
continue;
for (int i = 0; i < G[v].size(); ++i) {
edge e = G[v][i];
if (dist[e.to] > dist[v] + e.cost) {
dist[e.to] = dist[v] + e.cost;
que.push(pll(dist[e.to], e.to));
}
}
}
}
};
//----UnionFind-----
class UnionFind {
public:
vll par;
vll rank; // rankが高いほど上の親である
UnionFind(LL N) : par(N), rank(N) {
REP(i, N) par[i] = i;
REP(i, N) rank[i] = 0;
}
~UnionFind() {}
LL root(LL x) {
if (par[x] == x)
return x; // ここが親
else {
par[x] = root(par[x]); // 親を再起的に見つける
return par[x];
}
}
void unite(LL x, LL y) {
LL rx = root(x);
LL ry = root(y);
if (rx == ry)
return;
if (rank[rx] < rank[ry]) {
// 親をくっつけて同じグループにする
par[rx] = ry; // rankの高い方を親にする(この場合、rxの親がry)
} else {
par[ry] = rx; // ryの親をrxにした
if (rank[rx] == rank[ry]) {
// rankがどちらも同じ時、親にした方のrankを1上げる
rank[rx]++;
}
}
}
bool same(LL x, LL y) {
LL rx = root(x);
LL ry = root(y);
return rx == ry;
}
};
//--------BFS---------
class BFS {
public:
BFS(vector<vector<char>> field_, ll h_, ll w_) {
field = field_;
h = h_;
w = w_;
initial_number = INF;
REP(i, h) { dist.push_back(vector<LL>(w, initial_number)); }
}
~BFS() {
std::vector<std::vector<ll>>().swap(dist);
std::vector<std::vector<char>>().swap(field);
}
vector<vector<char>> field;
ll h;
ll w;
ll initial_number; // 初期化用数値
vector<vector<LL>> dist; // この変数に書き込む
pair<LL, LL> plus(pair<LL, LL> &a, pair<LL, LL> &b) {
pair<LL, LL> p;
p.first = a.first + b.first;
p.second = a.second + b.second;
return p;
}
bool equal(pair<LL, LL> &a, pair<LL, LL> &b) {
return (a.first == b.first && a.second == b.second);
}
bool is_in_field(int h, int w, const pair<LL, LL> &point) {
const int c = point.second;
const int r = point.first;
return (0 <= c && c < w) && (0 <= r && r < h);
}
// fieldの中身を初期化
// 最短距離がh*w*2になることはないのでこれで初期化する
void init() {
REP(i, dist.size()) {
REP(t, dist[i].size()) { dist[i][t] = initial_number; }
}
}
// sy , sx はスタート位置の 『INDEX』!!
// syが縦 sx が横
// .を道、#を障害物とする
void shortest(ll sy, ll sx) {
// 初期化
init();
pair<LL, LL> c[4];
c[0].first = 0;
c[0].second = 1;
c[1].first = 0;
c[1].second = -1;
c[2].first = 1;
c[2].second = 0;
c[3].first = -1;
c[3].second = 0;
queue<pair<LL, LL>> Q;
pair<LL, LL> s;
s.first = sy;
s.second = sx;
dist[sy][sx] = 0; // スタート位置のみ0で初期化
Q.push(s);
while (Q.empty() == false) {
pair<LL, LL> now = Q.front();
Q.pop();
for (int u = 0; u < 4; u++) {
pair<LL, LL> x = c[u];
pair<LL, LL> next = plus(now, x);
if (is_in_field(h, w, next)) {
if (field[next.first][next.second] == '.') {
// まだ到達してない ＝＝ distの値が initial_number
if (dist[next.first][next.second] == initial_number) {
dist[next.first][next.second] = dist[now.first][now.second] + 1;
Q.push(next);
} else {
// すでに到達済みである＝＝これ以前にQueueから出てきたpairがすでに
// 到達している＝＝すでにdistの値が最小値である;
}
}
}
}
}
}
};
//-----------動的計画法---------------//
// b < a => true , a = b;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// b > a => true , a = b;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
//-----------２つの順番を考慮しないintをもつ型-------------
// unorder <typename> instance(para , para2);
template <class T> class unorder {
public:
T a, b;
unorder(T a_, T b_) {
(a = a_);
(b = b_);
}
~unorder() {}
public:
bool operator==(unorder y) {
return (this->a + this->b == y.a + y.b && this->a * this->b == y.a * y.b);
}
bool operator!=(unorder y) {
return (this->a + this->b != y.a + y.b || this->a * this->b != y.a * y.b);
}
void operator=(pair<T, T> p) {
this->a = p.first;
this->b = p.second;
}
};
//-------素因数分解---------------
vector<pair<ll, ll>> PrimeFactors(ll n) {
std::map<ll, ll> out;
vector<pair<ll, ll>> answer;
while (n % 2 == 0) {
++out[2];
n = n / 2;
}
if (out[2])
answer.push_back(make_pair(2, out[2]));
for (ll i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) {
++out[i];
n = n / i;
}
if (out[i])
answer.push_back(make_pair(i, out[i]));
}
if (n > 2)
++out[n];
if (out[n])
answer.push_back(make_pair(n, out[n]));
return answer;
}
void StringSort(vector<string> &S) {
map<int, int> SwapInd;
int maxi = 0; // Sに含まれる文字列の最大文字列長
for (int i = 0; i < S.size(); i++) {
if (S[i].size() > maxi)
maxi = S[i].size();
}
for (int i = 0; i < maxi; i++) { // ここが右端の文字から左の文字へのループ
int k =
maxi -
i; // 今考えている文字が左から何文字目かを表す(indexではないので-1することに注意)
int sort_num = 0; // 文字列長がk+1以上ある要素の個数
// ソートしたい文字列の個数と言い換えられる
for (int j = 0; j < S.size(); j++) {
if (S[j].size() >= k) { // S[j]にk+1文字目が存在すればSwapInd[j]に記録
SwapInd[j] = 1;
sort_num++; // インクリメント
}
}
int swapped = 0; // Sの右側グループの左端indexを0としたきのindex
// ここからグループ分けをします
for (int j = 0; j < S.size(); j++) {
// ここで、S.size() - sort_num は右側と左側の境界である
if (SwapInd[j] == 1 && j < S.size() - sort_num) {
// j番目の文字列がソート対象（文字列長k以上）
// かつ、S[j]が右側グループに入っていない
if (SwapInd[S.size() - sort_num + swapped] == 0) {
// 右側グループの左からswapped番目の文字列がソート対象でない場合
iter_swap(S.begin() + j, S.begin() + S.size() - sort_num + swapped);
// 入れ替える
} else {
// 右側グループの左からswapped番目の文字列がソート対象である場合
// 右側グループの左からswapped番目の文字列がソート対象でなくなるまで
// swappedをインクリメントする
while (SwapInd[S.size() - sort_num + swapped] != 0) {
swapped++;
if (S.size() - sort_num + swapped >= S.size()) {
break; // out of index
}
if (S.size() - sort_num + swapped < S.size()) {
iter_swap(S.begin() + j,
S.begin() + S.size() - sort_num + swapped);
}
}
}
SwapInd[j] = 0; // 更新
SwapInd[S.size() - sort_num + swapped] = 0; // 更新
swapped++; // 左右境界から何番目に要素を追加するかを表す
} // Sのグループ分け完了
}
vector<string> WhatSorted(sort_num);
vector<pair<int, int>> char_and_index(sort_num);
// sortする文字とそのindex,
for (int j = 0; j < sort_num; j++) {
if (S[S.size() - sort_num + j][k - 1] >= 65 &&
S[S.size() - sort_num + j][k - 1] <= 90) {
char_and_index[j].first = (int)S[S.size() - sort_num + j][k - 1] + 32;
} else {
char_and_index[j].first = (int)S[S.size() - sort_num + j][k - 1];
}
char_and_index[j].second = j;
WhatSorted[j] = S[S.size() - sort_num + j]; // 境界からj番目の文字列
}
sort(char_and_index.begin(), char_and_index.end());
for (int j = 0; j < sort_num; j++) {
S[S.size() - sort_num + j] = WhatSorted[char_and_index[j].second];
}
}
}
//-----------MODつきCombination------------//
class ModComb {
public:
vll fac;
vll finv;
vll inv;
ModComb(ll MAX_, ll MOD_) : fac(MAX_), finv(MAX_), inv(MAX_) {
MAX = MAX_;
MOD = MOD_;
}
~ModComb() {
std::vector<ll>().swap(fac);
std::vector<ll>().swap(finv);
std::vector<ll>().swap(inv);
}
int MAX;
int MOD;
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
};
//-------------bit全探索---------------
// aは空の二重配列
// aに格納する
// a[i]には小さい方からi個目のn桁のbinaryで1が現れる桁の情報が入っている
// a[i][j]はa[i]のbitが1になる桁を表す。
// a[i]の値はpow(2,0)<=pow(2,k)<=pow(2,n-1)となるkが昇順で入っている
void BIT(vector<vll> &a, ll n) {
for (ll bit = 0; bit < (1 << n); bit++) {
vll P;
a.push_back(P);
for (ll i = 0; i < n; i++) {
if (bit & (1 << i)) {
a[bit].push_back(i);
}
}
}
}
// 桁数
int getdigit(ll n) { return log10(n) + 1; }
ll keta(ll n, ll k) {
if (k > getdigit(n)) {
return -1;
} else if (k == 1) {
return n % 10;
} else {
ll p = 1;
REP(i, k) p *= 10;
return (n % p) / (p / 10);
}
}
ll kiriage(ll a, ll b) { return a / b + (a % b == 0); }
template <class T> // Tはvector or string
pair<vector<ll>, T> seqence(T x) { // xの連続してる部分をvectorにまとめる
// firstが連続する個数、secondが値
pair<vll, T> s;
bool flag = 0; // 今連続しているかどうか
ll now;
ll seq = 1;
ll next;
REP(i, x.size()) {
if (i + 1 >= x.size()) { // 次の数が範囲外になるとき
now = x[i];
s.first.push_back(seq);
s.second.push_back(now);
break;
} else {
now = x[i];
next = x[i + 1];
if (flag) {
if (now == next) {
seq++;
} else {
s.first.push_back(seq);
s.second.push_back(now);
seq = 1;
flag = 0;
}
} else {
if (now == next) {
seq++;
flag = 1;
} else {
s.first.push_back(seq);
s.second.push_back(now);
seq = 1;
}
}
}
}
return s;
}
// パスカルの三角形
vector<vector<ll>> pascal(66); // 65段までならいける
vll getpascal(ll n) {
if (pascal[n].size() > 0)
return pascal[n];
vll e;
if (n == 0) {
e.push_back(1);
} else {
e.push_back(1);
vll ajj = getpascal(n - 1);
REP(i, ajj.size() - 1) { e.push_back(ajj[i] + ajj[i + 1]); }
e.push_back(1);
}
return pascal[n] = e;
}
void pascal_calc(ll n) { pascal[n] = getpascal(n); }
// すぐにオーバーフローするから使わない方がいいシグマ計算
vector<vector<long long>> Sigma(11, vll(1000005));
// sigma(a,n) := (k^a)の和(0->n)
long long sigmaCalc(ll a, ll n) {
if (Sigma[a][n] != 0) {
return Sigma[a][n];
}
pascal_calc(a + 1);
ll ans = 0;
if (a == 0) {
ans = n;
} else {
ll coefficient = pascal[a + 1][1];
ans += pow(n + 1, a + 1) - 1;
REP(i, a) { ans -= sigmaCalc(a - 1 - i, n) * pascal[a + 1][2 + i]; }
ans /= coefficient;
}
return Sigma[a][n] = ans;
}
//-----------MAIN------------//
// 注意::::DPの配列、vectorはグローバル変数を使え！！そして引数として与えるな！！
// Sqrは２乗 sqrtはルート
//
int main() {
LL n, m, k, A, B;
string s;
map<ll, ll> p;
vector<pll> Pairs;
pll Ap;
cin >> k;
ll ind = 1;
n = 7;
n %= k;
ll ch = INF;
ll mnow = n % k;
while (1) {
if (n % k == 0) {
break;
} else {
mnow = ((mnow)*10) % k;
n += mnow;
ind++;
}
if (ind >= 1000000) {
cout << -1;
return 0;
}
}
cout << ind;
return 0;
}
| 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 vector<vb> vvb;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef set<int> si;
typedef vector<si> vsi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<int, int> pi;
typedef queue<int> qi;
typedef queue<pi> qpi;
typedef pair<ll, ll> pll;
typedef queue<pll> qpll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const int mod = 1000000007;
const int INF = 1001001001;
// 小数点 << fixed << setprecision(0) <<
// sort降順 sort(ALL(),greater<int>());
// 円周率 M_PI
// 文字判定 isupper islower
// 文字変換
// 順列 do {} while(next_permutation(ALL(X)));
// 最大値 LLONG_MAX
// a内でx以上 auto iter = lower_bound(ALL(a), x);
// a内でxより大きい auto iter = upper_bound(ALL(a), x);
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
struct edge {
int from; // 出発点
int to; // 到達点
int cost; // 移動コスト
};
typedef struct edge se;
typedef vector<edge> ve;
unsigned Euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return Euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int digit_sum(int n) {
int sum = n % 10;
while (n != 0) {
n /= 10;
sum += n % 10;
}
return sum;
}
vpll PrimeFactorization(ll n) {
vpll res;
for (ll i = 2; i * i <= n; i++) {
if (n % i != 0)
continue;
ll ex = 0;
while (n % i == 0) {
ex++;
n /= i;
}
res.push_back(pll(i, ex));
}
if (n != 1)
res.push_back(pll(n, 1));
return res;
}
int main() {
int k;
cin >> k;
if (k % 2 == 0) {
cout << "-1" << endl;
return 0;
}
int w = 7 % k;
int x = w;
int cnt = 1;
while (w != 0) {
w = (w * 10 + x) % k;
cnt++;
}
cout << cnt << endl;
return 0;
}
| #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 vector<vb> vvb;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef set<int> si;
typedef vector<si> vsi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<int, int> pi;
typedef queue<int> qi;
typedef queue<pi> qpi;
typedef pair<ll, ll> pll;
typedef queue<pll> qpll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const int mod = 1000000007;
const int INF = 1001001001;
// 小数点 << fixed << setprecision(0) <<
// sort降順 sort(ALL(),greater<int>());
// 円周率 M_PI
// 文字判定 isupper islower
// 文字変換
// 順列 do {} while(next_permutation(ALL(X)));
// 最大値 LLONG_MAX
// a内でx以上 auto iter = lower_bound(ALL(a), x);
// a内でxより大きい auto iter = upper_bound(ALL(a), x);
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
struct edge {
int from; // 出発点
int to; // 到達点
int cost; // 移動コスト
};
typedef struct edge se;
typedef vector<edge> ve;
unsigned Euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return Euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int digit_sum(int n) {
int sum = n % 10;
while (n != 0) {
n /= 10;
sum += n % 10;
}
return sum;
}
vpll PrimeFactorization(ll n) {
vpll res;
for (ll i = 2; i * i <= n; i++) {
if (n % i != 0)
continue;
ll ex = 0;
while (n % i == 0) {
ex++;
n /= i;
}
res.push_back(pll(i, ex));
}
if (n != 1)
res.push_back(pll(n, 1));
return res;
}
int main() {
int k;
cin >> k;
if (k % 2 == 0) {
cout << "-1" << endl;
return 0;
}
int w = 7 % k;
int x = w;
int cnt = 1;
while (w != 0) {
w = (w * 10 + x) % k;
cnt++;
if (cnt > k) {
cout << "-1" << endl;
return 0;
}
}
cout << cnt << endl;
return 0;
}
| 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;
ini *= 10;
ini++;
}
cout << ans;
return 0;
}
| #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)
break;
ini *= 10;
ini++;
}
cout << ans;
return 0;
}
| 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;
const ll MAX = 10000000;
const ll MIN = 0;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using pint = pair<int, int>;
using pstring = pair<int, string>;
int main() {
ll N;
cin >> N;
if (N % 2 == 0 || N % 2 == 0) {
cout << -1 << endl;
return 0;
}
ll ans = 1;
ll mod = 7 % N;
while (mod % N) {
mod *= 10;
mod += 7;
mod %= N;
ans++;
}
cout << ans << endl;
return 0;
}
| #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;
const ll MAX = 10000000;
const ll MIN = 0;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using pint = pair<int, int>;
using pstring = pair<int, string>;
int main() {
ll N;
cin >> N;
if (N % 2 == 0 || N % 5 == 0) {
cout << -1 << endl;
return 0;
}
ll ans = 1;
ll mod = 7 % N;
while (mod % N) {
mod *= 10;
mod += 7;
mod %= N;
ans++;
}
cout << ans << endl;
return 0;
}
| 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 = true;
ans = i;
break;
}
am %= L;
}
if (a) {
cout << ans << endl;
} else {
cout << -1 << endl;
}
}
| #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 = 1; i < 1000000000; i++) {
am *= 10;
if (am % L == 1) {
a = true;
ans = i;
break;
}
am %= L;
}
if (a) {
cout << ans << endl;
} else {
cout << -1 << endl;
}
}
| 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[i]) {
auto tmp = r.top();
r.pop();
c[w[i]] = 'R';
c[tmp] = 'W';
r.push(w[i]);
w[i] = tmp;
ans++;
}
// cout << c << endl;
}
cout << ans << endl;
return 0;
} | #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 0;
}
for (auto i = 0; i < (int)w.size(); i++) {
if (r.top() > w[i]) {
auto tmp = r.top();
r.pop();
c[w[i]] = 'R';
c[tmp] = 'W';
r.push(w[i]);
w[i] = tmp;
ans++;
}
// cout << c << endl;
}
cout << ans << endl;
return 0;
} | 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')
w++;
}
ll ans1 = 0, ans2 = 0;
rep(i, r) {
if (vec.at(i) == 'W')
ans1++;
}
for (int i = r; i < n; i++) {
if (vec.at(i) == 'R')
ans2++;
}
ll ans = max(ans1, ans2);
cout << ans << endl;
return 0;
}
| #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) == 'W')
w++;
}
ll ans1 = 0, ans2 = 0;
rep(i, r) {
if (vec.at(i) == 'W')
ans1++;
}
for (int i = r; i < n; i++) {
if (vec.at(i) == 'R')
ans2++;
}
ll ans = max(ans1, ans2);
cout << ans << endl;
return 0;
}
| 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++)
using namespace std;
int main() {
int n;
cin >> n;
vector<char> a(n);
vector<int> w, r;
rep(i, 0, n) {
cin >> a[i];
if (a[i] == 'W')
w.push_back(i);
else
r.push_back(i);
}
reverse(r.begin(), r.end());
int ans = 0;
int W, R;
W = w.size();
R = r.size();
if (W && R) {
for (int i = 0; i < W || i < R; i++) {
if (w[i] < r[i])
ans++;
}
}
cout << ans << endl;
}
| #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++)
using namespace std;
int main() {
int n;
cin >> n;
vector<char> a(n);
vector<int> w, r;
rep(i, 0, n) {
cin >> a[i];
if (a[i] == 'W')
w.push_back(i);
else
r.push_back(i);
}
reverse(r.begin(), r.end());
int ans = 0;
int W, R;
W = w.size();
R = r.size();
if (W && R) {
for (int i = 0; i < W && i < R; i++) {
if (w[i] < r[i])
ans++;
}
}
cout << ans << endl;
}
| replace | 36 | 37 | 36 | 37 | 0 | |
p02597 | C++ | Runtime Error | // ##### ##### ##### ##### ##### # ##### # #//
// # # # # # # # # # # # ## ##//
// ##### ##### ##### # ##### # ##### # # #//
// ## # # # # # # # # # # #//
// # # # # # # # # # # # # #//
// # # # # # # # # # # # # #//
// # # # # ##### ##### # # ##### # # # #//
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ppb pop_back
#define cs(n) cout << n << " "
#define cn(n) cout << n << "\n"
#define rep(i, j, k) for (int i = j; i < k; i++)
#define rrep(i, j, k) for (int i = j; i >= k; i--)
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
ll bin(ll a, ll b, ll mod) {
if (b == 0)
return 1;
if (b % 2 == 0)
return bin((a * a) % mod, b / 2, mod) % mod;
return ((a % mod) * (bin((a * a) % mod, b / 2, mod) % mod)) % mod;
}
void solve() {
int n;
cin >> n;
int ar[n];
int c0 = 0, c1 = 0;
rep(i, 0, n) {
char ch;
cin >> ch;
ar[i] = (ch == 'W' ? 0 : 1);
if (ar[i] == 0)
c0++;
else
c1++;
}
int i = 0, j = n - 1, ans = 0;
;
while (i < j) {
while (ar[j] != 1) {
j--;
}
if (ar[i] == 1) {
i++;
continue;
}
if (i >= j) {
break;
}
ar[i] = 1;
ar[j] = 0;
i++;
j--;
ans++;
}
cout << ans;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio;
int t;
t = 1;
// cin>>t;
while (t--) {
solve();
}
#ifndef ONLINE_JUDGE
cout << "\nTime Elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " sec\n";
#endif
return 0;
} | // ##### ##### ##### ##### ##### # ##### # #//
// # # # # # # # # # # # ## ##//
// ##### ##### ##### # ##### # ##### # # #//
// ## # # # # # # # # # # #//
// # # # # # # # # # # # # #//
// # # # # # # # # # # # # #//
// # # # # ##### ##### # # ##### # # # #//
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ppb pop_back
#define cs(n) cout << n << " "
#define cn(n) cout << n << "\n"
#define rep(i, j, k) for (int i = j; i < k; i++)
#define rrep(i, j, k) for (int i = j; i >= k; i--)
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
ll bin(ll a, ll b, ll mod) {
if (b == 0)
return 1;
if (b % 2 == 0)
return bin((a * a) % mod, b / 2, mod) % mod;
return ((a % mod) * (bin((a * a) % mod, b / 2, mod) % mod)) % mod;
}
void solve() {
int n;
cin >> n;
int ar[n];
int c0 = 0, c1 = 0;
rep(i, 0, n) {
char ch;
cin >> ch;
ar[i] = (ch == 'W' ? 0 : 1);
if (ar[i] == 0)
c0++;
else
c1++;
}
int i = 0, j = n - 1, ans = 0;
;
while (i < j) {
while (ar[j] != 1 && j > 0) {
j--;
}
if (ar[i] == 1) {
i++;
continue;
}
if (i >= j) {
break;
}
ar[i] = 1;
ar[j] = 0;
i++;
j--;
ans++;
}
cout << ans;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio;
int t;
t = 1;
// cin>>t;
while (t--) {
solve();
}
#ifndef ONLINE_JUDGE
cout << "\nTime Elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " sec\n";
#endif
return 0;
} | 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::end(x)
using namespace std;
int64_t solve(const int N, string c) {
char RED = 'R';
char WHITE = 'W';
int r = N - 1;
int count = 0;
REP(l, N) {
if (c.at(l) == RED)
continue;
while (c.at(r) == WHITE && r > -1)
--r;
if (l >= r)
break;
c.at(l) = RED;
c.at(r) = WHITE;
++count;
}
return count;
}
// generated by online-judge-template-generator v4.4.0
// (https://github.com/kmyk/online-judge-template-generator)
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
constexpr char endl = '\n';
int N;
cin >> N;
string c;
cin >> c;
auto ans = solve(N, c);
cout << ans << endl;
return 0;
}
| #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::end(x)
using namespace std;
int64_t solve(const int N, string c) {
char RED = 'R';
char WHITE = 'W';
int r = N - 1;
int count = 0;
REP(l, N) {
if (c.at(l) == RED)
continue;
while (c.at(r) == WHITE && r > 0)
--r;
if (l >= r)
break;
c.at(l) = RED;
c.at(r) = WHITE;
++count;
}
return count;
}
// generated by online-judge-template-generator v4.4.0
// (https://github.com/kmyk/online-judge-template-generator)
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
constexpr char endl = '\n';
int N;
cin >> N;
string c;
cin >> c;
auto ans = solve(N, c);
cout << ans << endl;
return 0;
}
| 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 n;
cin >> n;
string maze;
cin >> maze;
int i = 0, j = n - 1;
int cnt = 0;
while (i < j) {
while (maze[i] != 'W')
i++;
while (maze[j] != 'R')
j--;
swap(maze[i], maze[j]);
i++;
if (i > j)
cnt++;
}
cout << cnt << endl;
} | #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 n;
cin >> n;
string maze;
cin >> maze;
int i = 0, j = n - 1;
int cnt = 0;
for (int l = 0, r = n - 1; l < r;) {
if (maze[l] == 'W') {
if (maze[r] == 'R') {
swap(maze[l], maze[r]);
cnt++;
l++;
}
r--;
} else {
l++;
}
}
cout << cnt << endl;
} | 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<<(ostream &os, pair<T1, T2> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &v);
template <class T> ostream &operator<<(ostream &os, set<T> &v);
template <class T1, class T2> ostream &operator<<(ostream &os, map<T1, T2> &v);
#ifdef APURBA
#define debug(a) cout << #a << " --> " << (a) << "\n";
#define debug2(a) cout << #a << " --> " << (a) << " ";
#define HERE cout << "here - " << __LINE__ << "\n";
#else
#define debug(a)
#define debug2(a)
#define HERE
#endif
const ll mod = 1e9 + 7;
const int N = 1e6 + 5;
typedef pair<int, int> pii;
void TEST_CASES(int cas) {
int n;
string s;
cin >> n >> s;
int cnt = 0;
int p1 = 0, p2 = n - 1;
while (1) {
while (p1 < n && s[p1] != 'W') {
p1++;
}
while (p2 < n && s[p2] != 'R') {
p2--;
}
if (p1 >= p2) {
break;
}
cnt++;
swap(s[p1], s[p2]);
}
printf("%d\n", cnt);
}
/*
*/
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int t = 1, cas = 0;
// scanf("%d",&t);
while (t--) {
TEST_CASES(++cas);
}
return 0;
}
template <class T1, class T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
os << "{" << p.first << ", " << p.second << "} ";
return os;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
os << "[ ";
for (int i = 0; i < v.size(); i++) {
os << v[i] << " ";
}
os << " ]";
return os;
}
template <class T> ostream &operator<<(ostream &os, set<T> &v) {
os << "[ ";
for (T i : v) {
os << i << " ";
}
os << " ]";
return os;
}
template <class T1, class T2> ostream &operator<<(ostream &os, map<T1, T2> &v) {
for (auto i : v) {
os << "Key : " << i.first << " , Value : " << i.second << endl;
}
return os;
}
| #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<<(ostream &os, pair<T1, T2> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &v);
template <class T> ostream &operator<<(ostream &os, set<T> &v);
template <class T1, class T2> ostream &operator<<(ostream &os, map<T1, T2> &v);
#ifdef APURBA
#define debug(a) cout << #a << " --> " << (a) << "\n";
#define debug2(a) cout << #a << " --> " << (a) << " ";
#define HERE cout << "here - " << __LINE__ << "\n";
#else
#define debug(a)
#define debug2(a)
#define HERE
#endif
const ll mod = 1e9 + 7;
const int N = 1e6 + 5;
typedef pair<int, int> pii;
void TEST_CASES(int cas) {
int n;
string s;
cin >> n >> s;
int cnt = 0;
int p1 = 0, p2 = n - 1;
while (1) {
while (p1 < n && s[p1] != 'W') {
p1++;
}
while (p2 >= 0 && s[p2] != 'R') {
p2--;
}
if (p1 >= p2) {
break;
}
cnt++;
swap(s[p1], s[p2]);
}
printf("%d\n", cnt);
}
/*
*/
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int t = 1, cas = 0;
// scanf("%d",&t);
while (t--) {
TEST_CASES(++cas);
}
return 0;
}
template <class T1, class T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
os << "{" << p.first << ", " << p.second << "} ";
return os;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
os << "[ ";
for (int i = 0; i < v.size(); i++) {
os << v[i] << " ";
}
os << " ]";
return os;
}
template <class T> ostream &operator<<(ostream &os, set<T> &v) {
os << "[ ";
for (T i : v) {
os << i << " ";
}
os << " ]";
return os;
}
template <class T1, class T2> ostream &operator<<(ostream &os, map<T1, T2> &v) {
for (auto i : v) {
os << "Key : " << i.first << " , Value : " << i.second << endl;
}
return os;
}
| 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 << ans << endl;
} | #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 << ans << endl;
} | 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(i) = rsumv.at(i - 1);
}
ll rsum = rsumv.at(n - 1);
ll ans = rsum - rsumv.at(rsum - 1);
cout << ans << endl;
} | #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(i) = rsumv.at(i - 1);
}
ll rsum = rsumv.at(n - 1);
ll ans = 0;
if (rsum) {
ans = rsum - rsumv.at(rsum - 1);
}
cout << ans << endl;
} | 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);
else
b.push_back(i);
}
reverse(b.begin(), b.end());
int ans = 0;
for (int i = 0; i < n; i++) {
if (i > a.size() - 1 || i > b.size() - 1) {
break;
}
if (a[i] > b[i])
break;
;
ans++;
}
cout << ans;
} | #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);
else
b.push_back(i);
}
reverse(b.begin(), b.end());
int ans = 0;
for (int i = 0; i < n; i++) {
if (i > ((int)a.size() - 1) || i > ((int)b.size()) - 1) {
break;
}
if (a[i] > b[i])
break;
;
ans++;
}
cout << ans;
} | 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";
return 0;
} // farewell, until we meet again..
| // 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";
return 0;
} // farewell, until we meet again.. | 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); \
cout.tie(NULL)
#define int long long
#define endl "\n"
#define all(x) (x).begin(), (x).end()
const int MOD = 1e9 + 7;
const int mxN = 2e5 + 3;
void solve() {
int n;
cin >> n;
string s;
cin >> s;
int st = 0;
int en = n - 1;
while (s[st] == 'R') {
st++;
}
while (s[en] == 'W') {
en--;
}
int ans = 0;
while (st < en) {
if (s[st] == 'W' and s[en] == 'R')
ans++, st++, en--;
else if (s[st] == 'R' and s[en] == 'R')
st++;
else if (s[st] == 'W' and s[en] == 'W')
en--;
}
cout << ans << endl;
}
int32_t main() {
IO;
int nT = 1;
// cin >> nT;
for (int i = 1; i <= nT; ++i)
solve();
return 0;
}
| #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); \
cout.tie(NULL)
#define int long long
#define endl "\n"
#define all(x) (x).begin(), (x).end()
const int MOD = 1e9 + 7;
const int mxN = 2e5 + 3;
void solve() {
int n;
cin >> n;
string s;
cin >> s;
int st = 0;
int en = n - 1;
while (s[st] == 'R') {
st++;
}
while (s[en] == 'W') {
en--;
}
int ans = 0;
while (st < en) {
if (s[st] == 'W' and s[en] == 'R')
ans++, st++, en--;
else if (s[st] == 'R' and s[en] == 'R')
st++;
else if (s[st] == 'W' and s[en] == 'W')
en--;
else
st++, en--;
}
cout << ans << endl;
}
int32_t main() {
IO;
int nT = 1;
// cin >> nT;
for (int i = 1; i <= nT; ++i)
solve();
return 0;
}
| 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 (int i = 0; i < rs; i++) {
if (c[i] != 'R')
diff++;
}
for (int i = rs; i < N; i++) {
if (c[i] != 'W')
diff++;
}
cout << diff / 2 << endl;
return 0;
} | #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 (int i = 0; i < rs; i++) {
if (c[i] != 'R')
diff++;
}
for (int i = rs; i < N; i++) {
if (c[i] != 'W')
diff++;
}
cout << diff / 2 << endl;
return 0;
} | 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 (int i = 0; i < rs; i++) {
if (c[i] != 'R')
diff++;
}
for (int i = rs; i < n; i++) {
if (c[i] != 'W')
diff++;
}
cout << diff / 2 << endl;
return 0;
} | #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 (int i = 0; i < rs; i++) {
if (c[i] != 'R')
diff++;
}
for (int i = rs; i < n; i++) {
if (c[i] != 'W')
diff++;
}
cout << diff / 2 << endl;
return 0;
} | 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) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 200005;
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
int N;
string S;
cin >> N >> S;
int l = 0, r = N - 1;
int ans = 0;
while (l < r) {
bool flg = 0;
for (int i = l; i < r; ++i) {
if (S[i] == 'W' && S[i + 1] == 'R')
flg = 1;
}
if (flg) {
while (S[l] == 'R')
l++;
while (S[r] == 'W')
r--;
if (l < r) {
swap(S[l], S[r]);
ans++;
}
}
l++, r--;
}
cout << ans << endl;
} | #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) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 200005;
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
int N;
string S;
cin >> N >> S;
int l = 0, r = N - 1;
int ans = 0;
while (l < r) {
while (S[l] == 'R')
l++;
while (S[r] == 'W')
r--;
if (l < r) {
swap(S[l], S[r]);
ans++;
}
l++, r--;
}
cout << ans << endl;
} | 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], s[j]);
count++;
}
}
cout << count << endl;
}
| #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) {
swap(s[i], s[j]);
count++;
}
}
cout << count << endl;
}
| 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 a, ll b) { // a^b
ll res = 1;
a = a % MOD;
while (b > 0) {
if (b & 1) {
res = (res * a) % MOD;
b--;
}
a = (a * a) % MOD;
b >>= 1;
}
return res;
}
ll fermat_inv(ll y) { return power(y, MOD - 2); }
ll gcd(ll a, ll b) { return (b == 0) ? a : gcd(b, a % b); }
ll min(ll a, ll b) { return (a > b) ? b : a; }
ll max(ll a, ll b) { return (a > b) ? a : b; }
bool prime[1000001];
vi primes;
void SieveOfEratosthenes(int n) {
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
for (int p = 2; p < 1000001; p++)
if (prime[p])
primes.pb(p);
}
ll fact[1001];
void factorial(int n) {
fact[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i, fact[i] %= MOD;
}
ll ncr(ll n, ll r) {
if (n < r)
return -1;
else {
ll x = fact[r] * fact[n - r] % MOD;
return fact[n] * fermat_inv(x) % MOD;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1;
// cin>>t;
// SieveOfEratosthenes(1000000);
// factorial(1000);
while (t--) {
int n;
string s;
cin >> n >> s;
int l = n, ans = 0;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == 'W')
l = i;
}
for (int i = n - 1; i > l; i--) {
if (s[i] == 'R') {
ans++;
while (s[++l] != 'W')
;
}
}
cout << ans;
}
} | #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 a, ll b) { // a^b
ll res = 1;
a = a % MOD;
while (b > 0) {
if (b & 1) {
res = (res * a) % MOD;
b--;
}
a = (a * a) % MOD;
b >>= 1;
}
return res;
}
ll fermat_inv(ll y) { return power(y, MOD - 2); }
ll gcd(ll a, ll b) { return (b == 0) ? a : gcd(b, a % b); }
ll min(ll a, ll b) { return (a > b) ? b : a; }
ll max(ll a, ll b) { return (a > b) ? a : b; }
bool prime[1000001];
vi primes;
void SieveOfEratosthenes(int n) {
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
for (int p = 2; p < 1000001; p++)
if (prime[p])
primes.pb(p);
}
ll fact[1001];
void factorial(int n) {
fact[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i, fact[i] %= MOD;
}
ll ncr(ll n, ll r) {
if (n < r)
return -1;
else {
ll x = fact[r] * fact[n - r] % MOD;
return fact[n] * fermat_inv(x) % MOD;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1;
// cin>>t;
// SieveOfEratosthenes(1000000);
// factorial(1000);
while (t--) {
int n;
string s;
cin >> n >> s;
int l = n, ans = 0;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == 'W')
l = i;
}
for (int i = n - 1; i > l; i--) {
if (s[i] == 'R') {
ans++;
while (l < n && s[++l] != 'W')
;
}
}
cout << ans;
}
} | 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, n) {
if (s[i] == 'W') {
for (int j = r; j >= l; j--) {
if (s[j] == 'R') {
r = j - 1;
ans++;
break;
}
}
}
l = i + 1;
}
cout << ans << endl;
return 0;
}
| #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 2000000007
#define LINF 100000000000000007
#define MOD 1000000007
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define repb(i, n) for (int i = n - 1; i >= 0; i--)
// #define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define ARDEB(i, X) cout << #X << "[" << i << "]: " << X[i] << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define ARDEB(i, X) \
{}
#define END \
{}
#endif
// typedef long long int ll;
typedef pair<int, int> P;
struct edge {
int to, cost;
};
int ceil2(int a, int b) {
if (a % b) {
return a / b + 1;
} else {
return a / b;
}
}
int n, k, ans;
string s;
signed main() {
cin >> n >> s;
int j = n - 1;
rep(i, n) {
if (s[i] == 'W') {
while (s[j] != 'R') {
j--;
}
if (i >= j)
break;
swap(s[i], s[j]);
j--;
ans++;
}
}
// cout<<s<<endl;
cout << ans << endl;
} | #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 2000000007
#define LINF 100000000000000007
#define MOD 1000000007
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define repb(i, n) for (int i = n - 1; i >= 0; i--)
// #define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define ARDEB(i, X) cout << #X << "[" << i << "]: " << X[i] << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define ARDEB(i, X) \
{}
#define END \
{}
#endif
// typedef long long int ll;
typedef pair<int, int> P;
struct edge {
int to, cost;
};
int ceil2(int a, int b) {
if (a % b) {
return a / b + 1;
} else {
return a / b;
}
}
int n, k, ans;
string s;
signed main() {
cin >> n >> s;
int j = n - 1;
rep(i, n) {
if (s[i] == 'W') {
while (j >= 0 && s[j] != 'R') {
j--;
}
if (i >= j)
break;
swap(s[i], s[j]);
j--;
ans++;
}
}
// cout<<s<<endl;
cout << ans << endl;
} | 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++;
}
}
}
cout << 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') {
Ans++;
}
}
}
cout << Ans;
} | 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 i = 0; i < N; i++) {
if (ch != C[i]) {
break;
}
if (i == N - 1) {
cout << "0" << endl;
return 0;
}
}
while (m <= n) {
for (int k = m; k < N - 1; k++) {
if (C[k] == 'W') {
m = k;
break;
}
}
if (m >= n)
break;
for (int k = n; k > 0; k--) {
if (C[k] == 'R') {
n = k;
break;
}
}
if (m >= n)
break;
if (n != m) {
ans++;
C[m] = 'R';
C[n] = 'W';
}
}
cout << ans << endl;
}
| #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 i = 0; i < N; i++) {
if (ch != C[i]) {
break;
}
if (i == N - 1) {
cout << "0" << endl;
return 0;
}
}
while (m <= n) {
for (int k = m; k < N - 1; k++) {
if (C[k] == 'W') {
m = k;
break;
}
}
if (m >= n)
break;
for (int k = n; k > 0; k--) {
if (C[k] == 'R') {
n = k;
break;
}
}
if (m >= n)
break;
if (n != m) {
ans++;
m++;
n--;
// C[m]='R';
// C[n]='W';
}
}
cout << ans << endl;
}
| 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--) {
if (s[j] == 'R') {
while (s[i] != 'W') {
i++;
if (i == n)
break;
}
if (i >= j)
break;
swap(s[i], s[j]);
cnt1++;
}
}
s = r;
for (int i = 0, j = n - 1; j >= 0 && i <= n - 1; i++) {
if (s[i] == 'W') {
while (s[j] != 'R') {
j--;
if (i == n)
break;
}
if (i >= j)
break;
swap(s[i], s[j]);
cnt2++;
}
}
cout << min(cnt1, cnt2) << endl;
} | #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--) {
if (s[j] == 'R') {
while (s[i] != 'W') {
i++;
if (i == n)
break;
}
if (i >= j)
break;
swap(s[i], s[j]);
cnt1++;
}
}
s = r;
for (int i = 0, j = n - 1; j >= 0 && i <= n - 1; i++) {
if (s[i] == 'W') {
while (s[j] != 'R') {
j--;
if (j == -1)
break;
}
if (i >= j)
break;
swap(s[i], s[j]);
cnt2++;
}
}
cout << min(cnt1, cnt2) << endl;
} | 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 \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define gcd(a, b) __gcd((a), (b))
#define fill(a, value) memset(a, value, sizeof(a));
#define minn(v) *min_element(v.begin(), v.end());
#define maxx(v) *max_element(v.begin(), v.end());
#define print(x) cout << (x) << endl;
#define sum(v) +x accumulate(v.begin(), v.end(), x);
#define debug(x) cout << #x << '=' << (x) << endl;
typedef pair<int, int> pii;
typedef vector<int> vi;
signed main() {
fastio;
cout << fixed << setprecision(12);
int n;
cin >> n;
string s;
cin >> s;
int i = 0;
int j = n - 1;
int ans = 0;
while (i < j) {
if (s[i] == 'W' and s[j] == 'R') {
i++;
j--;
ans++;
} else if (s[i] == 'W')
j--;
else if (s[j] == 'R')
i++;
}
print(ans) return 0;
}
| #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 \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define gcd(a, b) __gcd((a), (b))
#define fill(a, value) memset(a, value, sizeof(a));
#define minn(v) *min_element(v.begin(), v.end());
#define maxx(v) *max_element(v.begin(), v.end());
#define print(x) cout << (x) << endl;
#define sum(v) +x accumulate(v.begin(), v.end(), x);
#define debug(x) cout << #x << '=' << (x) << endl;
typedef pair<int, int> pii;
typedef vector<int> vi;
signed main() {
fastio;
cout << fixed << setprecision(12);
int n;
cin >> n;
string s;
cin >> s;
int i = 0;
int j = n - 1;
int ans = 0;
while (i < j) {
if (s[i] == 'W' and s[j] == 'R') {
i++;
j--;
ans++;
} else if (s[i] == 'W')
j--;
else if (s[j] == 'R')
i++;
else {
i++;
j--;
}
}
print(ans) return 0;
}
| 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));
l = j - 1;
sum += 1;
break;
}
}
}
}
cout << sum << endl;
return 0;
}
| #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));
l = j - 1;
sum += 1;
break;
}
if (j == i + 1)
l = j;
}
}
}
cout << sum << endl;
return 0;
}
| 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)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define deg(x) cout << endl << #x << " = " << (x) << endl;
#define casep(x) cout << "Case #" << (x) << ": ";
#define fast \
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); \
srand(time(NULL));
typedef pair<ll, ll> pp;
typedef vector<int> vi;
typedef vector<pp> vpp;
typedef vector<vi> vvi;
const int inf = 1e9 + 7;
const int minf = (-1) * (1e9 + 7);
ll power(ll a, ll n, ll mod) {
ll p = 1;
while (n > 0) {
if (n % 2) {
p = p * a;
p %= mod;
}
n >>= 1;
a *= a;
a %= mod;
}
return p % mod;
}
ll gcd(ll a, ll b) { return __gcd(a, b); }
ll lcm(ll a, ll b) { return a * b / __gcd(a, b); }
void solve(int test) {
int n;
cin >> n;
string s;
cin >> s;
queue<ll> q;
frr(i, n - 1, -1, 1) {
if (s[i] == 'R')
q.push(i);
}
ll ans = 0;
fr(i, 0, n, 1) {
if (s[i] == 'W') {
ll index = q.front();
if (index < i)
break;
swap(s[index], s[i]);
q.pop();
ans++;
}
}
// deg(s);
cout << ans;
}
int main() {
fast;
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++) {
solve(i);
cout << endl;
}
return 0;
}
| #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)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define deg(x) cout << endl << #x << " = " << (x) << endl;
#define casep(x) cout << "Case #" << (x) << ": ";
#define fast \
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); \
srand(time(NULL));
typedef pair<ll, ll> pp;
typedef vector<int> vi;
typedef vector<pp> vpp;
typedef vector<vi> vvi;
const int inf = 1e9 + 7;
const int minf = (-1) * (1e9 + 7);
ll power(ll a, ll n, ll mod) {
ll p = 1;
while (n > 0) {
if (n % 2) {
p = p * a;
p %= mod;
}
n >>= 1;
a *= a;
a %= mod;
}
return p % mod;
}
ll gcd(ll a, ll b) { return __gcd(a, b); }
ll lcm(ll a, ll b) { return a * b / __gcd(a, b); }
void solve(int test) {
int n;
cin >> n;
string s;
cin >> s;
queue<ll> q;
frr(i, n - 1, -1, 1) {
if (s[i] == 'R')
q.push(i);
}
ll ans = 0;
fr(i, 0, n, 1) {
if (s[i] == 'W') {
if (q.empty())
break;
ll index = q.front();
if (index < i)
break;
swap(s[index], s[i]);
q.pop();
ans++;
}
}
// deg(s);
cout << ans;
}
int main() {
fast;
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++) {
solve(i);
cout << endl;
}
return 0;
}
| 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.size() + 1; b++) {
int p = 0, q = 0;
for (int i = 0; i < N; i++) {
if (i < b && v[i] == 'W') {
p++;
}
if (i >= b && v[i] == 'R') {
q++;
}
}
// std::cout << "b=" << b << "pair(" << p << ", " << q << ")" << std::endl;
int ans;
if (p > q) {
ans = q + (p - q);
} else {
ans = p + (q - p);
}
if (ans < min)
min = ans;
}
std::cout << min;
return 0;
} | #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 (int i = 0; i < N; i++) {
if (v[i] == 'R') {
q++;
}
}
min = q;
for (int b = 1; b < v.size() + 1; b++) {
// for(int i=0; i<N; i++) {
// if(i<b && v[i]=='W') {
// p++;
// }
// if(i>=b && v[i]=='R') {
// q++;
// }
// }
if (v[b - 1] == 'W') {
p++;
}
if (v[b - 1] == 'R') {
q--;
}
// std::cout << "b=" << b << "pair(" << p << ", " << q << ")" << std::endl;
int ans;
if (p > q) {
ans = q + (p - q);
} else {
ans = p + (q - p);
}
if (ans < min)
min = ans;
}
std::cout << min;
return 0;
} | 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--;
} else if (S[right] == 'R') {
left++;
}
}
cout << count << endl;
} | #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--;
} else if (S[right] == 'R') {
left++;
} else {
left++;
right--;
}
}
cout << count << endl;
} | 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, A, B) for (LL i = A; i >= B; i--)
#define FOR_SIDE(i, A) for (LL i = Head[A]; i; i = Next[i])
#define INF 0x7fffffff
using namespace std;
const int MAXN = 1e5 + 10;
int Red, White, Loc[MAXN], Total, Ans = INF;
char Opt;
inline void File() {
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
}
int main() {
// File();
scanf("%d", &Total);
Opt = getchar();
FOR(i, 1, Total) {
Opt = getchar();
if (Opt == 'W')
Loc[i] = 0, White++;
else
Loc[i] = 1, Red++;
}
int New = 0, Res = 0;
FOR(i, 1, Total) if (Loc[i] == 1 && i > Red) New++;
printf("%d\n", New);
// fclose(stdin); fclose(stdout);
// system("pause");
return 0;
} | // 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, A, B) for (LL i = A; i >= B; i--)
#define FOR_SIDE(i, A) for (LL i = Head[A]; i; i = Next[i])
#define INF 0x7fffffff
using namespace std;
const int MAXN = 2e5 + 10;
int Red, White, Loc[MAXN], Total, Ans = INF;
char Opt;
inline void File() {
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
}
int main() {
// File();
scanf("%d", &Total);
Opt = getchar();
FOR(i, 1, Total) {
Opt = getchar();
if (Opt == 'W')
Loc[i] = 0, White++;
else
Loc[i] = 1, Red++;
}
int New = 0, Res = 0;
FOR(i, 1, Total) if (Loc[i] == 1 && i > Red) New++;
printf("%d\n", New);
// fclose(stdin); fclose(stdout);
// system("pause");
return 0;
} | 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 si(v) int((v).size())
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= (ll)(m); ++i)
#define rep3(i, n, m) for (ll i = n; i >= (ll)(m); --i)
template <class T, class U> bool chmax(T &a, U b) {
if (a < b)
a = b;
return true;
}
template <class T, class U> bool chmin(T &a, U b) {
if (a > b)
a = b;
return true;
}
using ll = long long;
using ld = long double;
using namespace std;
constexpr ll MOD = 1000000007;
signed main() {
cout << fixed << setprecision(20);
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
int r;
rep(i, n) if (s[i] == 'R')++ r;
int ans = 0;
rep(i, r) if (s[i] == 'W')++ ans;
cout << ans << endl;
return (0);
}
| #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 si(v) int((v).size())
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= (ll)(m); ++i)
#define rep3(i, n, m) for (ll i = n; i >= (ll)(m); --i)
template <class T, class U> bool chmax(T &a, U b) {
if (a < b)
a = b;
return true;
}
template <class T, class U> bool chmin(T &a, U b) {
if (a > b)
a = b;
return true;
}
using ll = long long;
using ld = long double;
using namespace std;
constexpr ll MOD = 1000000007;
signed main() {
cout << fixed << setprecision(20);
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
int r = 0;
rep(i, n) if (s[i] == 'R')++ r;
int ans = 0;
rep(i, r) if (s[i] == 'W')++ ans;
cout << ans << endl;
return (0);
}
| 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++;
break;
}
}
}
}
cout << ans << endl;
}
} | #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++;
break;
}
now = j + 1;
}
}
}
cout << ans << endl;
}
} | 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);
return 0;
} | #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);
return 0;
} | 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 <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int(i) = (n); (i) >= (0); (i)--)
#define SIZE(x) ((int)(x).size())
#define GCD(a, b) \
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
#define QP(a, b) \
int qp(int a, ll b) { \
int ans = 1; \
do { \
if (b & 1) \
ans = 1ll * ans * a % mo; \
a = 1ll * a * a % mo; \
} while (b >>= 1); \
return ans; \
}
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define all(v) (v).begin(), (v).end()
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chadd(T &a, T b) { a = a + b; }
template <typename A, size_t N, typename T>
void FILL(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
typedef vector<int, int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1LL << 60;
const ll MOD = 1000000007LL;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int sum = 0;
string s;
cin >> s;
int r = s.rfind("R");
int w = s.find("W");
while (r != -1 && w != -1 && r > w) {
sum++;
int tmp = s[r];
s[r] = s[w];
s[w] = tmp;
r = s.rfind("R");
w = s.find("W");
}
cout << sum;
cout << endl;
return 0;
} | #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 <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int(i) = (n); (i) >= (0); (i)--)
#define SIZE(x) ((int)(x).size())
#define GCD(a, b) \
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
#define QP(a, b) \
int qp(int a, ll b) { \
int ans = 1; \
do { \
if (b & 1) \
ans = 1ll * ans * a % mo; \
a = 1ll * a * a % mo; \
} while (b >>= 1); \
return ans; \
}
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define all(v) (v).begin(), (v).end()
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chadd(T &a, T b) { a = a + b; }
template <typename A, size_t N, typename T>
void FILL(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
typedef vector<int, int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1LL << 60;
const ll MOD = 1000000007LL;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int sum = 0;
string s;
cin >> s;
int num_r = count(all(s), 'R');
for (int i = 0; i < num_r; i++) {
if (s[i] == 'W')
sum++;
}
cout << sum;
cout << endl;
return 0;
} | 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 cls(s, v) memset(s, v, sizeof(s))
#define mp(a, b) make_pair<int, int>(a, b)
#define cp pair<int, int>
using namespace std;
const int maxn = 100005, maxm = 100005, INF = 0x3f3f3f3f;
inline int read() {
int out = 0, flag = 1;
char c = getchar();
while (c < 48 || c > 57) {
if (c == '-')
flag = 0;
c = getchar();
}
while (c >= 48 && c <= 57) {
out = (out << 1) + (out << 3) + c - 48;
c = getchar();
}
return flag ? out : -out;
}
char s[maxn];
int main() {
int n = read();
scanf("%s", s + 1);
int l = 1, r = n, ans = 0;
while (l < r) {
while (l < r && s[l] == 'R')
l++;
while (l < r && s[r] == 'W')
r--;
if (l < r && s[l] == 'W' && s[r] == 'R')
ans++, s[l] = 'R', s[r] = 'W';
}
printf("%d\n", ans);
return 0;
} | #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 cls(s, v) memset(s, v, sizeof(s))
#define mp(a, b) make_pair<int, int>(a, b)
#define cp pair<int, int>
using namespace std;
const int maxn = 200005, maxm = 100005, INF = 0x3f3f3f3f;
inline int read() {
int out = 0, flag = 1;
char c = getchar();
while (c < 48 || c > 57) {
if (c == '-')
flag = 0;
c = getchar();
}
while (c >= 48 && c <= 57) {
out = (out << 1) + (out << 3) + c - 48;
c = getchar();
}
return flag ? out : -out;
}
char s[maxn];
int main() {
int n = read();
scanf("%s", s + 1);
int l = 1, r = n, ans = 0;
while (l < r) {
while (l < r && s[l] == 'R')
l++;
while (l < r && s[r] == 'W')
r--;
if (l < r && s[l] == 'W' && s[r] == 'R')
ans++, s[l] = 'R', s[r] = 'W';
}
printf("%d\n", ans);
return 0;
} | 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(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
vector<char> Alphabet = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I',
'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R',
'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'};
vector<char> alphabet = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
cout << fixed << setprecision(10);
int N;
cin >> N;
int r = N - 1, cnt = 0;
vector<char> c(N);
rep(i, N) cin >> c[i];
rep(i, N) {
if (c[i] == 'W') {
for (int j = r; j >= i; j--) {
if (c[j] == 'R') {
swap(c[i], c[j]);
r = j;
cnt++;
break;
}
}
}
}
cout << cnt << endl;
return 0;
}
| #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(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
vector<char> Alphabet = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I',
'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R',
'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'};
vector<char> alphabet = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
cout << fixed << setprecision(10);
int N;
cin >> N;
int r = N - 1, cnt = 0;
vector<char> c(N);
rep(i, N) cin >> c[i];
rep(i, N) {
if (c[i] == 'W') {
for (int j = r; j >= i; j--) {
if (c[j] == 'R') {
swap(c[i], c[j]);
r = j;
cnt++;
break;
}
if (j == i) {
cout << cnt << endl;
return 0;
}
}
}
}
cout << cnt << endl;
return 0;
}
| 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(x.second);
cerr << ")";
}
template <class T> void _E(vector<T> x) {
cerr << "[";
for (auto it = x.begin(); it != x.end(); ++it) {
if (it != x.begin())
cerr << ", ";
_E(*it);
}
cerr << "]";
}
void ERR() {}
template <class A, class... B> void ERR(A x, B... y) {
_E(x);
cerr << (sizeof...(y) ? ", " : " ");
ERR(y...);
}
#define debug(x...) \
do { \
cerr << "{ " #x " } -> { "; \
ERR(x); \
cerr << "}" << endl; \
} while (false)
#else
#define debug(...) 114514.1919810
#endif
using ll = long long;
int main(int argc, char *argv[]) {
cin.sync_with_stdio(false), cin.tie(nullptr);
int n;
string s;
cin >> n >> s;
int ans = 0;
for (int i = 0, j = n - 1; i < j;) {
if (s[i] == s[j] && s[i] == 'R') {
++i;
} else if (s[i] == s[j] && s[i] == 'W') {
--j;
} else if (s[i] == 'W') {
++ans, ++i, --j;
}
}
cout << ans << "\n";
}
| #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(x.second);
cerr << ")";
}
template <class T> void _E(vector<T> x) {
cerr << "[";
for (auto it = x.begin(); it != x.end(); ++it) {
if (it != x.begin())
cerr << ", ";
_E(*it);
}
cerr << "]";
}
void ERR() {}
template <class A, class... B> void ERR(A x, B... y) {
_E(x);
cerr << (sizeof...(y) ? ", " : " ");
ERR(y...);
}
#define debug(x...) \
do { \
cerr << "{ " #x " } -> { "; \
ERR(x); \
cerr << "}" << endl; \
} while (false)
#else
#define debug(...) 114514.1919810
#endif
using ll = long long;
int main(int argc, char *argv[]) {
cin.sync_with_stdio(false), cin.tie(nullptr);
int n;
string s;
cin >> n >> s;
int ans = 0;
for (int i = 0, j = n - 1; i < j;) {
if (s[i] == s[j] && s[i] == 'R') {
++i;
} else if (s[i] == s[j] && s[i] == 'W') {
--j;
} else if (s[i] == 'W') {
++ans, ++i, --j;
} else {
++i, --j;
}
}
cout << ans << "\n";
}
| 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 <numeric>
#include <stdio.h>
#include <type_traits>
int main() {
int N;
cin >> N;
std::vector<int> table;
table.resize(N);
for (int i = 0; i < N; ++i) {
char c;
cin >> c;
if (c == 'W') {
table[i] = 1;
}
}
// r = 0
// w = 1
int r = 0;
int last = N - 1;
for (int i = 0; i < N; ++i) {
if (table[i] == 0) {
continue;
}
bool b = false;
for (int j = last; i < j; --j) {
if (table[j] == 0) {
table[j] = 1;
table[i] = 0;
b = true;
last = j;
++r;
break;
}
}
if (b) {
continue;
}
}
printf("%d\n", r);
return 0;
}
|
#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 <numeric>
#include <stdio.h>
#include <type_traits>
int main() {
int N;
cin >> N;
std::vector<int> table;
table.resize(N);
for (int i = 0; i < N; ++i) {
char c;
cin >> c;
if (c == 'W') {
table[i] = 1;
}
}
// r = 0
// w = 1
int r = 0;
int last = N - 1;
for (int i = 0; i < N; ++i) {
if (table[i] == 0) {
continue;
}
bool b = false;
for (int j = last; i < j; --j) {
if (table[j] == 0) {
table[j] = 1;
table[i] = 0;
b = true;
last = j;
++r;
break;
}
}
if (b) {
continue;
}
break;
}
printf("%d\n", r);
return 0;
}
| 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 = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
bool pairCompare(const P &firstElof, const P &secondElof) {
return firstElof.second < secondElof.second;
}
int main() {
int n;
string s;
cin >> n;
cin >> s;
int r, l;
l = 0;
r = s.length() - 1;
int ans = 0;
while (l < r) {
while (s[l] != 'W' or s[r] != 'R') {
if (s[l] != 'W')
l++;
if (s[r] != 'R')
r--;
}
if (l < r) {
ans++;
l++;
r--;
}
}
cout << ans << endl;
}
| #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 = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
bool pairCompare(const P &firstElof, const P &secondElof) {
return firstElof.second < secondElof.second;
}
int main() {
int n;
string s;
cin >> n;
cin >> s;
int r, l;
l = 0;
r = s.length() - 1;
int ans = 0;
while (l < r) {
while (s[l] != 'W' or s[r] != 'R') {
if (s[l] != 'W')
l++;
if (s[r] != 'R')
r--;
if (l >= r or r == 0 or l == s.length()) {
break;
}
}
if (l < r) {
ans++;
l++;
r--;
}
}
cout << ans << endl;
}
| 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' && i < r) {
swap(c.at(i), c.at(r));
++ans;
}
}
cout << ans << "\n"s;
}
| #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' && i < r) {
swap(c.at(i), c.at(r));
++ans;
}
}
cout << ans << "\n"s;
}
| 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 < (ll)(n); i++)
#define rep3(i, m, n) for (ll i = m; i <= (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define MOD 1000000007
#define INF 1000000000
#define LLINF 1e18
void solve_abc_d() {
ll n, m;
// ll a, b;
ll x, y, z;
// ll h, w;
ll k;
string s, rs;
ll l_ans = 0;
cin >> n;
cin >> s;
rs = s;
reverse(ALL(rs));
V r, w;
rep(i, n) {
if (s[i] == 'W') {
w.push_back(i);
}
}
rep(i, n) {
if (rs[i] == 'R') {
r.push_back(i);
}
}
if (n == 1) {
cout << 0 << "\n";
return;
}
auto itr_w = w.begin();
auto itr_r = r.begin();
rep(i, n) {
if (s[i] == 'W') {
if (*itr_w > n - 1 - *itr_r) {
break;
}
itr_w++;
itr_r++;
l_ans++;
}
}
cout << l_ans << "\n";
return;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed;
cout << setprecision(15);
solve_abc_d();
return 0;
}
| #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 < (ll)(n); i++)
#define rep3(i, m, n) for (ll i = m; i <= (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define MOD 1000000007
#define INF 1000000000
#define LLINF 1e18
void solve_abc_d() {
ll n, m;
// ll a, b;
ll x, y, z;
// ll h, w;
ll k;
string s, rs;
ll l_ans = 0;
cin >> n;
cin >> s;
rs = s;
reverse(ALL(rs));
V r, w;
rep(i, n) {
if (s[i] == 'W') {
w.push_back(i);
}
}
rep(i, n) {
if (rs[i] == 'R') {
r.push_back(i);
}
}
if ((w.size() == n) || (r.size() == n)) {
cout << 0 << "\n";
return;
}
auto itr_w = w.begin();
auto itr_r = r.begin();
rep(i, n) {
if (s[i] == 'W') {
if (*itr_w > n - 1 - *itr_r) {
break;
}
itr_w++;
itr_r++;
l_ans++;
}
}
cout << l_ans << "\n";
return;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed;
cout << setprecision(15);
solve_abc_d();
return 0;
}
| 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')
ans--;
}
cout << ans << '\n';
}
| #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')
ans--;
}
cout << ans << '\n';
}
| 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;
vector<char> c(N);
rep(i, N) cin >> c[i];
int count = 0;
rep(i, N) {
if (c[i] == 'R')
++count;
}
if (count == 0 || count == N) {
cout << 0;
return 0;
}
int cw = 0;
int cr = 0;
int r = N - 1;
int l = 0;
rep(i, N) {
if (c[r - i] == 'R') {
rep(j, N - l) {
if (c[l + j] == 'W') {
if (r - i < l + j)
break;
++cr;
c[l + j] = 'R';
c[r - i] = 'W';
l = l + j;
break;
}
}
}
}
cout << cr;
} | #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;
vector<char> c(N);
rep(i, N) cin >> c[i];
int count = 0;
rep(i, N) {
if (c[i] == 'R')
++count;
}
if (count == 0 || count == N) {
cout << 0;
return 0;
}
int cw = 0;
int cr = 0;
int r = N - 1;
int l = 0;
rep(i, N) {
if (c[r - i] == 'R') {
rep(j, N - l) {
if (c[l + j] == 'W') {
if (r - i < l + j) {
cout << cr;
return 0;
}
++cr;
c[l + j] = 'R';
c[r - i] = 'W';
l = l + j;
break;
}
}
}
}
cout << cr;
} | 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 (t--)
using namespace std;
typedef long long ll;
const ll maxn = 1e5 + 10;
// typedef unsigned long long ull;
int main() {
ll n;
scanf("%lld", &n);
char c[maxn];
ll r = 0, w = 0;
scanf("%s", c);
for (ll i = 0; i < strlen(c); i++) {
if (c[i] == 'R') {
r++;
}
}
for (ll i = 0; i < r; i++) {
if (c[i] == 'W')
w++;
}
cout << w << endl;
}
| #include <bits/stdc++.h>
// #define rep(i,a,b) for(int i=a;i<b;i++)
#define T \
int t; \
cin >> t; \
while (t--)
using namespace std;
typedef long long ll;
const ll maxn = 2e5 + 10;
// typedef unsigned long long ull;
int main() {
ll n;
scanf("%lld", &n);
char c[maxn];
ll r = 0, w = 0;
scanf("%s", c);
for (ll i = 0; i < strlen(c); i++) {
if (c[i] == 'R') {
r++;
}
}
for (ll i = 0; i < r; i++) {
if (c[i] == 'W')
w++;
}
cout << w << endl;
}
| 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; j > i; j--) {
if (c.at(j) == 'R') {
counter++;
reverse_count = j - 1;
if (reverse_count == i) {
cout << counter << endl;
return 0;
}
break;
#if DEBUG
cout << i << j << c.at(i) << c.at(j) << endl;
#endif
}
if (j == i - 1) {
cout << counter << endl;
return 0;
}
}
}
}
cout << counter << endl;
return 0;
}
| #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; j > i; j--) {
if (c.at(j) == 'R') {
counter++;
reverse_count = j - 1;
if (reverse_count == i) {
cout << counter << endl;
return 0;
}
break;
#if DEBUG
cout << i << j << c.at(i) << c.at(j) << endl;
#endif
}
if (j == i + 1) {
cout << counter << endl;
return 0;
}
}
}
}
cout << counter << endl;
return 0;
}
| 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) == 'R')
red++;
else
white++;
count.at(i) = white;
}
cout << count.at(red - 1) << endl;
return 0;
} | #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) == 'R')
red++;
else
white++;
count.at(i) = white;
}
if (red == 0)
cout << 0 << endl;
else
cout << count.at(red - 1) << endl;
return 0;
} | 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++;
}
}
}
cout << ans;
return 0;
} | #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--;
}
}
cout << ans;
return 0;
} | 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;
int mae = 0;
for (int j = n - 1; j >= mae; j--) {
if (flag[j] == false) {
for (int i = mae; i < j; i++) {
if (flag[i] == true) {
flag[i] = false;
flag[j] = true;
mae = i + 1;
ans++;
break;
}
}
}
}
cout << ans << endl;
return 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;
int mae = 0;
for (int j = n - 1; j >= mae; j--) {
if (flag[j] == false) {
for (int i = mae; i < j; i++) {
if (flag[i] == true) {
flag[i] = false;
flag[j] = true;
mae = i + 1;
ans++;
break;
}
if (i == j - 1)
mae = i;
}
}
}
cout << ans << endl;
return 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(), s.end(), 'R');
// cout << cnt << endl;
int cnt2 = 0;
int size = s.length();
std::vector<int> vindex;
for (int i = 0; i < size; i++) {
if (s[i] == 'R') {
vindex.push_back(i);
if (i + 1 > cnt)
cnt2++;
}
}
// cout << cnt2 << endl;
// cout << vindex[vindex.size()-1]+1 << endl;
if (cnt == vindex[vindex.size() - 1] + 1) {
cout << 0 << endl;
} else {
cout << cnt2 << endl;
}
return 0;
} | #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(), s.end(), 'R');
if (cnt == 0) {
cout << 0 << endl;
return 0;
}
// cout << cnt << endl;
int cnt2 = 0;
int size = s.length();
std::vector<int> vindex;
for (int i = 0; i < size; i++) {
if (s[i] == 'R') {
vindex.push_back(i);
if (i + 1 > cnt)
cnt2++;
}
}
// cout << cnt2 << endl;
// cout << vindex[vindex.size()-1]+1 << endl;
if (cnt == vindex[vindex.size() - 1] + 1) {
cout << 0 << endl;
} else {
cout << cnt2 << endl;
}
return 0;
} | 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) \
for (typeof(container.begin()) it = container.begin(); \
it != container.end(); it++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * b) / gcd(a, b)
#define inf (long long)1e18
#define F first
#define S second
#define SZ(x) ((int)(x).size())
// #define rep(i,n) for(int i=0;i<n;i++)
// #define repd(i,n) for(int i=n-1;i>=0;i--)
// #define rep1(i,n) for(int i=1;i<=n;i++)
const int N = 1e9 + 7;
int pow(int x, int y) {
int res = 1;
while (y > 0) {
if (y & 1)
res = ((res) * (x));
res %= N;
y = y >> 1;
x = ((x) * (x));
}
return res;
}
int powm(int x, int y, int p) {
int res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int min2(int x, int y) {
if (x <= y)
return x;
else
return y;
}
ll CD(long long n) {
int count = 0;
while (n != 0) {
n = n / 10;
++count;
}
return count;
}
void compute() {
// ll k;
// cin>>k;
// if(k%2==0)
// {
// cout<<"-1";
// }
// else
// {
// // char s[100];
// // cin>>s;
// int i=7;
// ll cd=CD(k);
// for(ll j=0;j<cd;j++)
// {
// i=i*10+7;
// }
// ll t=cd,ans,fnl,p=1;
// while(p)
// {
// if(i>=k)
// {
// ans=i%k;
// if(ans==0)
// {
// fnl=t;
// p=0;
// break;
// }
// }
// // i=7;
// i=i*10+7;
// t++;
// }
// ll yar=CD(i);
// // cout<<yar<<" "<<i;
// cout<<yar;
// }
int n;
cin >> n;
char s[100];
cin >> s;
int ans = 0;
// int k=s.size();
int cntr = 0, cntw = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
cntr++;
else {
cntw++;
}
}
for (int i = 0; i < cntr; i++) {
if (s[i] == 'W')
ans++;
}
cout << ans;
}
int main() {
#ifdef debug
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("log.txt", "w", stderr);
#endif
// int t;
// scanf("%d", &t);
// while (t--)
//{
compute();
// } //end while
#ifdef debug
fprintf(stdout, "\nTIME: %.3lf sec\n", (double)clock() / (CLOCKS_PER_SEC));
#endif
return 0;
} // end main* | #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) \
for (typeof(container.begin()) it = container.begin(); \
it != container.end(); it++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * b) / gcd(a, b)
#define inf (long long)1e18
#define F first
#define S second
#define SZ(x) ((int)(x).size())
// #define rep(i,n) for(int i=0;i<n;i++)
// #define repd(i,n) for(int i=n-1;i>=0;i--)
// #define rep1(i,n) for(int i=1;i<=n;i++)
const int N = 1e9 + 7;
int pow(int x, int y) {
int res = 1;
while (y > 0) {
if (y & 1)
res = ((res) * (x));
res %= N;
y = y >> 1;
x = ((x) * (x));
}
return res;
}
int powm(int x, int y, int p) {
int res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int min2(int x, int y) {
if (x <= y)
return x;
else
return y;
}
ll CD(long long n) {
int count = 0;
while (n != 0) {
n = n / 10;
++count;
}
return count;
}
void compute() {
// ll k;
// cin>>k;
// if(k%2==0)
// {
// cout<<"-1";
// }
// else
// {
// // char s[100];
// // cin>>s;
// int i=7;
// ll cd=CD(k);
// for(ll j=0;j<cd;j++)
// {
// i=i*10+7;
// }
// ll t=cd,ans,fnl,p=1;
// while(p)
// {
// if(i>=k)
// {
// ans=i%k;
// if(ans==0)
// {
// fnl=t;
// p=0;
// break;
// }
// }
// // i=7;
// i=i*10+7;
// t++;
// }
// ll yar=CD(i);
// // cout<<yar<<" "<<i;
// cout<<yar;
// }
int n;
cin >> n;
string s;
cin >> s;
int ans = 0;
// int k=s.size();
int cntr = 0, cntw = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
cntr++;
else {
cntw++;
}
}
for (int i = 0; i < cntr; i++) {
if (s[i] == 'W')
ans++;
}
cout << ans;
}
int main() {
#ifdef debug
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("log.txt", "w", stderr);
#endif
// int t;
// scanf("%d", &t);
// while (t--)
//{
compute();
// } //end while
#ifdef debug
fprintf(stdout, "\nTIME: %.3lf sec\n", (double)clock() / (CLOCKS_PER_SEC));
#endif
return 0;
} // end main* | 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 = vector<vector<bool>>;
using qint = queue<int>;
using sint = stack<int>;
using pii = pair<int, int>;
int main() {
int n;
cin >> n;
vector<char> c(n);
// map<char, int> color;
vector<int> w, r;
// color['R'] = 0;
// color['W'] = 0;
rep(i, n) {
char tmp;
cin >> tmp;
c[i] = tmp;
// color[tmp]++;
if (tmp == 'R') {
r.push_back(i);
} else {
w.push_back(i);
}
}
// if(color['R'] == 0|| color['W'] == 0){
// cout << 0 << endl;
// return 0;
// }
if (r.empty() || w.empty()) {
cout << 0 << endl;
return 0;
}
int ans = 0;
while (1) {
int wnum = w.front();
int rnum = r.back();
if (wnum > rnum)
break;
ans++;
w.erase(w.begin());
r.erase(r.begin() + r.size() - 1);
}
cout << ans << endl;
return 0;
}
// bool setcheck(string &c){
// auto previous = c.front();
// for(int i = 1; i < c.size(); i++){
// auto now = c[i];
// if(previous != now){
// return false;
// }
// previous = now;
// }
// return true;
// }
// int main(){
// int n;
// cin >> n;
// string c;
// cin >> c;
// if(setcheck(c)){
// cout << 0 << endl;
// return 0;
// }
// int ans = 0;
// while(1){
// link1:
// bool flag = false;
// for(int i = 0; i < c.size(); i++){
// if(c[i] == 'W'){
// for(int j = c.size() - 1; j >= 0; j--){
// if(j < i){
// flag = true;
// break;
// }
// if(c[j] == 'R'){
// c[j] = 'W';
// c[i] = 'R';
// ans++;
// goto link1;
// }
// }
// }
// if(flag) break;
// }
// if(flag) break;
// }
// cout << ans << endl;
// return 0;
// } | #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 = vector<vector<bool>>;
using qint = queue<int>;
using sint = stack<int>;
using pii = pair<int, int>;
int main() {
int n;
cin >> n;
vector<char> c(n);
// map<char, int> color;
vector<int> w, r;
// color['R'] = 0;
// color['W'] = 0;
rep(i, n) {
char tmp;
cin >> tmp;
c[i] = tmp;
// color[tmp]++;
if (tmp == 'R') {
r.push_back(i);
} else {
w.push_back(i);
}
}
// if(color['R'] == 0|| color['W'] == 0){
// cout << 0 << endl;
// return 0;
// }
if (r.empty() || w.empty()) {
cout << 0 << endl;
return 0;
}
int ans = 0;
while (1) {
if (w.empty() || r.empty())
break;
int wnum = w.front();
int rnum = r.back();
if (wnum > rnum)
break;
ans++;
w.erase(w.begin());
r.erase(r.begin() + r.size() - 1);
}
cout << ans << endl;
return 0;
}
// bool setcheck(string &c){
// auto previous = c.front();
// for(int i = 1; i < c.size(); i++){
// auto now = c[i];
// if(previous != now){
// return false;
// }
// previous = now;
// }
// return true;
// }
// int main(){
// int n;
// cin >> n;
// string c;
// cin >> c;
// if(setcheck(c)){
// cout << 0 << endl;
// return 0;
// }
// int ans = 0;
// while(1){
// link1:
// bool flag = false;
// for(int i = 0; i < c.size(); i++){
// if(c[i] == 'W'){
// for(int j = c.size() - 1; j >= 0; j--){
// if(j < i){
// flag = true;
// break;
// }
// if(c[j] == 'R'){
// c[j] = 'W';
// c[i] = 'R';
// ans++;
// goto link1;
// }
// }
// }
// if(flag) break;
// }
// if(flag) break;
// }
// cout << ans << endl;
// return 0;
// } | 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(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
using namespace std;
int main(void) {
ll n;
cin >> n;
string s;
cin >> s;
ll res = 0;
priority_queue<ll> que;
rep(i, n) {
if (s[i] == 'R') {
que.push(i);
}
}
rep(i, n) {
if (s[i] == 'W') {
ll x = que.top();
que.pop();
if (x <= i)
break;
s[x] = 'W';
s[i] = 'R';
res++;
}
}
cout << res << endl;
} | #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(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
using namespace std;
int main(void) {
ll n;
cin >> n;
string s;
cin >> s;
ll res = 0;
priority_queue<ll> que;
rep(i, n) {
if (s[i] == 'R') {
que.push(i);
}
}
if (que.size() == 0) {
cout << 0 << endl;
return 0;
}
rep(i, n) {
if (s[i] == 'W') {
ll x = que.top();
que.pop();
if (x <= i)
break;
s[x] = 'W';
s[i] = 'R';
res++;
}
}
cout << res << endl;
} | 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 <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using lint = long long int;
long long int INF = 1001001001001001LL;
int inf = 1000000007;
long long int MOD = 1000000007LL;
double PI = 3.1415926535897932;
template <typename T1, typename T2> inline void chmin(T1 &a, const T2 &b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, const T2 &b) {
if (a < b)
a = b;
}
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
/* do your best */
int main() {
int n;
cin >> n;
string s;
cin >> s;
int ri = n - 1;
int ans = 0;
for (int li = 0; li < n; li++) {
if (s[li] == 'R')
continue;
while (1) {
if (s[ri] == 'R')
break;
ri--;
}
if (li >= ri)
break;
swap(s[li], s[ri]);
ans++;
}
cout << ans << endl;
return 0;
}
| #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 <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using lint = long long int;
long long int INF = 1001001001001001LL;
int inf = 1000000007;
long long int MOD = 1000000007LL;
double PI = 3.1415926535897932;
template <typename T1, typename T2> inline void chmin(T1 &a, const T2 &b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, const T2 &b) {
if (a < b)
a = b;
}
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
/* do your best */
int main() {
int n;
cin >> n;
string s;
cin >> s;
int ri = n - 1;
int ans = 0;
for (int li = 0; li < n; li++) {
if (s[li] == 'R')
continue;
while (1) {
if (ri < 0)
break;
if (s[ri] == 'R')
break;
ri--;
}
if (li >= ri)
break;
swap(s[li], s[ri]);
ans++;
}
cout << ans << endl;
return 0;
}
| 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);
else
white.push_back(i);
}
int answer = 0;
for (int i = red.size(), j = 0; i >= 0 && j < white.size(); i--, j++) {
if (red[i] < white[j])
break;
answer++;
}
cout << answer;
return 0;
} | #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);
else
white.push_back(i);
}
int answer = 0;
for (int i = red.size() - 1, j = 0; i >= 0 && j < white.size(); i--, j++) {
if (red[i] < white[j])
break;
answer++;
}
cout << answer;
return 0;
} | 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) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N;
string C;
cin >> N >> C;
vector<ll> R;
ll ans = 0;
rep(i, C.size()) {
if (C[i] == 'R')
R.push_back(i);
}
rep(i, C.size()) {
if (C[i] == 'W' && i < R.back())
ans++, R.pop_back();
}
cout << ans << endl;
return 0;
}
| #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) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N;
string C;
cin >> N >> C;
vector<ll> R;
ll ans = 0;
rep(i, C.size()) {
if (C[i] == 'R')
R.push_back(i);
}
rep(i, C.size()) {
if (C[i] == 'W' && !R.empty() && i < R.back())
ans++, R.pop_back();
}
cout << ans << endl;
return 0;
}
| 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++)
#define all(a) (a).begin(), (a).end()
#define allg(a) (a).begin(), (a).end(), greator<>()
#define d20 std::setprecision(20)
#define veci vector<int>
#define vecll vector<long long int>
#define vecb vector<bool>
#define vecd vector<double>
template <typename T> T lcm(T a, T b) { return a / __gcd(a, b) * b; }
int main() {
int n, ans = 0;
str s;
cin >> n >> s;
size_t left = 0, right = s.size() - 1;
while (left < right) {
if (s[left] == 'W') {
while (s[right] == 'W' && right >= 0) {
right--;
}
// cout << "left = "<< left << " right = " << right << endl;
if (left < right) {
ans++;
}
right--;
}
left++;
}
cout << ans << endl;
return 0;
} | #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++)
#define all(a) (a).begin(), (a).end()
#define allg(a) (a).begin(), (a).end(), greator<>()
#define d20 std::setprecision(20)
#define veci vector<int>
#define vecll vector<long long int>
#define vecb vector<bool>
#define vecd vector<double>
template <typename T> T lcm(T a, T b) { return a / __gcd(a, b) * b; }
int main() {
int n, ans = 0;
str s;
cin >> n >> s;
int left = 0, right = s.size() - 1;
while (left < right && right >= 0 && left < s.size()) {
if (s[left] == 'W') {
while (s[right] == 'W' && right >= 0) {
right--;
}
// cout << "left = "<< left << " right = " << right << endl;
if (left < right) {
ans++;
}
right--;
}
left++;
}
cout << ans << endl;
return 0;
} | 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 {
int in = 0, cnt = 0;
for (int j = s.size() - 1; j >= 0; j--) {
if (s[j] == 'R') {
if (vec[in] < j) {
cnt++;
swap(s[vec[in++]], s[j]);
if (in >= s.size())
break;
} else {
break;
}
}
}
cout << cnt << endl;
}
}
| #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 {
int in = 0, cnt = 0;
for (int j = s.size() - 1; j >= 0; j--) {
if (s[j] == 'R') {
if (vec[in] < j) {
cnt++;
swap(s[vec[in++]], s[j]);
if (in >= j)
break;
if (in >= s.size())
break;
} else {
break;
}
}
}
cout << cnt << endl;
}
}
| 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};
int dy[4] = {1, -1, 0, 0};
#define LNF __LONG_LONG_MAX__
const ll MOD = 1000000007;
const int MAX = 200000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 法mでのaの逆元を計算
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// 最大公約数
long long gcd(long long x, long long y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
// 最小公倍数
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
// nが大きく,kが10^7程度の時の二項係数
long long com[200005];
void combination(long long n, long long k) {
com[0] = 1;
for (int i = 1; i <= k; i++) {
com[i] = (com[i - 1] * (n - i + 1) % MOD) * modinv(i, MOD) % MOD;
}
}
int main() {
int N;
cin >> N;
string c;
cin >> c;
vector<int> r, w;
for (int i = 0; i < N; i++) {
if (c[i] == 'R')
r.push_back(i);
else
w.push_back(i);
}
if (w.size() == 0) {
cout << 0 << endl;
return 0;
}
int out = w.size();
int cnt = 0;
int ch = 0;
int cm = r.size() - 1;
int m = r[cm];
int h = w[ch];
while (h < m) {
ch++;
cm--;
h = w[ch];
m = r[cm];
cnt++;
}
cout << min(out, cnt) << endl;
return 0;
}
| #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};
int dy[4] = {1, -1, 0, 0};
#define LNF __LONG_LONG_MAX__
const ll MOD = 1000000007;
const int MAX = 200000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 法mでのaの逆元を計算
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// 最大公約数
long long gcd(long long x, long long y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
// 最小公倍数
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
// nが大きく,kが10^7程度の時の二項係数
long long com[200005];
void combination(long long n, long long k) {
com[0] = 1;
for (int i = 1; i <= k; i++) {
com[i] = (com[i - 1] * (n - i + 1) % MOD) * modinv(i, MOD) % MOD;
}
}
int main() {
int N;
cin >> N;
string c;
cin >> c;
vector<int> r, w;
for (int i = 0; i < N; i++) {
if (c[i] == 'R')
r.push_back(i);
else
w.push_back(i);
}
if (w.size() == 0 || r.size() == 0) {
cout << 0 << endl;
return 0;
}
int out = w.size();
int cnt = 0;
int ch = 0;
int cm = r.size() - 1;
int m = r[cm];
int h = w[ch];
while (h < m) {
ch++;
cm--;
h = w[ch];
m = r[cm];
cnt++;
}
cout << min(out, cnt) << endl;
return 0;
}
| 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 = 0, y = n - 1;
while (x != y) {
if (c[x] == 0 && c[y] == 1) {
x++;
if (x != y)
y--;
ans++;
} else if (c[x] == 0 && c[y] == 0)
y--;
else if (c[x] == 1 && c[y] == 1)
x++;
}
cout << ans;
return 0;
} | #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 = 0, y = n - 1;
while (x != y) {
if (c[x] == 0 && c[y] == 1) {
x++;
if (x != y)
y--;
ans++;
} else if (c[x] == 0 && c[y] == 0)
y--;
else if (c[x] == 1 && c[y] == 1)
x++;
else if (c[x] == 1 && c[y] == 0)
x++;
}
cout << ans;
return 0;
} | 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<pair<string, string>>
#define vpi vector<pair<int, int>>
#define all(x) x.begin(), x.end()
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define forn(i, a, n) for (ll i = a; i < n; i++)
#define scan(arr, a, n) \
for (ll i = (a); i < (n); i++) \
cin >> (arr)[i];
#define print(arr, a, n) \
for (ll i = (a); i < (n); i++) \
cout << (arr)[i] << " ";
ll add(ll x, ll y) {
ll res = x + y;
return (res >= mod ? res - mod : res);
}
ll mul(ll x, ll y) {
ll res = x * y;
return (res >= mod ? res % mod : res);
}
ll sub(ll x, ll y) {
ll res = x - y;
return (res < 0 ? res + mod : res);
}
ll power(ll x, ll y) {
ll res = 1;
x %= mod;
while (y) {
if (y & 1)
res = mul(res, x);
y >>= 1;
x = mul(x, x);
}
return res;
}
ll mod_inv(ll x) { return power(x, mod - 2); }
int main() {
fast;
ll n;
cin >> n;
string s;
cin >> s;
ll ans = 0, x = 0, y = n, f = 0;
forn(i, 0, n) {
if (i >= y) {
break;
}
if (s[i] == 'W') {
for (ll j = y - 1; j >= 0; j--) {
if (s[j] == 'R') {
if (j > i) {
// cout<<i<<" "<<j<<endl;
y = j;
// swap(s[i], s[j]);
ans++;
break;
} else {
f = 1;
break;
}
}
}
if (f) {
break;
}
}
}
// cout<<s<<endl;
cout << ans << endl;
} | #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<pair<string, string>>
#define vpi vector<pair<int, int>>
#define all(x) x.begin(), x.end()
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define forn(i, a, n) for (ll i = a; i < n; i++)
#define scan(arr, a, n) \
for (ll i = (a); i < (n); i++) \
cin >> (arr)[i];
#define print(arr, a, n) \
for (ll i = (a); i < (n); i++) \
cout << (arr)[i] << " ";
ll add(ll x, ll y) {
ll res = x + y;
return (res >= mod ? res - mod : res);
}
ll mul(ll x, ll y) {
ll res = x * y;
return (res >= mod ? res % mod : res);
}
ll sub(ll x, ll y) {
ll res = x - y;
return (res < 0 ? res + mod : res);
}
ll power(ll x, ll y) {
ll res = 1;
x %= mod;
while (y) {
if (y & 1)
res = mul(res, x);
y >>= 1;
x = mul(x, x);
}
return res;
}
ll mod_inv(ll x) { return power(x, mod - 2); }
int main() {
fast;
ll n;
cin >> n;
string s;
cin >> s;
ll ans = 0, x = 0, y = n, f = 0, r = 0, w = 0;
forn(i, 0, n) {
if (s[i] == 'R')
r++;
else
w++;
}
if (r == 0 || w == 0) {
cout << "0" << endl;
return 0;
}
forn(i, 0, n) {
if (i >= y) {
break;
}
if (s[i] == 'W') {
for (ll j = y - 1; j >= 0; j--) {
if (s[j] == 'R') {
if (j > i) {
// cout<<i<<" "<<j<<endl;
y = j;
// swap(s[i], s[j]);
ans++;
break;
} else {
f = 1;
break;
}
}
}
if (f) {
break;
}
}
}
// cout<<s<<endl;
cout << ans << endl;
} | 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 -2147483648
#define INT_MAX 2147483647
#define endl "\n"
int main() {
int N;
cin >> N;
string s;
cin >> s;
int rCount = 0;
for (int i = 0; i < N; ++i) {
if (s[i] == 'R')
++rCount;
}
int count = 0;
for (int i = 0; i < s.length(); ++i) {
if (s[i] == 'W') {
for (int j = max(i + 1, rCount); j < s.length(); ++j) {
if (s[j] == 'R') {
swap(s[i], s[j]);
++count;
break;
}
}
}
}
cout << count << endl;
return 0;
}
| #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 -2147483648
#define INT_MAX 2147483647
#define endl "\n"
int main() {
int N;
cin >> N;
string s;
cin >> s;
int rCount = 0;
for (int i = 0; i < N; ++i) {
if (s[i] == 'R')
++rCount;
}
int count = 0;
for (int i = 0; i < rCount; ++i) {
if (s[i] == 'W')
++count;
}
cout << count << endl;
return 0;
}
| 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') {
ans++;
red = j + 1;
break;
}
}
}
}
cout << ans << endl;
}
| #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') {
ans++;
red = j + 1;
break;
}
if (j == N - i - 2) {
red = j + 1;
}
}
if (red == N - i - 1) {
break;
}
}
}
cout << ans << endl;
}
| 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_statistics_node_update> ordered_set; typedef
// tree<long long,null_type,greater<long
// long>,rb_tree_tag,tree_order_statistics_node_update> ordered_set1;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
// define
#define i(X) cin >> X;
#define ol(X) cout << X << endl;
#define os(X) cout << X << " ";
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define line cout << "\n";
#define pbp(a, b) push_back(make_pair(a, b));
#define vll(A) vector<ll> A;
#define ivt(A, n, p) vector<ll> A(n, p);
#define vst(A) sort(A.begin(), A.end());
#define rvst(A) sort(A.rbegin(), A.rend());
#define forin(i, a, b) for (ll i = a; i <= b; i++)
#define forde(i, a, b) for (ll i = a; i >= b; i--)
#define fio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const long long inf = (long long)1e18;
long long MOD = (long long)(1e9 + 7);
ll power(ll x, ll y) {
if (y == 0)
return 1;
ll p = power(x, y / 2) % MOD;
p = (p * p) % MOD;
return (y % 2 == 0) ? p : (x * p) % MOD;
}
ll modInverse(ll a) { return power(a, MOD - 2); }
int main() {
// #ifndef ONLINE_JUDGE
// freopen ("input.txt" , "r" , stdin);
// // freopen ("OUTPUT.txt" , "w" , stdout);
// #endif
fio;
ll testcase = 1;
// cin>>testcase;
while (testcase--) {
ll n;
cin >> n;
ll ans = 0;
string s;
cin >> s;
stack<ll> z;
forin(i, 0, n - 1) {
if (s[i] == 'R') {
z.push(i);
}
}
forin(i, 0, n - 1) {
if (s[i] == 'W' && i < z.top()) {
swap(s[i], s[z.top()]);
z.pop();
ans++;
}
}
cout << ans << endl;
}
return 0;
} | // 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_statistics_node_update> ordered_set; typedef
// tree<long long,null_type,greater<long
// long>,rb_tree_tag,tree_order_statistics_node_update> ordered_set1;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
// define
#define i(X) cin >> X;
#define ol(X) cout << X << endl;
#define os(X) cout << X << " ";
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define line cout << "\n";
#define pbp(a, b) push_back(make_pair(a, b));
#define vll(A) vector<ll> A;
#define ivt(A, n, p) vector<ll> A(n, p);
#define vst(A) sort(A.begin(), A.end());
#define rvst(A) sort(A.rbegin(), A.rend());
#define forin(i, a, b) for (ll i = a; i <= b; i++)
#define forde(i, a, b) for (ll i = a; i >= b; i--)
#define fio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const long long inf = (long long)1e18;
long long MOD = (long long)(1e9 + 7);
ll power(ll x, ll y) {
if (y == 0)
return 1;
ll p = power(x, y / 2) % MOD;
p = (p * p) % MOD;
return (y % 2 == 0) ? p : (x * p) % MOD;
}
ll modInverse(ll a) { return power(a, MOD - 2); }
int main() {
// #ifndef ONLINE_JUDGE
// freopen ("input.txt" , "r" , stdin);
// // freopen ("OUTPUT.txt" , "w" , stdout);
// #endif
fio;
ll testcase = 1;
// cin>>testcase;
while (testcase--) {
ll n;
cin >> n;
ll ans = 0;
string s;
cin >> s;
stack<ll> z;
forin(i, 0, n - 1) {
if (s[i] == 'R') {
z.push(i);
}
}
forin(i, 0, n - 1) {
if (s[i] == 'W' && !z.empty() && i < z.top()) {
z.pop();
ans++;
}
}
cout << ans << endl;
}
return 0;
} | 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, a) for (auto &(x) : (a))
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;
template <typename T> void print(const vector<T> &x) {
int n = x.size();
rep(i, n) {
cout << x[i];
if (i != n - 1)
cout << " ";
else
cout << endl;
}
}
template <typename T> void print(const vector<vector<T>> &x) {
int n = x.size();
rep(i, n) {
rep(j, x[i].size()) { cout << x[i][j] << " "; }
cout << endl;
}
}
template <typename T> void print(const vector<T> &x, int n) {
rep(i, n) {
cout << x[i];
if (i != n - 1)
cout << " ";
else
cout << endl;
}
}
template <typename T> void print(const vector<vector<T>> &x, int n, int m) {
rep(i, n) {
rep(j, m) { cout << x[i][j] << " "; }
cout << endl;
}
}
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(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void input_init() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int main(int argc, char const *argv[]) {
int n;
cin >> n;
string s;
cin >> s;
int ans = 0;
vector<int> idx;
for (int i = n - 1; i >= 0; --i) {
if (s[i] == 'R')
idx.push_back(i);
}
reverse(idx.begin(), idx.end());
rep(i, n) {
if (s[i] == 'W') {
if (i < idx.back()) {
idx.pop_back();
ans++;
}
}
}
cout << ans << '\n';
return 0;
} | #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, a) for (auto &(x) : (a))
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;
template <typename T> void print(const vector<T> &x) {
int n = x.size();
rep(i, n) {
cout << x[i];
if (i != n - 1)
cout << " ";
else
cout << endl;
}
}
template <typename T> void print(const vector<vector<T>> &x) {
int n = x.size();
rep(i, n) {
rep(j, x[i].size()) { cout << x[i][j] << " "; }
cout << endl;
}
}
template <typename T> void print(const vector<T> &x, int n) {
rep(i, n) {
cout << x[i];
if (i != n - 1)
cout << " ";
else
cout << endl;
}
}
template <typename T> void print(const vector<vector<T>> &x, int n, int m) {
rep(i, n) {
rep(j, m) { cout << x[i][j] << " "; }
cout << endl;
}
}
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(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void input_init() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int main(int argc, char const *argv[]) {
int n;
cin >> n;
string s;
cin >> s;
int ans = 0;
vector<int> idx;
for (int i = n - 1; i >= 0; --i) {
if (s[i] == 'R')
idx.push_back(i);
}
reverse(idx.begin(), idx.end());
if (idx.empty()) {
cout << 0 << '\n';
return 0;
}
rep(i, n) {
if (s[i] == 'W') {
if (i < idx.back()) {
idx.pop_back();
ans++;
}
}
}
cout << ans << '\n';
return 0;
} | 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 10005
#define PI 3.14159265358979323846264338327950
#define F first
#define S second
#define ll long long int
#define mod 1000000007
int main() {
FAST;
ll n;
cin >> n;
string s;
cin >> s;
ll x = n - 1;
ll h = 0;
for (ll i = 0; i < n - 1; i++) {
if (s[i] == 'W' && x > i) {
for (ll j = x; j > i; j--) {
if (s[j] == 'R' || !j) {
x = j;
break;
}
}
if (s[i] == 'W' && s[x] == 'R' & x > i) {
swap(s[x], s[i]);
h++;
x--;
}
}
}
cout << h;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(); \
cout.tie();
#define MAXX 10005
#define PI 3.14159265358979323846264338327950
#define F first
#define S second
#define ll long long int
#define mod 1000000007
int main() {
FAST;
ll n;
cin >> n;
string s;
cin >> s;
ll x = n - 1;
ll h = 0;
for (ll i = 0; i < n - 1; i++) {
if (s[i] == 'W') {
for (ll j = x; j >= 0; j--) {
x = j;
if (s[j] == 'R') {
break;
}
}
if (s[i] == 'W' && s[x] == 'R' & x > i) {
swap(s[x], s[i]);
h++;
x--;
}
}
}
cout << h;
return 0;
} | 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 MAX = 510000;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> white;
vector<int> red;
int tmp = 0;
REP(i, n) {
if (s[i] == 'W') {
tmp++;
} else {
if (tmp != 0) {
white.push_back(tmp);
tmp = 0;
}
}
}
tmp = 0;
REP(i, n) {
if (i == 0 && s[i] == 'R') {
tmp = -1;
}
if (s[i] == 'R') {
if (tmp == -1) {
continue;
}
tmp++;
} else {
if (tmp > 0) {
red.push_back(tmp);
}
tmp = 0;
}
}
if (tmp != 0) {
red.push_back(tmp);
}
int ans = 0;
int nowr = red.size() - 1;
if (nowr == -1) {
cout << ans << endl;
return 0;
}
int wsize = white.size();
for (int i = 0; i < wsize; i++) {
if (i == nowr) {
ans += min(white[i], red[nowr]);
break;
}
if (red[nowr] < white[i]) {
white[i] -= red[nowr];
ans += red[nowr];
red[nowr] = 0;
nowr--;
i--;
} else if (red[nowr] == white[i]) {
ans += red[nowr];
red[nowr] = white[i] = 0;
nowr--;
} else {
ans += white[i];
red[nowr] -= white[i];
white[i] = 0;
}
}
cout << ans << endl;
}
| #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 MAX = 510000;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> white;
vector<int> red;
int tmp = 0;
REP(i, n) {
if (s[i] == 'W') {
tmp++;
} else {
if (tmp != 0) {
white.push_back(tmp);
tmp = 0;
}
}
}
tmp = 0;
REP(i, n) {
if (i == 0 && s[i] == 'R') {
tmp = -1;
}
if (s[i] == 'R') {
if (tmp == -1) {
continue;
}
tmp++;
} else {
if (tmp > 0) {
red.push_back(tmp);
}
tmp = 0;
}
}
if (tmp != 0) {
red.push_back(tmp);
}
int ans = 0;
int nowr = red.size() - 1;
if (nowr == -1) {
cout << ans << endl;
return 0;
}
int wsize = white.size();
for (int i = 0; i < wsize; i++) {
if (i == nowr) {
ans += min(white[i], red[nowr]);
break;
}
if (i > nowr) {
break;
}
if (red[nowr] < white[i]) {
white[i] -= red[nowr];
ans += red[nowr];
red[nowr] = 0;
nowr--;
i--;
} else if (red[nowr] == white[i]) {
ans += red[nowr];
red[nowr] = white[i] = 0;
nowr--;
} else {
ans += white[i];
red[nowr] -= white[i];
white[i] = 0;
}
}
cout << ans << endl;
}
| 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 Cn cout << "No" << endl;
#define ull unsigned long long
#define me(a) memset(a, 0, sizeof(a));
#define my(a, b) memcpy(a, b, sizeof(b));
#define cio ios::sync_with_stdio(false)
ll mod = 1e9 + 7;
ll gcd(ll a, ll b) { return (a % b == 0) ? b : gcd(b, a % b); }
char s[200005];
int solve(int n) {
int cnt = 0, ans = 0;
for (int i = 1; i <= n; i++) {
if (s[i] == 'R')
cnt++;
}
for (int i = 1; i <= cnt; i++) {
if (s[i] == 'W')
ans++;
}
cout << ans << endl;
}
int main() {
int n;
cin >> n;
scanf("%s", s + 1);
solve(n);
return 0;
} | #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 Cn cout << "No" << endl;
#define ull unsigned long long
#define me(a) memset(a, 0, sizeof(a));
#define my(a, b) memcpy(a, b, sizeof(b));
#define cio ios::sync_with_stdio(false)
ll mod = 1e9 + 7;
ll gcd(ll a, ll b) { return (a % b == 0) ? b : gcd(b, a % b); }
char s[200005];
inline void solve(int n) {
int cnt = 0, ans = 0;
for (int i = 1; i <= n; i++) {
if (s[i] == 'R')
cnt++;
}
for (int i = 1; i <= cnt; i++) {
if (s[i] == 'W')
ans++;
}
cout << ans << endl;
}
int main() {
int n;
cin >> n;
scanf("%s", s + 1);
solve(n);
return 0;
} | 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 first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
long long binpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
/*struct item{
int m,c;
}; // change item according to the
question; struct segtree{ int size; vector<item>values; void intit(int n){
size=1;
while(size<n)size*=2;
values.resize(2*size);
}
item merge(item a,item b){
if(a.m<b.m)return a;
if(b.m<a.m)return b;
if(a.m==b.m)return {a.m,a.c+b.c};
}
item single(int v){
return {v,1};
}
item NEUTRAL_ELEMENT={INF,1};
void build(vi &a,int x,int lx,int rx){
if(rx-lx==1){
if(lx<sz(a)){
values[x]=single(a[lx]);
}
return;
}
int m=(lx+rx)/2;
build(a,2*x+1,lx,m);
build(a,2*x+2,m,rx);
values[x]=merge(values[2*x+1],values[2*x+2]);
}
void build(vi &a){
build(a,0,0,size);
}
void set(int i,int v,int x,int lx,int rx){
if(rx-lx==1){
values[x]=single(v);
return;
}
int m=(lx+rx)/2;
if(i<m){
set(i,v,2*x+1,lx,m);
}else{
set(i,v,2*x+2,m,rx);
}
values[x]=merge(values[2*x+1],values[2*x+2]);
}
void set(int i,int v){
set(i,v,0,0,size);
}
item calc(int l,int r,int x,int lx,int rx){
if(lx>=r||rx<=l)return NEUTRAL_ELEMENT;
if(l<=lx && rx<=r)return values[x];
int m=(lx+rx)/2;
item s1=calc(l,r,2*x+1,lx,m);
item s2=calc(l,r,2*x+2,m,rx);
return merge(s1,s2);
}
item calc(int l,int r){
return calc(l,r,0,0,size);
}
};*/
int main() {
int n;
cin >> n;
string s;
cin >> s;
vi idxr, idxw;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
idxr.pb(i);
else
idxw.pb(i);
}
if (sz(idxr) == 0 || sz(idxw) == 0) {
cout << 0;
return 0;
}
int cnt = 0;
for (int i = 0; i < sz(idxr); i++) {
if (idxr[sz(idxr) - 1] > idxw[0]) {
int temp = idxr[sz(idxr) - 1];
idxr[sz(idxr) - 1] = idxw[0];
idxw[0] = temp;
cnt++;
sort(all(idxr));
sort(all(idxw));
}
}
cout << cnt;
}
| #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 first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
long long binpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
/*struct item{
int m,c;
}; // change item according to the
question; struct segtree{ int size; vector<item>values; void intit(int n){
size=1;
while(size<n)size*=2;
values.resize(2*size);
}
item merge(item a,item b){
if(a.m<b.m)return a;
if(b.m<a.m)return b;
if(a.m==b.m)return {a.m,a.c+b.c};
}
item single(int v){
return {v,1};
}
item NEUTRAL_ELEMENT={INF,1};
void build(vi &a,int x,int lx,int rx){
if(rx-lx==1){
if(lx<sz(a)){
values[x]=single(a[lx]);
}
return;
}
int m=(lx+rx)/2;
build(a,2*x+1,lx,m);
build(a,2*x+2,m,rx);
values[x]=merge(values[2*x+1],values[2*x+2]);
}
void build(vi &a){
build(a,0,0,size);
}
void set(int i,int v,int x,int lx,int rx){
if(rx-lx==1){
values[x]=single(v);
return;
}
int m=(lx+rx)/2;
if(i<m){
set(i,v,2*x+1,lx,m);
}else{
set(i,v,2*x+2,m,rx);
}
values[x]=merge(values[2*x+1],values[2*x+2]);
}
void set(int i,int v){
set(i,v,0,0,size);
}
item calc(int l,int r,int x,int lx,int rx){
if(lx>=r||rx<=l)return NEUTRAL_ELEMENT;
if(l<=lx && rx<=r)return values[x];
int m=(lx+rx)/2;
item s1=calc(l,r,2*x+1,lx,m);
item s2=calc(l,r,2*x+2,m,rx);
return merge(s1,s2);
}
item calc(int l,int r){
return calc(l,r,0,0,size);
}
};*/
int main() {
int n;
cin >> n;
string s;
cin >> s;
vi idxr, idxw;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
idxr.pb(i);
else
idxw.pb(i);
}
if (sz(idxr) == 0 || sz(idxw) == 0) {
cout << 0;
return 0;
}
int cnt = 0, pos = sz(idxr) - 1;
while (idxr[pos] > idxw[sz(idxr) - pos - 1] && pos >= 0) {
cnt++, pos--;
}
cout << cnt;
}
| 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 << "0" << endl;
return 0;
}
int ans = 0;
while (w < r) {
++ans;
s[r] = 'W';
s[w] = 'R';
w = s.find_first_of("W");
r = s.find_last_of("R");
}
cout << ans << endl;
}
| #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 << endl;
}
| 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); \
cout.tie(NULL)
using namespace std;
// #define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
template <typename T> void __p(T a) { cout << a << " "; }
template <typename T, typename F> void __p(pair<T, F> a) {
cout << "{ ";
__p(a.first);
__p(a.second);
cout << "}";
}
template <typename T> void __f(const char *s, T t) {
cout << s << " : ";
__p(t);
}
template <typename T> void __t(const char *s, const T &x) {
cout << s << " : { ";
for (auto it : x)
__p(it);
cout << "} ";
}
template <typename T, typename... F> void __f(const char *s, T t, F... f) {
int i = 0;
for (;; ++i)
if (s[i] == ',')
break;
cout.write(s, i) << " : ";
__p(t);
cout << " | ";
__f(s + i + 1, f...);
}
#define trace(...) \
{ \
cout << "LINE: " << __LINE__ << " || "; \
__f(#__VA_ARGS__, __VA_ARGS__); \
cout << "\n\n"; \
}
#define debug(...) \
{ \
cout << "LINE: " << __LINE__ << " || "; \
__t(#__VA_ARGS__, __VA_ARGS__); \
cout << "\n\n"; \
}
int begtime = clock();
#define end_time() \
cout << "\n\nTime of execution: " \
<< (clock() - begtime) * 1000 / CLOCKS_PER_SEC << " ms\n\n";
#else
#define trace(...)
#define debug(...)
#define end_time()
#endif
#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef vector<int> vi;
typedef vector<pii> vii;
inline bool equals(ld a, ld b) { return fabs(a - b) < 1e-9; }
inline int gcd(int a, int b) {
a = abs(a);
b = abs(b);
while (a > 0 && b > 0)
(a > b ? a %= b : b %= a);
return (a == 0 ? b : a);
}
inline int power(int x, int n, int m = LLONG_MAX) {
int res = 1;
x = (x % m + m) % m;
while (n) {
if (n & 1)
res = (res * x) % m;
x = (x * x) % m;
n >>= 1;
}
return res;
}
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define uset unordered_set
#define umap unordered_map
#define all(x) x.begin(), x.end()
#define mod 1000000007
void solve() {
int n;
cin >> n;
string s;
cin >> s;
vi w, r;
for (int i = 0; i < n; i++) {
if (s[i] == 'W')
w.pb(i);
else
r.pb(i);
}
int ans = 0;
for (auto x : w) {
int d = r[r.size() - 1];
if (d > x) {
r.pop_back();
ans++;
} else
break;
}
cout << ans << "\n";
}
signed main() {
speedX;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1;
// cin>>t;
for (int i = 1; i <= t; ++i) {
// cout<<"Case #"<<i<<": ";
solve();
}
end_time();
return 0;
}
| #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define speedX \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
using namespace std;
// #define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
template <typename T> void __p(T a) { cout << a << " "; }
template <typename T, typename F> void __p(pair<T, F> a) {
cout << "{ ";
__p(a.first);
__p(a.second);
cout << "}";
}
template <typename T> void __f(const char *s, T t) {
cout << s << " : ";
__p(t);
}
template <typename T> void __t(const char *s, const T &x) {
cout << s << " : { ";
for (auto it : x)
__p(it);
cout << "} ";
}
template <typename T, typename... F> void __f(const char *s, T t, F... f) {
int i = 0;
for (;; ++i)
if (s[i] == ',')
break;
cout.write(s, i) << " : ";
__p(t);
cout << " | ";
__f(s + i + 1, f...);
}
#define trace(...) \
{ \
cout << "LINE: " << __LINE__ << " || "; \
__f(#__VA_ARGS__, __VA_ARGS__); \
cout << "\n\n"; \
}
#define debug(...) \
{ \
cout << "LINE: " << __LINE__ << " || "; \
__t(#__VA_ARGS__, __VA_ARGS__); \
cout << "\n\n"; \
}
int begtime = clock();
#define end_time() \
cout << "\n\nTime of execution: " \
<< (clock() - begtime) * 1000 / CLOCKS_PER_SEC << " ms\n\n";
#else
#define trace(...)
#define debug(...)
#define end_time()
#endif
#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef vector<int> vi;
typedef vector<pii> vii;
inline bool equals(ld a, ld b) { return fabs(a - b) < 1e-9; }
inline int gcd(int a, int b) {
a = abs(a);
b = abs(b);
while (a > 0 && b > 0)
(a > b ? a %= b : b %= a);
return (a == 0 ? b : a);
}
inline int power(int x, int n, int m = LLONG_MAX) {
int res = 1;
x = (x % m + m) % m;
while (n) {
if (n & 1)
res = (res * x) % m;
x = (x * x) % m;
n >>= 1;
}
return res;
}
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define uset unordered_set
#define umap unordered_map
#define all(x) x.begin(), x.end()
#define mod 1000000007
void solve() {
int n;
cin >> n;
string s;
cin >> s;
vi w, r;
for (int i = 0; i < n; i++) {
if (s[i] == 'W')
w.pb(i);
else
r.pb(i);
}
int ans = 0;
for (auto x : w) {
if (r.size() == 0)
break;
int d = r[r.size() - 1];
if (d > x) {
r.pop_back();
ans++;
} else
break;
}
cout << ans << "\n";
}
signed main() {
speedX;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1;
// cin>>t;
for (int i = 1; i <= t; ++i) {
// cout<<"Case #"<<i<<": ";
solve();
}
end_time();
return 0;
}
| 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;
for (ll i = 0; i < w.size(); i++) {
if (r[p] > w[i] && p >= 0) {
ans++;
p--;
}
}
cout << ans << endl;
} | #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;
for (ll i = 0; i < w.size(); i++) {
if (p >= 0 && r[p] > w[i]) {
ans++;
p--;
}
}
cout << ans << endl;
} | 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--)
#define mp(a, b) make_pair(a, b)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define debug(v) cout << #v << ": " << v << endl;
#define fst first
#define snd second
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vc = vector<char>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using vvc = vector<vector<char>>;
using ll = long long int;
using P = pair<long long int, long long int>;
using Map = map<long long int, long long int>;
ll INF = 1LL << 60;
ll M = 1000000007;
int main() {
ll n;
cin >> n;
vc s(n);
rep(i, 0, n) { cin >> s[i]; }
vll w(0);
priority_queue<ll> r;
rep(i, 0, n) {
if (s[i] == 'R') {
r.push(i + 1);
} else {
w.emplace_back(i + 1);
}
}
ll c = 0;
for (auto x : w) {
if (r.top() < x) {
break;
} else {
r.pop();
c++;
}
}
prtl(c);
}
| #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--)
#define mp(a, b) make_pair(a, b)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define debug(v) cout << #v << ": " << v << endl;
#define fst first
#define snd second
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vc = vector<char>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using vvc = vector<vector<char>>;
using ll = long long int;
using P = pair<long long int, long long int>;
using Map = map<long long int, long long int>;
ll INF = 1LL << 60;
ll M = 1000000007;
int main() {
ll n;
cin >> n;
vc s(n);
rep(i, 0, n) { cin >> s[i]; }
vll w(0);
priority_queue<ll> r;
rep(i, 0, n) {
if (s[i] == 'R') {
r.push(i + 1);
} else {
w.emplace_back(i + 1);
}
}
ll c = 0;
if (r.empty()) {
prtl(0);
return 0;
}
for (auto x : w) {
if (r.top() < x) {
break;
} else {
r.pop();
c++;
}
}
prtl(c);
}
| 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 (int i = 0; i < R.size() - 1; i++) {
int x = R[i + 1] - R[i] - 1;
if (x > 0) {
cnt += x;
for (int j = R[i] + 1; j < R[i + 1]; j++)
s[j] = 'R';
while (x--) {
s[R.back()] = 'W';
R.pop_back();
}
}
}
int x = 0;
for (auto it : s) {
if (it == 'W')
x++;
else if (x > 0)
cnt += x, x = 0;
}
cout << cnt;
return 0;
} | #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')
ans++;
cout << ans;
return 0;
} | 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;
for (i = n; i > n - w; i--) {
if (s[i] == 'W')
ans--;
}
cout << ans << endl;
return 0;
} | #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;
for (i = n; i > n - w; i--) {
if (s[i] == 'W')
ans--;
}
cout << ans << endl;
return 0;
}
| 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')
v.pb(i);
}
int ans = 0;
int i = 0;
while (i < n - 1) {
if (s[i] == 'W') {
if (v.back() > i) {
swap(s[i], s[v.back()]);
v.pop_back();
ans++;
} else if (s[i + 1] == 'R') {
s[i] = 'R';
ans++;
}
}
i++;
}
cout << ans << "\n";
return 0;
}
| #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')
v.pb(i);
}
int ans = 0;
int i = 0;
while (i < n - 1) {
if (s[i] == 'W') {
if (!v.empty() && v.back() > i) {
swap(s[i], s[v.back()]);
v.pop_back();
ans++;
} else if (s[i + 1] == 'R') {
s[i] = 'R';
ans++;
}
}
i++;
}
cout << ans << "\n";
return 0;
}
| 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(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define deb(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define deb(x...)
#endif
#define ll long long
#define int long long
#define pb push_back
#define ff first
#define sec second
#define eb emplace_back
#define SORT(a) sort(a.begin(), a.end())
#define SORTR(a) sort(a.rbegin(), a.rend())
#define all(x) x.begin(), x.end()
#define sz(v) ((int)(v.size()))
#define mem(a, val) memset(&a, val, sizeof(a))
#define mid(s, e) ((s) + ((e) - (s)) / 2)
#define endl '\n'
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define fo(i, a, b) for (ll i = (int)(a); i <= (int)(b); ++i)
#define fr(i, b) for (ll i = (int)0; i < (int)(b); ++i)
#define rf(i, a, b) for (ll i = (ll)(a); i >= (ll)(b); --i)
#define read(a, n) \
for (int i = 0; i < n; ++i) \
cin >> a[i];
#define show(a, n) \
for (int i = 0; i < n; ++i) \
cout << a[i] << ' '; \
cout << endl;
const int MOD = 1e9 + 7;
const int INF = 1e18;
void add(ll &x, ll y) {
x += y;
if (x >= MOD)
x -= MOD;
if (x < 0)
x += MOD;
}
// typedef tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> oset;
void solve() {
int n;
cin >> n;
string s;
cin >> s;
vi pos;
for (int i = 0; i < n; ++i)
if (s[i] == 'R')
pos.pb(i);
int j = sz(pos) - 1;
int c = 0;
// deb(pos) ;
for (int i = 0; i < n; ++i) {
if (i > pos[j] || j < 0)
break;
if (s[i] == 'W') {
// deb(i, j);
c++;
j--;
if (j < 0)
break;
}
}
cout << c << endl;
}
int32_t main() {
speedio;
cout << fixed << setprecision(12);
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
*/
int T = 1; // cin>>T;
while (T--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define speedio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define deb(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define deb(x...)
#endif
#define ll long long
#define int long long
#define pb push_back
#define ff first
#define sec second
#define eb emplace_back
#define SORT(a) sort(a.begin(), a.end())
#define SORTR(a) sort(a.rbegin(), a.rend())
#define all(x) x.begin(), x.end()
#define sz(v) ((int)(v.size()))
#define mem(a, val) memset(&a, val, sizeof(a))
#define mid(s, e) ((s) + ((e) - (s)) / 2)
#define endl '\n'
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define fo(i, a, b) for (ll i = (int)(a); i <= (int)(b); ++i)
#define fr(i, b) for (ll i = (int)0; i < (int)(b); ++i)
#define rf(i, a, b) for (ll i = (ll)(a); i >= (ll)(b); --i)
#define read(a, n) \
for (int i = 0; i < n; ++i) \
cin >> a[i];
#define show(a, n) \
for (int i = 0; i < n; ++i) \
cout << a[i] << ' '; \
cout << endl;
const int MOD = 1e9 + 7;
const int INF = 1e18;
void add(ll &x, ll y) {
x += y;
if (x >= MOD)
x -= MOD;
if (x < 0)
x += MOD;
}
// typedef tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> oset;
void solve() {
int n;
cin >> n;
string s;
cin >> s;
vi pos;
for (int i = 0; i < n; ++i)
if (s[i] == 'R')
pos.pb(i);
if (sz(pos) == 0) {
cout << 0 << endl;
return;
}
int j = sz(pos) - 1;
int c = 0;
// deb(pos) ;
for (int i = 0; i < n; ++i) {
if (i > pos[j] || j < 0)
break;
if (s[i] == 'W') {
// deb(i, j);
c++;
j--;
if (j < 0)
break;
}
}
cout << c << endl;
}
int32_t main() {
speedio;
cout << fixed << setprecision(12);
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
*/
int T = 1; // cin>>T;
while (T--) {
solve();
}
return 0;
}
| 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 (int i = n_red; i < N; i++) {
if (c[i + n_red] == 'R')
w_diff++;
}
std::cout << std::max(r_diff, w_diff) << std::endl;
} | #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 (int i = n_red; i < N; i++) {
if (c[i] == 'R')
w_diff++;
}
std::cout << std::max(r_diff, w_diff) << std::endl;
} | 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 {
white.push(i);
}
}
int min_index_white = N;
int max_index_red = -1;
int count = 0;
while (!white.empty()) {
min_index_white = white.top();
max_index_red = red.top();
if (min_index_white > max_index_red) {
break;
}
white.pop();
red.pop();
count++;
}
cout << count << endl;
return 0;
} | #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 {
white.push(i);
}
}
int min_index_white = N;
int max_index_red = -1;
int count = 0;
while (!white.empty()) {
if (red.empty()) {
break;
}
min_index_white = white.top();
max_index_red = red.top();
if (min_index_white > max_index_red) {
break;
}
white.pop();
red.pop();
count++;
}
cout << count << endl;
return 0;
} | 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;
if (color == 'R') {
c[i] = 1;
r_num++;
} else if (color == 'W')
c[i] = 2;
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = func(n, c, r_num);
}
cout << ans << endl;
return 0;
}
| #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;
if (color == 'R') {
c[i] = 1;
r_num++;
} else if (color == 'W')
c[i] = 2;
}
int ans = func(n, c, r_num);
cout << ans << endl;
return 0;
}
| 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() {
fast;
lli n;
cin >> n;
string s;
cin >> s;
lli i, ans = mod, countr = 0, countw = 0;
fr(i, s.length()) {
if (s[i] == 'R')
countr++;
else
countw++;
}
ans = min(countw, countr);
lli count = 0, count1 = 0;
fr(i, countr) {
if (s[i] == 'W')
count++;
}
for (i = s.length() - 1; i >= s.length() - countw; i--) {
if (s[i] == 'R')
count1++;
}
ans = min(ans, count);
ans = min(ans, count1);
cout << ans;
return 0;
} | #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() {
fast;
lli n;
cin >> n;
string s;
cin >> s;
lli i, ans = mod, countr = 0, countw = 0;
fr(i, s.length()) {
if (s[i] == 'R')
countr++;
else
countw++;
}
ans = min(countw, countr);
if (ans == 0) {
cout << 0;
return 0;
}
lli count = 0, count1 = 0;
fr(i, countr) {
if (s[i] == 'W')
count++;
}
for (i = s.length() - 1; i >= s.length() - countw; i--) {
if (s[i] == 'R')
count1++;
}
ans = min(ans, count);
ans = min(ans, count1);
cout << ans;
return 0;
} | 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;
string s, s2;
cin >> n >> s;
int k = s.size();
rep(i, k) {
s2[i] = 'W';
if (s[i] == 'R')
rtow++;
}
int ans = rtow;
rep(i, k) {
s2[i] = 'R';
if (s[i] == 'W')
wtor++;
if (s[i] == 'R')
rtow--;
if (max(wtor, rtow) <= ans)
ans = max(rtow, wtor);
}
cout << ans << endl;
return 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;
string s, s2;
cin >> n >> s;
s2 = s;
int k = s.size();
rep(i, k) {
s2[i] = 'W';
if (s[i] == 'R')
rtow++;
}
int ans = rtow;
rep(i, k) {
s2[i] = 'R';
if (s[i] == 'W')
wtor++;
if (s[i] == 'R')
rtow--;
if (max(wtor, rtow) <= ans)
ans = max(rtow, wtor);
}
cout << ans << endl;
return 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 < N; ++j) {
if (i + j >= N) {
break;
}
if (S[N - 1 - j] == 'R') {
ans += 1;
J = j + 1;
break;
}
}
if (i + J + 1 > N) {
break;
}
}
}
cout << ans << endl;
return 0;
} | #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 < N; ++j) {
if (i + j >= N) {
J = j;
break;
}
if (S[N - 1 - j] == 'R') {
ans += 1;
J = j + 1;
break;
}
}
if (i + J + 1 > N) {
break;
}
}
}
cout << ans << endl;
return 0;
} | 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();
ind.pop();
s[x] = 'W';
s[i] = 'R';
c++;
}
}
cout << c << "\n";
// cout<<s<<"\n";
} | #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 = ind.front();
ind.pop();
s[x] = 'W';
s[i] = 'R';
c++;
}
}
cout << c << "\n";
// cout<<s<<"\n";
} | 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 = 0x3f3f3f3f3f3f3f3fLL;
const int maxn = 45 + 10;
const int mod = 1e9 + 7;
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, ans = 0;
string s;
cin >> n >> s;
set<int> r, w;
for (int i = 0; i < n; ++i) {
if (s[i] == 'R')
r.insert(i);
else
w.insert(i);
}
ans = min(w.size(), r.size());
int moves = 0;
while (!w.empty() && *(w.begin()) < *(r.rbegin())) {
++moves;
int x = *(w.begin());
w.erase(x);
r.insert(x);
x = *(r.rbegin());
r.erase(x);
w.insert(x);
}
ans = min(ans, moves);
cout << ans << endl;
return 0;
}
| #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 = 0x3f3f3f3f3f3f3f3fLL;
const int maxn = 45 + 10;
const int mod = 1e9 + 7;
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, ans = 0;
string s;
cin >> n >> s;
set<int> r, w;
for (int i = 0; i < n; ++i) {
if (s[i] == 'R')
r.insert(i);
else
w.insert(i);
}
ans = min(w.size(), r.size());
int moves = 0;
while (!r.empty() && !w.empty() && *(w.begin()) < *(r.rbegin())) {
++moves;
int x = *(w.begin());
w.erase(x);
r.insert(x);
x = *(r.rbegin());
r.erase(x);
w.insert(x);
}
ans = min(ans, moves);
cout << ans << endl;
return 0;
}
| 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.