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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03200 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
using namespace std;
long long powerexp(long long base, long long exp, int mod) {
long long res = 1;
while (exp > 0) {
if (exp % 2 == 1)
res = (res * base) % mod;
exp = exp >> 1;
base = (base * base) % mod;
}... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
using namespace std;
long long powerexp(long long base, long long exp, int mod) {
long long res = 1;
while (exp > 0) {
if (exp % 2 == 1)
res = (res * base) % mod;
exp = exp >> 1;
base = (base * base) % mod;
}... | replace | 84 | 90 | 84 | 92 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
ll MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
string s;
cin >> s;
int ans = 0;
bool continue_flg... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
ll MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
string s;
cin >> s;
int cnt = 0;
ll ans = 0;
rep... | replace | 15 | 29 | 15 | 22 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define yesno(flg) \
if (flg) { \
cout << "YES" << endl; ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define yesno(flg) \
if (flg) { \
cout << "YES" << endl; ... | replace | 38 | 51 | 38 | 43 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <typeinfo>
#include <utility>
#include <vector>
using n... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <typeinfo>
#include <utility>
#include <vector>
using n... | replace | 117 | 128 | 117 | 123 | TLE | |
p03200 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#define poi 100010
#define int long long
using namespace std;
bool b[poi];
inline int re() {
char c = getchar();
int x = 0, k = 1;
while (c < '0' || c > '9') {
if (c == '-')
k = -1;
c = ... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#define poi 2001000
#define int long long
using namespace std;
bool b[poi];
inline int re() {
char c = getchar();
int x = 0, k = 1;
while (c < '0' || c > '9') {
if (c == '-')
k = -1;
c =... | replace | 6 | 7 | 6 | 7 | 0 | |
p03200 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int N;
N = s.length();
int x[N];
for (int i = 0; i < N; i++) {
if (s[i] == 'B') {
x[i] = 0;
} else if (s[i] == 'W') {
x[i] = 1;
}
}
bool flag = true;
int a;
int st... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int N;
N = s.length();
int x[N];
for (int i = 0; i < N; i++) {
if (s[i] == 'B') {
x[i] = 0;
} else if (s[i] == 'W') {
x[i] = 1;
}
}
long a = 0;
long counter = 0;
f... | replace | 18 | 44 | 18 | 25 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
string s;
void solve() {
const int N = s.length();
int ans = 0;
while (true) {
bool f = false;
for (int i = 0; i + 1 < N; ++i)
if (s[i] == 'B' && s[i + 1] == 'W') {
swap(s[i], s[i + 1]);
... | #include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
string s;
void solve() {
const int N = s.length();
long long ans = 0;
int wcnt = 0;
for (int i = N - 1; i >= 0; --i) {
if (s[i] == 'B')
ans += wcnt;
else
wcnt++;
}
cout << ans << endl;
}
in... | replace | 10 | 22 | 10 | 17 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, c;
cin >> s;
int count = 0;
do {
c = s;
int i = 0;
while (i < (int)s.length() - 1) {
if (s[i] == 'B') {
if (s[i + 1] == 'W') {
s[i + 1] = 'B';
s[i] = 'W';
count++;
i = i + 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, c;
cin >> s;
long long count = 0, gcount = 0;
for (int i = 0; i < (int)s.length(); i++) {
if (s[i] == 'B')
count++;
else
gcount += count;
}
cout << gcount;
}
| replace | 6 | 25 | 6 | 14 | TLE | |
p03200 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n... | replace | 20 | 24 | 20 | 21 | 0 | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define irep(i, a, b) for (ll i = ll(a); i >= ll(b); i--)
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) {
... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define irep(i, a, b) for (ll i = ll(a); i >= ll(b); i--)
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) {
... | replace | 45 | 46 | 45 | 47 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define froop1(a, n) for (int i = a; i < n; i++)
#define froop2(a, n) for (int i = a; i > n; i--)
#define ll long long
#define pq(name, type) priority_queue<type> name
#define vec(name, type, length, value) vector<type> name(length, value)
#define vec2(name, type, length... | #include <bits/stdc++.h>
using namespace std;
#define froop1(a, n) for (int i = a; i < n; i++)
#define froop2(a, n) for (int i = a; i > n; i--)
#define ll long long
#define pq(name, type) priority_queue<type> name
#define vec(name, type, length, value) vector<type> name(length, value)
#define vec2(name, type, length... | replace | 17 | 28 | 17 | 23 | TLE | |
p03200 | C++ | Time Limit Exceeded | /*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB pus... | /*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB pus... | replace | 31 | 41 | 31 | 38 | TLE | |
p03200 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#define ll long long
#define pb push_back
#define popb pop_back
#define ull unsigned long long
#define beg begin
#define mp make_pair
#define pii pair<int, int>
#define piii pair<pii, int>
#define rep(i, n) for (int(i) = (0); i < (n); i++)
#define repA(i,... | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#define ll long long
#define pb push_back
#define popb pop_back
#define ull unsigned long long
#define beg begin
#define mp make_pair
#define pii pair<int, int>
#define piii pair<pii, int>
#define rep(i, n) for (int(i) = (0); i < (n); i++)
#define repA(i,... | replace | 35 | 40 | 35 | 36 | 0 | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi = acos(-1.0);
const ll mod = pow(10, 9) + 7;
const ll INF = pow(2, 31) - 1;
typedef pair<int, int> P;
typedef vector<int> vi;
template <class T> bool chmax(T &a, c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi = acos(-1.0);
const ll mod = pow(10, 9) + 7;
const ll INF = pow(2, 31) - 1;
typedef pair<int, int> P;
typedef vector<int> vi;
template <class T> bool chmax(T &a, c... | replace | 41 | 51 | 41 | 48 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <tuple>
using namespace std;
typedef long long int ll;
int main() {
string S;
cin >> S;
int n = S.size();
ll ans = 0;
bool frag = 1;
for (int i = 0; i < 10000; i++) {
for (int j = 0; j < n; j++) {
if (S[j] == 'B' && S[j + 1] == 'W') {
S[j] = 'W';
... | #include <bits/stdc++.h>
#include <tuple>
using namespace std;
typedef long long int ll;
int main() {
string S;
cin >> S;
int n = S.size();
ll ans = 0;
vector<int> cnt(n);
for (int i = 0; i < n - 1; i++) {
if (S[i] == 'B') {
cnt[i + 1] = cnt[i] + 1;
} else {
cnt[i + 1] = cnt[i];
}
... | replace | 10 | 19 | 10 | 21 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
string s;
cin >> s;
LL cnt = 0;
for (int i = 1; i < s.size(); i++) {
if (s.at(i) == 'W') {
for (int j = 0; j < i; j++) {
if (s.at(j) == 'B') {
cnt++;
}
}
}
}
cout << cnt << endl;... | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
string s;
cin >> s;
LL cnt = 0, bcnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'W' && i > 0) {
cnt += bcnt;
} else if (s.at(i) == 'B') {
bcnt++;
}
}
cout << cnt << endl;
}
| replace | 8 | 16 | 8 | 14 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int num = 0;
for (int i = 0; i < S.size() - 1; ++i) {
if (S[i] == 'B' && S[i + 1] == 'W') {
S[... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
long long num = 0;
long long numW = 0;
for (long long i = 0; i < S.size(); ++i) {
if (S[i] == 'B')... | replace | 12 | 21 | 12 | 20 | TLE | |
p03200 | C++ | Runtime Error | // A - Irreversible operation
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define... | // A - Irreversible operation
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define... | replace | 69 | 70 | 69 | 70 | 0 | |
p03200 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using lli = long long int;
ll MM = 1000000000;
ll mod = MM + 7;
#define INF (ll)1e18
#define pi acos(-1.0)
int main() {
string s;
cin >> s;
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using lli = long long int;
ll MM = 1000000000;
ll mod = MM + 7;
#define INF (ll)1e18
#define pi acos(-1.0)
int main() {
string s;
cin >> s;
... | replace | 25 | 26 | 25 | 26 | 0 | |
p03200 | C++ | Time Limit Exceeded |
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int c = 0, change;
do {
change = 0;
for (int i = 0, n = s.length(); i < n - 1; i++) {
if (s[i] == 'B' && s[i + 1] == 'W') {
s[i] = 'W';
s[i + 1] = 'B';
c++;
change++;
}
}
} whil... |
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
unsigned long long c = 0, cb = 0;
for (int i = 0, n = s.length(); i < n; i++) {
if (s[i] == 'B')
cb++;
else
c += cb;
}
cout << c << endl;
}
| replace | 8 | 21 | 8 | 15 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define MFOR(i, m) for ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define MFOR(i, m) for ... | replace | 40 | 59 | 40 | 46 | TLE | |
p03200 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
char s[12000];
int main() {
scanf("%s", s + 1);
int n = strlen(s + 1);
int tot = 1;
long long ans = 0;
for (int i = 1; i <= n; i++) {
if (s[i] == 'W') {
ans += i - tot;
tot++;
}
}
printf("%lld\n", ans);
} | #include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
char s[1200000];
int main() {
scanf("%s", s + 1);
int n = strlen(s + 1);
int tot = 1;
long long ans = 0;
for (int i = 1; i <= n; i++) {
if (s[i] == 'W') {
ans += i - tot;
tot++;
}
}
printf("%lld\n", ans);
} | replace | 4 | 5 | 4 | 5 | 0 | |
p03200 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define MAXN 100000
#define LL long long
int n;
char s[MAXN + 5];
int cnt;
LL ans;
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (int i = 1; i <= n; i++) {
if (s[i] == 'W')
cnt++, ans += i - cnt;... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define MAXN 500000
#define LL long long
int n;
char s[MAXN + 5];
int cnt;
LL ans;
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (int i = 1; i <= n; i++) {
if (s[i] == 'W')
cnt++, ans += i - cnt;... | replace | 5 | 6 | 5 | 6 | 0 | |
p03200 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <list>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
list<pair<char, int>> l;
int len = s.length();
int i = 0;
while (i < len) {
int c = 0;
char tmp = s[i];
whi... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <list>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
unsigned long long tmpb = 0;
unsigned long long cnt = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'B') {
... | replace | 14 | 36 | 14 | 19 | 0 | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
cin >> ... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
cin >> ... | replace | 35 | 41 | 35 | 39 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w)... | replace | 39 | 49 | 39 | 44 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <time.h>
#include <unorder... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <time.h>
#include <unorder... | replace | 40 | 46 | 40 | 46 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
string s;
cin >> s;
int cnt = 0;
bool a = true;
while (a) {
a = false;
rep(i, s.size()) {
if (s[i] == 'B' && s[i + 1] == 'W') {
s[... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
string s;
cin >> s;
ll cnt = 0;
int Bcount = 0;
rep(i, s.size()) {
if (s[i] == 'B')
Bcount++;
else
cnt += Bcount;
}
cout << cnt ... | replace | 9 | 21 | 9 | 16 | TLE | |
p03200 | C++ | Runtime Error | // failed to generate code
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> inline T sqr(T x) { return x * x... | // failed to generate code
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> inline T sqr(T x) { return x * x... | replace | 51 | 52 | 51 | 52 | 0 | |
p03200 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
char str[100010];
int main(void) {
scanf("%s", str);
int len = strlen(str);
int bcnt = 0;
int wcnt = 0;
for (int i = 0; i < len; i++) {
if (str[i] == 'B') {
bcnt++;
} else {
wcnt++;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
char str[200010];
int main(void) {
scanf("%s", str);
int len = strlen(str);
int bcnt = 0;
int wcnt = 0;
for (int i = 0; i < len; i++) {
if (str[i] == 'B') {
bcnt++;
} else {
wcnt++;
}
... | replace | 5 | 6 | 5 | 6 | 0 | |
p03200 | Python | Time Limit Exceeded | S = input()[::-1]
c = 0
while S.find("WB") != -1:
S = S.replace("WB", "BW", 1)
c += 1
print(c)
| S = input()
S = S[::-1]
y = -1
def x():
global y
y += 1
return y
c = [i - x() for i in range(len(S)) if S[i] == "B"]
print(sum(c))
| replace | 0 | 6 | 0 | 13 | TLE | |
p03200 | Python | Time Limit Exceeded | S = input()
ans = 0
prev = None
while prev != ans:
prev = ans
ans += S.count("BW")
S = S.replace("BW", "WB")
print(ans)
| S = input()
ans = 0
black = 0
for c in S:
if c == "B":
black += 1
else:
ans += black
print(ans)
| replace | 2 | 7 | 2 | 8 | TLE | |
p03200 | Python | Time Limit Exceeded | s = input()
reverse_count = 0
while "BW" in s:
reverse_count += s.count("BW")
s = s.replace("BW", "WB")
print(reverse_count)
| s = list(input())
W_count = 0
ans = 0
for i in range(len(s)):
if s[i] == "W":
ans += i - W_count
W_count += 1
print(ans)
| replace | 0 | 6 | 0 | 8 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int sz = S.size();
int ans = 0;
for (int i = 0; i < sz - 1; i++) {
if (S[i] == 'B' && S[i + 1] == 'W') {
S[i] = 'W';
S[i + 1] = 'B';
if (i > 0 && S[i - 1] == 'B' && S[i] == 'W') {
i -= 2;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int sz = S.size();
long long ans = 0;
int bcnt = 0;
for (int i = 0; i < sz; i++) {
if (S[i] == 'B') {
bcnt++;
} else {
ans += bcnt;
}
}
cout << ans << endl;
return 0;
}
| replace | 9 | 18 | 9 | 16 | TLE | |
p03200 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utili... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utili... | replace | 59 | 60 | 59 | 60 | 0 | |
p03200 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(A) A.begin(), A.end()
int main() {
string s;
cin >> s;
int counter = 0;
while (s.at(0) == 'W') {
s.erase(s.begin());
}
int j = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'W') {
counter += (i -... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(A) A.begin(), A.end()
int main() {
string s;
cin >> s;
ll counter = 0;
int j = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'W') {
counter += (i - j);
j++;
}
}
cout << counter << endl;
... | replace | 12 | 17 | 12 | 13 | 0 | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define lli long long
#define all(i) i.begin(), i.end()
#define rall(i) i.rbegin(), i.rend()
#define rep0(i, j) for (int i = 0; i < j; i++)
#define rep1(i, j) for (int i = 1; i <= j; i++)
#define rep0d(i, j) for (int i = j - 1; i >= 0; i--)
#define MOD 1000000007
#define I... | #include <bits/stdc++.h>
using namespace std;
#define lli long long
#define all(i) i.begin(), i.end()
#define rall(i) i.rbegin(), i.rend()
#define rep0(i, j) for (int i = 0; i < j; i++)
#define rep1(i, j) for (int i = 1; i <= j; i++)
#define rep0d(i, j) for (int i = j - 1; i >= 0; i--)
#define MOD 1000000007
#define I... | replace | 188 | 189 | 188 | 190 | TLE | |
p03200 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int... | replace | 137 | 138 | 137 | 138 | 0 | |
p03200 | C++ | Runtime Error | #include <bits/stdc++.h>
#define X first
#define Y second
#define pb emplace_back
#define FOR(i, a, b) for (int(i) = (a); i < (b); ++(i))
#define EFOR(i, a, b) for (int(i) = (a); i <= (b); ++(i))
#define rep(X, Y) for (int(X) = 0; (X) < (Y); ++(X))
#define reps(X, S, Y) for (int(X) = S; (X) < (Y); ++(X))
#define rrep(X... | #include <bits/stdc++.h>
#define X first
#define Y second
#define pb emplace_back
#define FOR(i, a, b) for (int(i) = (a); i < (b); ++(i))
#define EFOR(i, a, b) for (int(i) = (a); i <= (b); ++(i))
#define rep(X, Y) for (int(X) = 0; (X) < (Y); ++(X))
#define reps(X, S, Y) for (int(X) = S; (X) < (Y); ++(X))
#define rrep(X... | replace | 32 | 33 | 32 | 33 | 0 | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
const int INF = 1145141919, MOD = 1e9 + 7;
const long long LINF = 8931145141919364364, LMOD = 998244353;
inline long long mod(long long n, long long m) { return (n % m + m) % m; }
// const i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
const int INF = 1145141919, MOD = 1e9 + 7;
const long long LINF = 8931145141919364364, LMOD = 998244353;
inline long long mod(long long n, long long m) { return (n % m + m) % m; }
// const i... | replace | 14 | 21 | 14 | 20 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define intt long long
int main() {
std::string s;
std::cin >> s;
intt N = s.size();
intt count = 0;
for (int i = N - 2; i >= 0; --i) {
if (s[i + 1] == 'W'... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define intt long long
int main() {
std::string s;
std::cin >> s;
intt N = s.size();
intt count = 0;
intt num = 0;
for (int i = 0; i < N; ++i) {
if (s[i]... | replace | 15 | 21 | 15 | 21 | TLE | |
p03200 | C++ | Runtime Error | /*----------------by syr----------------*/
/*
----- ----- -----
| | |---| _/
| | | \_ /
----- | \ -----
|---\ \ / |\ /|
| | \_/ | \/ |
| | / \ | |
|---/ / \ | |
*/
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>... | /*----------------by syr----------------*/
/*
----- ----- -----
| | |---| _/
| | | \_ /
----- | \ -----
|---\ \ / |\ /|
| | \_/ | \/ |
| | / \ | |
|---/ / \ | |
*/
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>... | replace | 59 | 60 | 59 | 60 | 0 | |
p03200 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e10
#define rep(i, n) for (int i = 0... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e10
#define rep(i, n) for (int i = 0... | replace | 30 | 42 | 30 | 36 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() {
string S;
cin >> S;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() {
string S;
cin >> S;
... | replace | 13 | 18 | 13 | 19 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#define pb push_back
#def... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#define pb push_back
#def... | replace | 35 | 42 | 35 | 41 | TLE | |
p03200 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountl
#define m_p make_pair
#define inf 200000000000000
#define MAXN 1000001
#define eps 0.0000000001
#define fastio \
io... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountl
#define m_p make_pair
#define inf 200000000000000
#define MAXN 1000001
#define eps 0.0000000001
#define fastio \
io... | delete | 32 | 36 | 32 | 32 | 0 | |
p03200 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
char str[20001];
char c;
int size = 0;
while (cin >> c) {
str[size] = c;
size++;
}
int black = 0, count = 0;
for (int i = 0; i < size; i++) {
if (str[i] == 'B')
black++;
else
count += black;
}
cout ... | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
int size = str.size();
long black = 0, count = 0;
for (int i = 0; i < size; i++) {
if (str[i] == 'B')
black++;
else
count += black;
}
cout << count << endl;
return 0;
} | replace | 6 | 14 | 6 | 10 | 0 | |
p03200 | C++ | Time Limit Exceeded | // In the name of God
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define debug(x) cout << #x ": " << x << endl;
int main() {
IOS str... | // In the name of God
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define debug(x) cout << #x ": " << x << endl;
int main() {
IOS str... | replace | 14 | 34 | 14 | 20 | TLE | |
p03200 | C++ | Runtime Error | #include <stdio.h>
int main() {
long i, count = 0, ans = 0;
char s[111111];
for (i = 0; i < 111111; i++)
s[i] = '\0';
scanf("%s", s);
i = 0;
while (s[i] != '\0') {
if (s[i] == 'B')
count++;
else
ans += count;
i++;
}
printf("%ld\n", ans);
return 0;
} | #include <stdio.h>
int main() {
long i, count = 0, ans = 0;
char s[222222];
for (i = 0; i < 222222; i++)
s[i] = '\0';
scanf("%s", s);
i = 0;
while (s[i] != '\0') {
if (s[i] == 'B')
count++;
else
ans += count;
i++;
}
printf("%ld\n", ans);
return 0;
}
| replace | 3 | 5 | 3 | 5 | 0 | |
p03201 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define MAX 1000000
using namespace std;
int n, a[MAX + 5], cnt;
map<int, int> rec;
int cmp(int a, int b) { return a > b; }
void run() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
rec[a[i]]++;
}
sort(a + 1, a + n + 1, cmp);
}
void solve() {
for (int i ... | #include <bits/stdc++.h>
#define MAX 1000000
using namespace std;
int n, a[MAX + 5], cnt;
map<int, int> rec;
int cmp(int a, int b) { return a > b; }
void run() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
rec[a[i]]++;
}
sort(a + 1, a + n + 1, cmp);
}
void solve() {
for (int i ... | replace | 16 | 17 | 16 | 17 | TLE | |
p03201 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1E5 + 2;
int n;
vector<pair<long long, int>> a(MAXN);
vector<bool> b(MAXN, 0);
vector<pair<int, int>> v;
long long pairing(long long X) {
int l = 0, r = 60, msb = 60;
while (l <= r) {
int mid = (l + r) >> 1;
long long val = (1LL << mid);
... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 2E5 + 2;
int n;
vector<pair<long long, int>> a(MAXN);
vector<bool> b(MAXN, 0);
vector<pair<int, int>> v;
long long pairing(long long X) {
int l = 0, r = 60, msb = 60;
while (l <= r) {
int mid = (l + r) >> 1;
long long val = (1LL << mid);
... | replace | 3 | 4 | 3 | 4 | 0 | |
p03201 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | insert | 475 | 475 | 475 | 477 | TLE | |
p03201 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#... | #include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#... | replace | 56 | 57 | 56 | 57 | TLE | |
p03201 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long a[100];
long long num[300005];
set<long long> s;
set<int> ss;
int cmp(int a, int b) { return a > b; }
map<int, int> m;
int main() {
// long long a[100];
set<int>::const_iterator iter;
set<int>::iterator first;
set<int>::iterator second;
a[0] = 1;
for (... | #include <bits/stdc++.h>
using namespace std;
long long a[100];
long long num[300005];
set<long long> s;
set<int> ss;
int cmp(int a, int b) { return a > b; }
map<int, int> m;
int main() {
// long long a[100];
set<int>::const_iterator iter;
set<int>::iterator first;
set<int>::iterator second;
a[0] = 1;
for (... | insert | 31 | 31 | 31 | 33 | TLE | |
p03201 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<P> vpl;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<P> vpl;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(... | insert | 42 | 42 | 42 | 44 | 0 | |
p03201 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
#define f(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define mod 1000000007
#define P pair<int, int>
using namespace std;
vector<int> v;
int j[50];
signed main() {
int n, c, ans = 0;
cin >> n;
f(i, n) {
cin >> c;
v.push_back(c);
}
... | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define mod 1000000007
#define P pair<int, int>
using namespace std;
vector<int> v;
int j[50];
signed main() {
int n, c, ans = 0;
cin >> n;
f(i, n) {
cin >> c;
v.push_back(c);
}
sort(v.begin(), v.end(... | delete | 1 | 2 | 1 | 1 | TLE | |
p03201 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pb push_back
#define fastcin() \
ios_base::sync_with_stdio(false); \
cin.tie(0)
using namespace std;
typedef pair<int, int... | #include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pb push_back
#define fastcin() \
ios_base::sync_with_stdio(false); \
cin.tie(0)
using namespace std;
typedef pair<int, int... | replace | 11 | 12 | 11 | 12 | 0 | |
p03201 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
unordered_map<int, int> mp;
int a[201010];
int main() {
int n, i, j;
int ans = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
unordered_map<int, int> mp;
int a[201010];
int main() {
int n, i, j;
int ans = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + ... | insert | 23 | 23 | 23 | 27 | TLE | |
p03201 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(long long N, vector<long long> A) {
map<long long, ll> mp;
for (int i = 0; i < N; ++i) {
mp[A[i]]++;
}
sort(A.begin(), A.end());
A.erase(unique(A.begin(), A.end()), A.end());
long long res = 0;
for (int k = 30; k > 0; --k... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(long long N, vector<long long> A) {
map<long long, ll> mp;
for (int i = 0; i < N; ++i) {
mp[A[i]]++;
}
sort(A.begin(), A.end());
A.erase(unique(A.begin(), A.end()), A.end());
long long res = 0;
for (int k = 30; k > 0; --k... | replace | 15 | 16 | 15 | 17 | TLE | |
p03201 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | replace | 55 | 56 | 55 | 58 | TLE | |
p03201 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
int a[20010];
int main() {
int n, ans = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
mp[a[i]]++;
}
while (!mp.empty()) {
map<int, int>::iterator it = mp.end();
it--;
int x = it->first;
if (mp[x] =... | #include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
int a[200010];
int main() {
int n, ans = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
mp[a[i]]++;
}
while (!mp.empty()) {
map<int, int>::iterator it = mp.end();
it--;
int x = it->first;
if (mp[x] ... | replace | 4 | 5 | 4 | 5 | 0 | |
p03201 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define ll long long
#define ll1 1ll
#define ONE 1ll
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; ... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define ll long long
#define ll1 1ll
#define ONE 1ll
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; ... | replace | 124 | 125 | 124 | 125 | TLE | |
p03201 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int arr[100005];
map<int, int> cnt;
int main() {
int n, ans = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
cnt[arr[i]]++;
}
sort(arr, arr + n);
for (int i = n - 1; i >= 0; i--) {
if (!cnt[arr[... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int arr[200005];
map<int, int> cnt;
int main() {
int n, ans = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
cnt[arr[i]]++;
}
sort(arr, arr + n);
for (int i = n - 1; i >= 0; i--) {
if (!cnt[arr[... | replace | 4 | 5 | 4 | 5 | 0 | |
p03201 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MOD 1000000007
#define IN... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MOD 1000000007
#define IN... | insert | 45 | 45 | 45 | 49 | 0 | |
p03201 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using ld = lon... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using ld = lon... | replace | 53 | 56 | 53 | 58 | TLE | |
p03201 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <set>
#define mp make_pair
#define pii pair<int, int>
using namespace std;
set<pii> s;
int n;
int a[200010];
int res = 0;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
sort(a, a + n);
for (int i = 0; i < n; i++)
s.insert(m... | #include <algorithm>
#include <iostream>
#include <set>
#define mp make_pair
#define pii pair<int, int>
using namespace std;
set<pii> s;
int n;
int a[200010];
int res = 0;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
sort(a, a + n);
for (int i = 0; i < n; i++)
s.insert(m... | replace | 23 | 24 | 23 | 24 | TLE | |
p03201 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll ... | replace | 85 | 86 | 85 | 86 | 0 | |
p03201 | C++ | Time Limit Exceeded | // ヘッダー
#include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
// 定数
const int INF = 1e+9;
const int MOD = 1e+9 + 7;
// REPマクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REP2(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define REPD2... | // ヘッダー
#include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
// 定数
const int INF = 1e+9;
const int MOD = 1e+9 + 7;
// REPマクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REP2(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define REPD2... | replace | 45 | 46 | 45 | 48 | TLE | |
p03201 | C++ | Runtime Error | // 17571@nith.ac.in @Ankit Verma
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("O3")
#define ll long long
#define ld long double
//-------------------------------------------------------------------------------------------------... | // 17571@nith.ac.in @Ankit Verma
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("O3")
#define ll long long
#define ld long double
//-------------------------------------------------------------------------------------------------... | replace | 196 | 209 | 196 | 203 | 0 | |
p03201 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define pb push_back
#define eb emplace_back
#define rep(i, a, b) for (auto i = (a); i != (b); ++i)
#define REP(i, n) rep(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
typedef long long ll;
typedef long dou... | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define pb push_back
#define eb emplace_back
#define rep(i, a, b) for (auto i = (a); i != (b); ++i)
#define REP(i, n) rep(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
typedef long long ll;
typedef long dou... | replace | 20 | 21 | 20 | 21 | 0 | |
p03201 | C++ | Runtime Error | /* code by AbhiTaker
____
/ \
/ __ \ _______ __ _ _ _____ _____
/ / \ \ |__ __| / \ | | / / | ___| | _ \
/ /____\ \ ___ | | / /\ \ | |/ / | |__ | |_) )
/ /______\ \ |___| | | / /... | /* code by AbhiTaker
____
/ \
/ __ \ _______ __ _ _ _____ _____
/ / \ \ |__ __| / \ | | / / | ___| | _ \
/ /____\ \ ___ | | / /\ \ | |/ / | |__ | |_) )
/ /______\ \ |___| | | / /... | insert | 65 | 65 | 65 | 70 | -11 | |
p03201 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, s, e) for (int i = (s); i < (e); i++)
#define FOR64(i, s, e) for (ll i = (s); i < (e); i++)
#define ALL(x) (x).begin(), (x).end()
#define SORT(b, e) sort((b), (e))
#define ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, s, e) for (int i = (s); i < (e); i++)
#define FOR64(i, s, e) for (ll i = (s); i < (e); i++)
#define ALL(x) (x).begin(), (x).end()
#define SORT(b, e) sort((b), (e))
#define ... | replace | 41 | 43 | 41 | 42 | TLE | |
p03201 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define pr(x) cout << x << endl;
#define pr2(x, y) cou... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define pr(x) cout << x << endl;
#define pr2(x, y) cou... | replace | 75 | 76 | 75 | 76 | TLE | |
p03201 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <string>
using namespace std;
int digit(int n) {
int count = 0;
while (n > 0) {
n /= 2;
count++;
}
return count;
}
int main() {
int N;
cin >> N;
int A[200010] = {};
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A, A + N, greater<... | #include <algorithm>
#include <bits/stdc++.h>
#include <string>
using namespace std;
int digit(int n) {
int count = 0;
while (n > 0) {
n /= 2;
count++;
}
return count;
}
int main() {
int N;
cin >> N;
int A[200010] = {};
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A, A + N, greater<... | insert | 32 | 32 | 32 | 35 | TLE | |
p03201 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define FAST ios::sync_with_stdio(false)
#define abs(a) ((a) >=... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define FAST ios::sync_with_stdio(false)
#define abs(a) ((a) >=... | replace | 86 | 87 | 86 | 87 | TLE | |
p03201 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define p(s) std::cout << s;
#define pl(s) std::cout << s << endl;
#define all(v) v.begin(), v.end()
#define showVector(v) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define p(s) std::cout << s;
#define pl(s) std::cout << s << endl;
#define all(v) v.begin(), v.end()
#define showVector(v) ... | replace | 212 | 216 | 212 | 213 | TLE | |
p03201 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.sync_with_stdio(0);
int n;
cin >> n;
vector<int> a(n);
map<long, int> m;
for (int i = 0; i < n; ++i) {
cin >> a[i];
m[a[i]]++;
}
vector<int> c(n);
for (int i = 0; i < n; ++i) {
for (long j = 1; j < 1L << 31; j *= 2) {
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.sync_with_stdio(0);
int n;
cin >> n;
vector<int> a(n);
map<long, int> m;
for (int i = 0; i < n; ++i) {
cin >> a[i];
m[a[i]]++;
}
vector<int> c(n);
for (int i = 0; i < n; ++i) {
for (long j = 1; j < 1L << 31; j *= 2) {
i... | replace | 45 | 47 | 45 | 47 | 0 | |
p03201 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
multiset<ll> A;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
A.insert(a);
}
int ans = 0;
while (!A.empty()) {
auto it = A.end();
it--;
ll t = 1;
while (t <= (*it))
t *= 2;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
multiset<ll> A;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
A.insert(a);
}
int ans = 0;
while (!A.empty()) {
auto it = A.end();
it--;
ll t = 1;
while (t <= (*it))
t *= 2;
... | replace | 22 | 23 | 22 | 23 | 0 | |
p03201 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define endl '\n';
using namespace std;
using ll = long long;
using P = pair<int, int>;
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
constexpr double INFD = 1e100;
constexpr ll mod2 ... | #include <bits/stdc++.h>
#define endl '\n';
using namespace std;
using ll = long long;
using P = pair<int, int>;
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
constexpr double INFD = 1e100;
constexpr ll mod2 ... | replace | 41 | 42 | 41 | 42 | TLE | |
p03201 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <set>
#pragma warning(disable : 4996)
using namespace std;
const int maxn = 200005;
typedef long long ll;
multiset<ll> q;
int n;
ll ans;
ll a[maxn];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", &a... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <set>
#pragma warning(disable : 4996)
using namespace std;
const int maxn = 200005;
typedef long long ll;
multiset<ll> q;
int n;
ll ans;
ll a[maxn];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", &a... | replace | 21 | 22 | 21 | 22 | -6 | free(): invalid pointer
|
p03201 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF (long long)1e18 // 1234567890987654321
#define INF 1234567890
#define pb push_back
#... | #include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF (long long)1e18 // 1234567890987654321
#define INF 1234567890
#define pb push_back
#... | replace | 60 | 61 | 60 | 61 | TLE | |
p03201 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef pair<ll, ll> pii;
typedef vector<pii> vpii;
ll INF = (1ll << 60);
int main() {
ll N;
cin >> N;
vi A(N);
for (ll i = 0; i < N; i++) {
cin >> A[i];
}
p... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef pair<ll, ll> pii;
typedef vector<pii> vpii;
ll INF = (1ll << 60);
int main() {
ll N;
cin >> N;
vi A(N);
for (ll i = 0; i < N; i++) {
cin >> A[i];
}
p... | replace | 43 | 44 | 43 | 44 | TLE | |
p03201 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | replace | 55 | 58 | 55 | 59 | TLE | |
p03201 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n;... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n;... | replace | 115 | 116 | 115 | 116 | TLE | |
p03201 | C++ | Runtime Error | #include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define fi first
#define se second
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#de... | #include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define fi first
#define se second
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#de... | replace | 38 | 39 | 38 | 39 | 0 | |
p03201 | C++ | Time Limit Exceeded | // include,using,define等
#pragma region header
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <fun... | // include,using,define等
#pragma region header
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <fun... | replace | 139 | 140 | 139 | 140 | TLE | |
p03201 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int A[100000];
map<int, int> elem_occurence;
int closest_two_power(int n) {
for (int i = 1; i < 32; i++) {
if ((... | #include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int A[200000];
map<int, int> elem_occurence;
int closest_two_power(int n) {
for (int i = 1; i < 32; i++) {
if ((... | replace | 12 | 13 | 12 | 13 | 0 | |
p03201 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | replace | 76 | 77 | 76 | 77 | TLE | |
p03201 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
int N, a[200001];
void solve() {
map<int, int> M;
for (int i = 0; i < N; i++) {
cin >> a[i];
M[a[i]]++;
}
sort(a, a + N);
int ret = 0;
int pw = 1 << 30;
for (int i = N - 1; i ... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
int N, a[200001];
void solve() {
map<int, int> M;
for (int i = 0; i < N; i++) {
cin >> a[i];
M[a[i]]++;
}
sort(a, a + N);
int ret = 0;
int pw = 1 << 30;
for (int i = N - 1; i ... | replace | 18 | 19 | 18 | 19 | -11 | |
p03201 | C++ | Runtime Error | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define PF push_front
#define MP make_pair
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int maxn = 1e5 + 5;
int a[maxn];
map<int, int> mp;
int main() {
ios_base::sync_with_stdio(fal... | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define PF push_front
#define MP make_pair
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int maxn = 2e5 + 5;
int a[maxn];
map<int, int> mp;
int main() {
ios_base::sync_with_stdio(fal... | replace | 10 | 11 | 10 | 11 | 0 | |
p03201 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define N 500005
using namespace std;
map<int, int> mp;
int n, ans, a[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]), mp[a[i]]++;
sort(a + 1, a + n + 1);
for (int i = n; i; i--) {
if (!mp[a[i]])
continue;
for (int j = 1; j <= (1 << 30... | #include <bits/stdc++.h>
#define N 500005
using namespace std;
map<int, int> mp;
int n, ans, a[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]), mp[a[i]]++;
sort(a + 1, a + n + 1);
for (int i = n; i; i--) {
if (!mp[a[i]])
continue;
for (int j = 1; j <= (1 << 30... | replace | 17 | 18 | 17 | 19 | TLE | |
p03201 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
const ll MOD = 1e9 + 7;
int main() {
ll n, b[111111];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> b[i];
}
sort(b, b + n);
vector<ll> a;
vector<ll> cnt;
for (int i = 0; i < n;) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
const ll MOD = 1e9 + 7;
int main() {
ll n, b[222222];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> b[i];
}
sort(b, b + n);
vector<ll> a;
vector<ll> cnt;
for (int i = 0; i < n;) {
... | replace | 8 | 9 | 8 | 9 | 0 | |
p03201 | C++ | Time Limit Exceeded | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, beg... | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, beg... | insert | 27 | 27 | 27 | 31 | TLE | |
p03201 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef lon... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef lon... | replace | 56 | 57 | 56 | 58 | -11 | |
p03201 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define EPS 1e-10
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a... | #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define EPS 1e-10
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a... | insert | 79 | 79 | 79 | 80 | TLE | |
p03201 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define debug(x) cout << #x << ": " << x << endl
#define DEBUG(x) cout << #x << ": " << x << endl
// #define int long long
int powint(int a, int x) {
int res = 1;
REP(i, x) { res = res * a; }... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define debug(x) cout << #x << ": " << x << endl
#define DEBUG(x) cout << #x << ": " << x << endl
// #define int long long
int powint(int a, int x) {
int res = 1;
REP(i, x) { res = res * a; }... | insert | 34 | 34 | 34 | 36 | TLE | |
p03201 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repeat(i, s, n) for (int(i) = s; (i) < (n); (i)++)
#define revrep(i, n) for (int(i) = (n)-1; i >= 0; i--)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
... | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repeat(i, s, n) for (int(i) = s; (i) < (n); (i)++)
#define revrep(i, n) for (int(i) = (n)-1; i >= 0; i--)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
... | replace | 22 | 23 | 22 | 24 | TLE | |
p03201 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef int ll;
const int N = 200005;
const int E = 2000006;
vector<int> g[N];
int ne;
struct Edge {
int from, to;
ll flow, cap;
} edge[E];
int lvl[N], vis[N], pass, start = N - 2, target = N - 1;
int qu[N], qt, px[N];
ll run(int s, int sink, ll... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef int ll;
const int N = 200005;
const int E = 2000006;
vector<int> g[N];
int ne;
struct Edge {
int from, to;
ll flow, cap;
} edge[E];
int lvl[N], vis[N], pass, start = N - 2, target = N - 1;
int qu[N], qt, px[N];
ll run(int s, int sink, ll... | insert | 108 | 108 | 108 | 113 | 0 | |
p03201 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int to[N], n, x, cnt, ans;
map<int, int> Map;
int cmp(int x, int y) { return x > y; }
int main() {
scanf("%d", &n);
while (n--) {
scanf("%d", &x);
if (!Map.count(x))
to[++cnt] = x;
Map[x]++;
}
sort(to + 1, to + cnt + 1, cmp);
... | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int to[N], n, x, cnt, ans;
map<int, int> Map;
int cmp(int x, int y) { return x > y; }
int main() {
scanf("%d", &n);
while (n--) {
scanf("%d", &x);
if (!Map.count(x))
to[++cnt] = x;
Map[x]++;
}
sort(to + 1, to + cnt + 1, cmp);
... | replace | 17 | 22 | 17 | 23 | TLE | |
p03201 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | insert | 1,557 | 1,557 | 1,557 | 1,559 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.