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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02953 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int N = 0;
int max = 0;
int H[10000] = {0};
cin >> N;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = N - 1; i > 0; i--) {
if (H[i] + 1 == H[i - 1]) {
H[i - 1] -= 1;
}
if (H[i] + 1 < H[i - 1]) {
... | #include <iostream>
#include <string>
using namespace std;
int main() {
long long int N = 0;
long long int max = 0;
long long int H[100000] = {0};
cin >> N;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = N - 1; i > 0; i--) {
if (H[i] + 1 == H[i - 1]) {
H[i - 1] -= 1;
}
... | replace | 5 | 8 | 5 | 8 | 0 | |
p02953 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define oset \
tree<int, null_type, less_equal<int>, rb_tree_tag, \
tree_order_statistics_node_update>
using name... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define oset \
tree<int, null_type, less_equal<int>, rb_tree_tag, \
tree_order_statistics_node_update>
using name... | replace | 21 | 28 | 21 | 30 | TLE | |
p02953 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
while (cin >> N) {
int a[10005], i, flag = 1;
for (i = 0; i < N; i++)
scanf("%d", &a[i]);
a[0]--;
for (i = 1; i < N; i++) {
if (a[i] < a[i - 1]) {
flag = 0;
break;
}
if ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
while (cin >> N) {
int a[100005], i, flag = 1;
for (i = 0; i < N; i++)
scanf("%d", &a[i]);
a[0]--;
for (i = 1; i < N; i++) {
if (a[i] < a[i - 1]) {
flag = 0;
break;
}
if... | replace | 9 | 10 | 9 | 10 | 0 | |
p02953 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, a[10010];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i < n; i++)
if (a[i] > a[i + 1]) {
if (a[i] - a[i + 1] >= 2) {
printf("No");
return 0;
}
a[i + 1]++;
}
print... | #include <bits/stdc++.h>
using namespace std;
int n, a[100010];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i < n; i++)
if (a[i] > a[i + 1]) {
if (a[i] - a[i + 1] >= 2) {
printf("No");
return 0;
}
a[i + 1]++;
}
prin... | replace | 2 | 3 | 2 | 3 | 0 | |
p02953 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
// 整数の入力
int n;
int a[100000];
bool flag[100000];
int count, count_s;
unsigned int ans = 0;
int counts = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
// 整数の入力
int n;
int a[100000];
bool flag[100000];
int count, count_s;
unsigned int ans = 0;
int counts = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
if ... | replace | 21 | 22 | 21 | 22 | TLE | |
p02953 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// g++ -g -o yourexe yourfile.cpp
//./yourexe < yourinput.in > youroutput.out
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
using namespace std;
// g++ -g -o yourexe yourfile.cpp
//./yourexe < yourinput.in > youroutput.out
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | replace | 48 | 49 | 48 | 49 | TLE | |
p02953 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
typedef long long LL;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
LL N;
cin >> N;
vector<LL> H(N);
rep(i, N) { cin >> H[i]; }
rep(i, N) {
LL comp = H[N - i ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
typedef long long LL;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
LL N;
cin >> N;
vector<LL> H(N);
rep(i, N) { cin >> H[i]; }
bool noflag = false;
for (int i ... | replace | 17 | 23 | 17 | 24 | TLE | |
p02953 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int ans = 1;
for (int i = N; i > 0; i--) {
if (H.at(i) < H.at(i - 1)) {
H.at(i - 1) -= 1;
if (H.at(i) < H.at(i - 1)) {
ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int ans = 1;
for (int i = N - 1; i > 0; i--) {
if (H.at(i) < H.at(i - 1)) {
H.at(i - 1) -= 1;
if (H.at(i) < H.at(i - 1)) {
ans = 0;
... | replace | 14 | 15 | 14 | 15 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p02953 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
#ifdef DEBUG
#define IFD if (true)
#else
#define IFD if (false)
#endif
int main() {
int N;
int H[10000];
cin >> N;
rep(i, N) { cin >> H[i]; }
rep(i, N - 1) {
if (H[i] <... | #include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
#ifdef DEBUG
#define IFD if (true)
#else
#define IFD if (false)
#endif
int main() {
int N;
int H[100000];
cin >> N;
rep(i, N) { cin >> H[i]; }
rep(i, N - 1) {
if (H[i] ... | replace | 15 | 16 | 15 | 16 | 0 | |
p02953 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h.at(i); }
h.at(0)--;
bool b = true;
rep(i, n - 1) {
if (h.at(i) < h.at(i + 1)) {
h.at(i + 1)--;
}
if (h.at(i) > h.at(i ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h.at(i); }
h.at(0)--;
bool b = true;
rep(i, n - 1) {
if (h.at(i) < h.at(i + 1)) {
h.at(i + 1)--;
}
if (h.at(i) > h.at(i ... | replace | 22 | 24 | 22 | 26 | 0 | |
p02953 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long mod = 1000000007;
typedef long long ll;
int main() {
int n;
cin >> n;
vecto... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long mod = 1000000007;
typedef long long ll;
int main() {
int n;
cin >> n;
vecto... | replace | 25 | 28 | 25 | 26 | 0 | |
p02953 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<int> H(N);
rep(i, N) cin >> H.at(i);
string ans = "Yes";
if (N != 1) {
H.at(0)--;
for (int i = 1; i < N; i++) {
if (H.at(i - 1) == H... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<int> H(N);
rep(i, N) cin >> H.at(i);
string ans = "Yes";
if (N != 1) {
H.at(0)--;
for (int i = 1; i < N; i++) {
if (H.at(i - 1) == H... | replace | 17 | 23 | 17 | 20 | 0 | |
p02953 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N - 1; i++) {
int h = H[i];
int h_min = *min_element(H.begin() + i + 1, H.end());
if (h - h_min >= 2) {
cout << "No";
... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = N - 2; i >= 0; --i) {
if (H[i] == (H[i + 1] + 1)) {
H[i]--;
} else if (H[i] > (H[i + 1] + 1)) {
cout << "No";
return 0;
... | insert | 14 | 14 | 14 | 43 | TLE | |
p02953 | C++ | Runtime Error | #include <cstdio>
int n, a[10001], i;
int main() {
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (i = n - 1; i > 0; i--) {
if (a[i] < a[i - 1])
a[i - 1]--;
if (a[i - 1] == 0 || a[i - 1] > a[i]) {
printf("No\n");
return 0;
}
}
printf("Yes\n");
return 0;
... | #include <cstdio>
int n, a[1000001], i;
int main() {
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (i = n - 1; i > 0; i--) {
if (a[i] < a[i - 1])
a[i - 1]--;
if (a[i - 1] == 0 || a[i - 1] > a[i]) {
printf("No\n");
return 0;
}
}
printf("Yes\n");
return 0... | replace | 2 | 3 | 2 | 3 | 0 | |
p02953 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
const int N = 100000 + 10;
int a[N], n;
bool vis[N];
int main() {
scanf("%d", &n);
a[0] = 0;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++) {
if (i - 1 && a[i - 1] > a[i]) {
if (!vis[a[i - 1]]) {
a[i... | #include <cstdio>
#include <iostream>
using namespace std;
const int N = 100000 + 10;
int a[N], n;
bool vis[N];
int main() {
scanf("%d", &n);
a[0] = 0;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++) {
if (i - 1 && a[i - 1] > a[i]) {
if (!vis[i - 1]) {
a[i - ... | replace | 14 | 15 | 14 | 15 | 0 | |
p02953 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int n;
cin >> n;
int h[n];
rep(i, n) cin >> h[i];
int max = 0;
rep(i, n) {
if (h[i] > max) {
max = h[i];
for (int j = i; j < n; j++) {
if (h[i] - 1 > h[j]) {
puts... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int n;
cin >> n;
int h[n];
rep(i, n) cin >> h[i];
int max = 0;
rep(i, n) {
if (h[i] > max) {
max = h[i];
for (int j = i; j < n; j++) {
if (h[j] > max)
max = h[j];... | replace | 16 | 17 | 16 | 19 | TLE | |
p02953 | C++ | Runtime Error | #include <iostream>
using namespace std;
int a[10005];
int main() {
int n, maxh = 0;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
maxh = a[1];
for (int i = 2; i <= n; i++) {
if (a[i] - maxh <= -2) {
cout << "No";
return 0;
}
maxh = max(a[i], maxh);
}
cout << "Yes";
ret... | #include <iostream>
using namespace std;
int a[100005];
int main() {
int n, maxh = 0;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
maxh = a[1];
for (int i = 2; i <= n; i++) {
if (a[i] - maxh <= -2) {
cout << "No";
return 0;
}
maxh = max(a[i], maxh);
}
cout << "Yes";
re... | replace | 2 | 3 | 2 | 3 | 0 | |
p02953 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
string ans = "Yes";
for (int i = 0; i < n - 1; i++) {
if (h.at(i) - 1 > h.at(i + 1)) {
ans = "No";
break;
}
if (i < n - 1 && h.at(i) - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
string ans = "Yes";
for (int i = 0; i < n; i++) {
if (i == 0) {
h.at(i) -= 1;
} else {
if (h.at(i) < h.at(i - 1)) {
ans = "No";
... | replace | 11 | 19 | 11 | 21 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p02953 | C++ | Runtime Error | #include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N;
unsigned long long int H[10000];
cin >> N;
H[0] = 0;
for (int i = 1; i <= N; ++i) {
cin >> H[i];
}
for (int i = 1; i <= N; ++i) {
int d = H[i] - H[i - 1];
... | #include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N;
unsigned long long int H[100000];
cin >> N;
H[0] = 0;
for (int i = 1; i <= N; ++i) {
cin >> H[i];
}
for (int i = 1; i <= N; ++i) {
int d = H[i] - H[i - 1];
... | replace | 10 | 11 | 10 | 11 | 0 | |
p02953 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18 + 1;
const ll... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18 + 1;
const ll... | replace | 31 | 32 | 31 | 32 | 0 | |
p02953 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
stack<long> h;
for (int i = 0; i < n; i++) {
long n;
cin >> n;
h.push(n);
}
l... | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
stack<long> h;
for (int i = 0; i < n; i++) {
long n;
cin >> n;
h.push(n);
}
l... | replace | 25 | 26 | 25 | 26 | -11 | |
p02953 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = N - 1; i >= 0; i--) {
if (vec[i - 1] > vec[i]) {
vec[i - 1] = vec[i - 1] - 1;
}
}
b... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = N - 1; i > 0; i--) {
if (vec[i - 1] > vec[i]) {
vec[i - 1] = vec[i - 1] - 1;
}
}
bo... | replace | 12 | 13 | 12 | 13 | 0 | |
p02953 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, a[10005], ma;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
ma = max(a[i], ma);
if (ma - a[i] > 1) {
puts("No");
return 0;
}
}
puts("Yes");
} | #include <bits/stdc++.h>
using namespace std;
int n, a[100005], ma;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
ma = max(a[i], ma);
if (ma - a[i] > 1) {
puts("No");
return 0;
}
}
puts("Yes");
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02953 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long H[100000];
for (long long i = 0; i < N; i++) {
cin >> H[i];
}
bool ans = true;
for (long long i = 0; i < N - 1; i++) {
for (long long j = i + 1; j < N - 1; j++) {
if (H[i] - H[j + 1] >= 2) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long H[100000];
for (long long i = 0; i < N; i++) {
cin >> H[i];
}
bool ans = true;
for (long long i = N - 1; i > 0; i--) {
if (H[i - 1] - H[i] > 1) {
ans = false;
break;
} else if (H[i - 1] -... | replace | 12 | 18 | 12 | 19 | TLE | |
p02953 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[... | replace | 15 | 28 | 15 | 23 | 0 | |
p02954 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define oo 0x3f3f3f3f
#define OO 0x3f3f3f3f3f3f3f3f
#define popcount(n) __builtin_popcount(n)
#define popcountll(n) __builtin_pop... | #include <bits/stdc++.h>
// #include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define oo 0x3f3f3f3f
#define OO 0x3f3f3f3f3f3f3f3f
#define popcount(n) __builtin_popcount(n)
#define popcountll(n) __builtin_pop... | replace | 49 | 50 | 49 | 50 | 0 | |
p02954 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
const int N = 1e3 + 3;
int a[N];
int32_t main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
string s;
cin >> s;
int l = s.length();
int now = 0;
for (int i = 0; i < l; i++) {
if (s[i] == 'R')
now++... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
const int N = 1e5 + 3;
int a[N];
int32_t main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
string s;
cin >> s;
int l = s.length();
int now = 0;
for (int i = 0; i < l; i++) {
if (s[i] == 'R')
now++... | replace | 4 | 5 | 4 | 5 | 0 | |
p02954 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
// typedef vector<... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
// typedef vector<... | replace | 57 | 58 | 57 | 58 | 0 | |
p02954 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(A) begin(A), end(A)
#define rall(A) rbegin(A), rend(A)
#define sz(A) int(A.size())
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
... | #include <bits/stdc++.h>
#define all(A) begin(A), end(A)
#define rall(A) rbegin(A), rend(A)
#define sz(A) int(A.size())
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
... | replace | 28 | 29 | 28 | 29 | 0 | |
p02954 | C++ | Runtime Error | #include <bits/stdc++.h>
#define range 524289
#define mod 1000000007
#define eps 1e-9
#define PI 3.14159265358979323846
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define ALL(V) V.begin(), V.end()
#define _ << " " <<
using namespace std;
typedef long long ll;
t... | #include <bits/stdc++.h>
#define range 524289
#define mod 1000000007
#define eps 1e-9
#define PI 3.14159265358979323846
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define ALL(V) V.begin(), V.end()
#define _ << " " <<
using namespace std;
typedef long long ll;
t... | replace | 25 | 29 | 25 | 29 | -11 | |
p02954 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> B, C, E;
B.push_back(0);
for (int i = 1; i < N - 1; i++) {
if (S.at(i) == 'R' && S.at(i + 1) == 'L')
C.push_back(i);
if (S.at(i) == 'L' && S.at(i + 1) == 'R') {
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> B, C, E;
B.push_back(0);
for (int i = 0; i < N - 1; i++) {
if (S.at(i) == 'R' && S.at(i + 1) == 'L')
C.push_back(i);
if (S.at(i) == 'L' && S.at(i + 1) == 'R') {
... | replace | 9 | 10 | 9 | 10 | 0 | |
p02954 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long MOD = 1000000007;
long long modpow(long long a, long long n, long long m) {
long long ans = 1;
while (n) {
if (n & 1) {
ans = (ans * a) % m;
}
a = (a * a) % m;
n >>= 1;
}
return ans;
}
long long combi(lon... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long MOD = 1000000007;
long long modpow(long long a, long long n, long long m) {
long long ans = 1;
while (n) {
if (n & 1) {
ans = (ans * a) % m;
}
a = (a * a) % m;
n >>= 1;
}
return ans;
}
long long combi(lon... | replace | 141 | 146 | 141 | 144 | TLE | |
p02954 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> II;
typedef vector<II> VII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long int LL;
typedef unsigned long long int ULL;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> II;
typedef vector<II> VII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long int LL;
typedef unsigned long long int ULL;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#defin... | replace | 83 | 87 | 83 | 87 | -11 | |
p02954 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MN 100005
char ch[MN], f[MN], tot[MN];
int Find(int a) { return a == f[a] ? a : Find(f[a]); }
int main() {
scanf("%s", ch + 1);
int n = strlen(ch + 1);
for (int i = 1; i <= n; ++i)
f[i] = i;
for (int i = 1; i <= n; ++i) {
if (ch[i] == 'L')
f[i]... | #include <bits/stdc++.h>
using namespace std;
#define MN 100055
char ch[MN];
int f[MN], tot[MN];
int Find(int a) { return a == f[a] ? a : (f[a] = Find(f[a])); }
int main() {
scanf("%s", ch + 1);
int n = strlen(ch + 1);
for (int i = 1; i <= n; ++i)
f[i] = i;
for (int i = 1; i <= n; ++i) {
if (ch[i] == 'L... | replace | 2 | 5 | 2 | 6 | 0 | |
p02954 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
string s;
cin >> s;
vector<int> v(s.size(), 0);
for (int i = 0; i < s.size(); ++i) {
int cnt = 0;
if (s.at(i) == 'R') {
for (int j = i; s.at(j) == s.at(i); ++j) {
++cnt;
}
} els... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
string s;
cin >> s;
vector<int> v(s.size(), 0);
for (int i = 0;;) {
while (i < s.size() && s.at(i) != 'R')
++i;
if (i >= s.size())
break;
int st = i;
while (s.at(i) == 'R')
++... | replace | 8 | 25 | 8 | 29 | TLE | |
p02954 | C++ | Runtime Error | /*==============================================*\
ID: shahidul_brur
Name: Md. Shahidul Islam
Study: CSE, BRUR
Address: Rangpur, Bangladesh
mail: shahidul.cse.brur@gmail.com
FB : fb.com/shahidul.brur
Blog: shahidul-brur.blogspot.com(in Bengali),
shahidul-brur-en.blogspot.com(in English)
... | /*==============================================*\
ID: shahidul_brur
Name: Md. Shahidul Islam
Study: CSE, BRUR
Address: Rangpur, Bangladesh
mail: shahidul.cse.brur@gmail.com
FB : fb.com/shahidul.brur
Blog: shahidul-brur.blogspot.com(in Bengali),
shahidul-brur-en.blogspot.com(in English)
... | replace | 21 | 24 | 21 | 24 | 0 | |
p02954 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int sl = sz(s);
vector<pair<char, int>> a;
vector<int> ans(sl);
char tmp = 'R';
int cnt = 1;
for (int i = 0; i <= sl; i++) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int sl = sz(s);
vector<pair<char, int>> a;
vector<int> ans(sl);
char tmp = 'R';
int cnt = 1;
for (int i = 1; i <= sl; i++) {
... | replace | 14 | 15 | 14 | 15 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p02954 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
char s[10000];
Int a[100000];
cin >> s;
Int len = strlen(s);
int rl = 0;
int l = 0, r =... | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
char s[100000];
Int a[100000];
cin >> s;
Int len = strlen(s);
int rl = 0;
int l = 0, r ... | replace | 13 | 14 | 13 | 14 | 0 | |
p02954 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <utility>
#inc... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <utility>
#inc... | replace | 198 | 199 | 198 | 199 | 0 | |
p02954 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int MOD = (int)1e9 + 7;
int main() {
string s;
cin >> s;
if (s.size() == 2) {
cout << "1 1" << endl;
return 0;
}
s = s + "R";
int n = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int MOD = (int)1e9 + 7;
int main() {
string s;
cin >> s;
if (s.size() == 2) {
cout << "1 1" << endl;
return 0;
}
s = s + "R";
int n = ... | replace | 20 | 21 | 20 | 21 | 0 | |
p02954 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define sre... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define sre... | replace | 36 | 37 | 36 | 37 | -11 | |
p02954 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define EPS 0.0000000001
#define INF 1000000000
#define MOD 1000000007
typedef long long ll;
string s;
int main() {
cin >> s;
int n = s.size();
vector<int> ans(n);
int c = 0;
int mem... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define EPS 0.0000000001
#define INF 1000000000
#define MOD 1000000007
typedef long long ll;
string s;
int main() {
cin >> s;
int n = s.size();
vector<int> ans(n);
int c = 0;
int mem... | insert | 42 | 42 | 42 | 46 | 0 | |
p02954 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep_i(i, n) for (int i = 0; i < (n); ++i)
#define rep_ll(i, n) for (long long i = 0; i < (n); ++i)
#define r_rep_i(i, start, end) for (int i = (start); i < (end); ++i)
#define r_rep_ll(i, start, end) for (long long i = (start); i < (end); ++i)
... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep_i(i, n) for (int i = 0; i < (n); ++i)
#define rep_ll(i, n) for (long long i = 0; i < (n); ++i)
#define r_rep_i(i, start, end) for (int i = (start); i < (end); ++i)
#define r_rep_ll(i, start, end) for (long long i = (start); i < (end); ++i)
... | replace | 26 | 30 | 26 | 28 | -11 | |
p02954 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int ans[10010], n, rr, ll, cr, cl;
string s;
int main() {
cin >> s;
n = s.size();
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
rr = i;
cr = 0;
} else {
cr++;
if (cr % 2 == 0)
ans[rr]++;
else
ans[rr + 1]++;
... | #include <bits/stdc++.h>
using namespace std;
int ans[100010], n, rr, ll, cr, cl;
string s;
int main() {
cin >> s;
n = s.size();
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
rr = i;
cr = 0;
} else {
cr++;
if (cr % 2 == 0)
ans[rr]++;
else
ans[rr + 1]++;
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02954 | Python | Runtime Error | S = input()
count = 1
answer = [0] * len(S)
# RLの切り替わるインデックスをマーク
n = 0
for i in range(len(S) - 1):
if S[i] == S[i + 1]:
count += 1
else:
if S[i + 1] == "R":
# Lを割り振る
answer[n] += count // 2
answer[n + 1] += -(-count // 2)
count = 1
else:
... | S = input()
count = 1
answer = [0] * len(S)
# RLの切り替わるインデックスをマーク
n = 0
for i in range(len(S) - 1):
if S[i] == S[i + 1]:
count += 1
else:
if S[i + 1] == "R":
# Lを割り振る
answer[n] += count // 2
answer[n + 1] += -(-count // 2)
count = 1
else:
... | replace | 27 | 31 | 27 | 29 | 0 | |
p02954 | C++ | Runtime Error |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
/*
||||||||||||||||||||||||||||||||||||||||||||||||
| ||| | |||| |||| | |
| | | | | | | | | | |
| | | | | | | | | | |
... |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
/*
||||||||||||||||||||||||||||||||||||||||||||||||
| ||| | |||| |||| | |
| | | | | | | | | | |
| | | | | | | | | | |
... | replace | 93 | 95 | 93 | 95 | 0 | |
p02954 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int ltoR[100005];
int ans[10005];
int main() {
string S;
cin >> S;
memset(ans, 0, sizeof(ans));
memset(ltoR, 0, sizeof(ltoR));
int lrCounter = 0;
// 移動する距離をメモ
// 右からなめる
for (int i = S.size() - 1; i >= 0; i--) {
if (S[i] == 'R') {
lrCounter++;
... | #include <bits/stdc++.h>
using namespace std;
int ltoR[100005];
int ans[100005];
int main() {
string S;
cin >> S;
memset(ans, 0, sizeof(ans));
memset(ltoR, 0, sizeof(ltoR));
int lrCounter = 0;
// 移動する距離をメモ
// 右からなめる
for (int i = S.size() - 1; i >= 0; i--) {
if (S[i] == 'R') {
lrCounter++;
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02954 | C++ | Runtime Error | #include <algorithm> // sort(ALL())
#include <iomanip>
#include <iostream>
#include <map> // 連想配列 map<string, int>
#include <math.h>
#include <queue> // push(), front(), pop() 先入れ先出し
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using na... | #include <algorithm> // sort(ALL())
#include <iomanip>
#include <iostream>
#include <map> // 連想配列 map<string, int>
#include <math.h>
#include <queue> // push(), front(), pop() 先入れ先出し
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using na... | replace | 46 | 47 | 46 | 47 | 0 | |
p02954 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
string s;
int n, tot = 1, bp[50010] /*break point */, ans[100010];
// r1l0
inline void work(int l, int r, int bpt) {
// cout<<l<<" "<<r<<" "<<bpt<<endl;
if ((r - l + 1) % 2 == 0) {
ans[bpt] = (r - l + 1) / 2;
ans[bpt + 1] = (r - l + 1) / 2;
} else {
if ((b... | #include <bits/stdc++.h>
using namespace std;
string s;
int n, tot = 1, bp[100010] /*break point */, ans[100010];
// r1l0
inline void work(int l, int r, int bpt) {
// cout<<l<<" "<<r<<" "<<bpt<<endl;
if ((r - l + 1) % 2 == 0) {
ans[bpt] = (r - l + 1) / 2;
ans[bpt + 1] = (r - l + 1) / 2;
} else {
if ((... | replace | 3 | 4 | 3 | 4 | 0 | |
p02954 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
string s;
vector<pii> v;
int n;
pii f(int now) {
i... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
string s;
vector<pii> v;
int n;
pii f(int now) {
i... | insert | 21 | 21 | 21 | 23 | TLE | |
p02954 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = pow(10, 9) + 7;
// const int MOD = 998244353;
// const int MOD = ;
int mod(int A, int M) { return (A % M + M) % M; }
const int INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = pow(10, 9) + 7;
// const int MOD = 998244353;
// const int MOD = ;
int mod(int A, int M) { return (A % M + M) % M; }
const int INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
... | replace | 31 | 42 | 31 | 48 | TLE | |
p02954 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | replace | 306 | 307 | 306 | 307 | -11 | |
p02954 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const int mx = 200010;
const ll mod = 1e9 + 7;
string s;
int main() {
cin >> s;
int n = s.size();
vector<int> next(n), ans(n);
for (int... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const int mx = 200010;
const ll mod = 1e9 + 7;
string s;
int main() {
cin >> s;
int n = s.size();
vector<int> next(n), ans(n);
for (int... | replace | 26 | 27 | 26 | 27 | TLE | |
p02954 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
int main() {
static char S[100001];
scanf("%s", S);
int N = (int)strlen(S);
static char len[100000];
int left = 0;
for (int i = 0; i < N;) {
if (S[i] == 'R') {
i++;
continue;
}
// find L
for (int k = left; k < i; k++) {
len[k] = i -... | #include <stdio.h>
#include <string.h>
int main() {
static char S[100001];
scanf("%s", S);
int N = (int)strlen(S);
static int len[100000];
int left = 0;
for (int i = 0; i < N;) {
if (S[i] == 'R') {
i++;
continue;
}
// find L
for (int k = left; k < i; k++) {
len[k] = i - ... | replace | 8 | 9 | 8 | 9 | 0 | |
p02954 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1e9 + 7; // 10^9+7
int main() {
string ss;
cin >> ss;
int s[100002];
int g[100002];
// R = 0 L = 1
int n = (int)ss.length();
for (int i = 0; i < n; i++) {
if (ss[i] == 'R')
s[i] = 0;
else
s[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1e9 + 7; // 10^9+7
int main() {
string ss;
cin >> ss;
int s[100002];
int g[100002];
// R = 0 L = 1
int n = (int)ss.length();
for (int i = 0; i < n; i++) {
if (ss[i] == 'R')
s[i] = 0;
else
s[... | replace | 35 | 36 | 35 | 44 | TLE | |
p02954 | C++ | Time Limit Exceeded | /* #region Head */
//============================================================================
// Name : filename.cpp
// Author : abb
// Version :
// Copyright : [My copyright notice]
// Description : test program
//============================================================================
#pra... | /* #region Head */
//============================================================================
// Name : filename.cpp
// Author : abb
// Version :
// Copyright : [My copyright notice]
// Description : test program
//============================================================================
#pra... | replace | 140 | 141 | 140 | 141 | TLE | |
p02954 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, n) for (int i = n; i >= 0; i--)
#define Rep(i, m, n) for (int i = m; i < n; i++)
#define repeatrev(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long lon... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, n) for (int i = n; i >= 0; i--)
#define Rep(i, m, n) for (int i = m; i < n; i++)
#define repeatrev(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long lon... | replace | 32 | 33 | 32 | 33 | TLE | |
p02954 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | insert | 127 | 127 | 127 | 129 | -6 | terminate called after throwing an instance of 'std::invalid_argument'
what(): stoll
|
p02954 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fu(i, a, b) for (long long i = a; i <= b; i++)
using namespace std;
string s;
int n, a[1111111];
int ans[1111111];
int main() {
#ifndef ONLINE_JUDGE
freopen("input.inp", "r", stdin);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> s;
n = s.size();
fu(i... | #include <bits/stdc++.h>
#define fu(i, a, b) for (long long i = a; i <= b; i++)
using namespace std;
string s;
int n, a[1111111];
int ans[1111111];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> s;
n = s.size();
fu(i, 1, n) {
if (s[i - 1] == 'L')
a[i] = 1;
}
int slL... | delete | 7 | 10 | 7 | 7 | 0 | |
p02954 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | insert | 35 | 35 | 35 | 36 | 0 | |
p02954 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int rf(int x, string s) {
int i = 0;
for (i = x; i < s.size(); i++) {
if (s[i... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int rf(int x, string s) {
int i = 0;
for (i = x; i < s.size(); i++) {
if (s[i... | replace | 48 | 54 | 48 | 55 | TLE | |
p02954 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a[s.size()];
int ans[10005] = {0};
int k = s.size() - 1;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == 'L')
k = i;
if (s[i] == 'R')
a[i] = k;
}
k = 0;
for (int i = 0; i < s.size(); i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a[100005] = {0};
int ans[100005] = {0};
int k = s.size() - 1;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == 'L')
k = i;
if (s[i] == 'R')
a[i] = k;
}
k = 0;
for (int i = 0; i < s.size(); i++... | replace | 6 | 8 | 6 | 8 | 0 | |
p02954 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
//... | #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
//... | replace | 107 | 108 | 107 | 108 | 0 | |
p02955 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
vector<int> a(n);
int sum = 0;
for (auto &x : a) {
cin >> x;
sum += x;
}
vector<int> d;
for (int i = 1; i * i <= sum; i++) {
if (sum % i == 0) {
d.emplace_back(i);
if (i * i < sum) {
d... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
vector<int> a(n);
int sum = 0;
for (auto &x : a) {
cin >> x;
sum += x;
}
vector<int> d;
for (int i = 1; i * i <= sum; i++) {
if (sum % i == 0) {
d.emplace_back(i);
if (i * i < sum) {
d... | replace | 39 | 41 | 39 | 42 | 0 | |
p02955 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | replace | 63 | 64 | 63 | 64 | 0 | |
p02955 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int read() {
int xx = 0, ff = 1;
char ch = ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int read() {
int xx = 0, ff = 1;
char ch = ... | replace | 61 | 62 | 61 | 62 | 0 | |
p02955 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll sum = 0;
rep(i, n) sum += a[i];
set<ll> candidates;
for ... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll sum = 0;
rep(i, n) sum += a[i];
set<ll> candidates;
for ... | replace | 19 | 20 | 19 | 20 | -8 | |
p02955 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define MOD (int)1e9 + 7
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
ll s = 0;
rep(i, n) {
cin >> a[i];
s += a[i];
}
vector<ll> mod;
for (ll i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define MOD (int)1e9 + 7
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
ll s = 0;
rep(i, n) {
cin >> a[i];
s += a[i];
}
vector<ll> mod;
for (ll i =... | replace | 18 | 19 | 18 | 19 | TLE | |
p02955 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define un... | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define un... | replace | 50 | 51 | 50 | 51 | 0 | |
p02955 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> T;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 100000000000000000ll
#define sz(x) ((int)(x).size())
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> T;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 100000000000000000ll
#define sz(x) ((int)(x).size())
#defi... | insert | 38 | 38 | 38 | 40 | 0 | |
p02955 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define F first
#define S second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
#define pb push_back
#define M6 1000009
#define M5 500009
#define pi 3.14159265
#define epsilon 1e-6
ll power(ll x, ... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define F first
#define S second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
#define pb push_back
#define M6 1000009
#define M5 500009
#define pi 3.14159265
#define epsilon 1e-6
ll power(ll x, ... | insert | 67 | 67 | 67 | 71 | 0 | |
p02955 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int n, k, a[1000];
int main() {
cin >> n >> k;
rep(i, n) cin >> a[i];
int sum = 0;
rep(i, n) sum += a[i];
vector<int> g(0);
for (int i = 1; i * i <= sum; ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int n, k, a[1000];
int main() {
cin >> n >> k;
rep(i, n) cin >> a[i];
int sum = 0;
rep(i, n) sum += a[i];
vector<int> g(0);
for (int i = 1; i * i <= sum; ... | replace | 26 | 27 | 26 | 27 | 0 | |
p02955 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int infI = 1e9 + 5;
const long long infL = 1e18;
const int MOD = 1e9 + 7;
const int MAX = 1e5 + 5;
#define mp make_pair
#define pb push_back
#define ii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define vl vector<vector<ll>>
#define vi vector<vect... | #include <bits/stdc++.h>
using namespace std;
const int infI = 1e9 + 5;
const long long infL = 1e18;
const int MOD = 1e9 + 7;
const int MAX = 1e5 + 5;
#define mp make_pair
#define pb push_back
#define ii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define vl vector<vector<ll>>
#define vi vector<vect... | replace | 39 | 41 | 39 | 43 | TLE | |
p02955 | C++ | Runtime Error | #include <bits/stdc++.h>
#define N 505
#define int long long
using namespace std;
int n, m, a[N], p[N], tot, cnt, K, L[N], R[N], M = 10000000;
bool check(int x) {
memset(L, 0, sizeof(L));
memset(R, 0, sizeof(R));
for (int i = 1; i <= n; i++) {
int t = a[i] % x;
L[i] = t;
}
sort(L + 1, L + n + 1);
R[... | #include <bits/stdc++.h>
#define N 505
#define int long long
using namespace std;
int n, m, a[N], p[N * N], tot, cnt, K, L[N], R[N];
bool check(int x) {
memset(L, 0, sizeof(L));
memset(R, 0, sizeof(R));
for (int i = 1; i <= n; i++) {
int t = a[i] % x;
L[i] = t;
}
sort(L + 1, L + n + 1);
R[n] = x - L... | replace | 4 | 5 | 4 | 5 | 0 | |
p02955 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
vector<long long> div(long long n) {
vector<long long> res;
for (long long i = 1; i * i <= n; ++i) {
if (n % i == 0) {
res.emplace_back(i);
if (i != n / i)
res.emplace_back(n / i);
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
vector<long long> div(long long n) {
vector<long long> res;
for (long long i = 1; i * i <= n; ++i) {
if (n % i == 0) {
res.emplace_back(i);
if (i != n / i)
res.emplace_back(n / i);
... | replace | 48 | 49 | 48 | 49 | -11 | |
p02955 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T> void cout_vec(const vector<T> &vec) {
for (auto it... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T> void cout_vec(const vector<T> &vec) {
for (auto it... | insert | 47 | 47 | 47 | 51 | 0 | |
p02955 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.rbegin(), A.rend());
auto minOp = [&](ll x) {
// Aを全てxで割り切れるようにするときにかかる最小回数
vector<ll> mod(N);
for (ll i = 0; i < N; ... | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.rbegin(), A.rend());
auto minOp = [&](ll x) {
// Aを全てxで割り切れるようにするときにかかる最小回数
vector<ll> mod(N);
for (ll i = 0; i < N; ... | replace | 22 | 23 | 22 | 23 | 0 | |
p02955 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
... | replace | 95 | 97 | 95 | 99 | TLE | |
p02955 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF int(1e9 + 1)
#define CL(A, I) (memset(A, I, sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout << " " << #X ": " << X << endl;
#define EQ(A, B) (A + ZERO > B && A - ZERO < B)
typedef long long ll;
typedef pair<... | #include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF int(1e9 + 1)
#define CL(A, I) (memset(A, I, sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout << " " << #X ": " << X << endl;
#define EQ(A, B) (A + ZERO > B && A - ZERO < B)
typedef long long ll;
typedef pair<... | replace | 87 | 88 | 87 | 88 | 2 | |
p02955 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n;
cin >> k;
int a[n];
int asum;
for (int i = 0; i < n; i++) {
cin >> a[i];
asum += a[i];
}
int divisor[asum];
int cursor = 0;
for (int i = 1; i * i <= a... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n;
cin >> k;
int a[n];
int asum;
for (int i = 0; i < n; i++) {
cin >> a[i];
asum += a[i];
}
int divisor[30000];
int cursor = 0;
for (int i = 1; i * i <= ... | replace | 16 | 17 | 16 | 17 | -11 | |
p02955 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
freopen("in.txt", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
int A[n];
vector<int> factors;
int sum = 0;
for (int i = 0; i < n; ++i) {
cin >> A[i];
sum += A[i];
}
for (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
// freopen("in.txt", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
int A[n];
vector<int> factors;
int sum = 0;
for (int i = 0; i < n; ++i) {
cin >> A[i];
sum += A[i];
}
fo... | replace | 6 | 7 | 6 | 7 | 0 | |
p02955 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, k;
int a[505];
int factor[100000];
int need[100000];
int sum = 0;
bool good(int x) {
int cnt = 0;
for (int i = 0; i < n; i++) {
int t = a[i] % x;
if (t)
need[++cnt] = t;
}
sort(need + 1, need + 1 + cnt);
int have = k;
int l = 1, r = cnt;... | #include <bits/stdc++.h>
using namespace std;
int n, k;
int a[505];
int factor[100000];
int need[100000];
int sum = 0;
bool good(int x) {
int cnt = 0;
for (int i = 0; i < n; i++) {
int t = a[i] % x;
if (t)
need[++cnt] = t;
}
sort(need + 1, need + 1 + cnt);
int have = k;
int l = 1, r = cnt;... | replace | 38 | 42 | 38 | 39 | 0 | |
p02955 | C++ | Runtime Error | // #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
... | // #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
... | replace | 21 | 25 | 21 | 22 | 0 | |
p02955 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define so second
#define ps push_back
#define ld long double
#define mod 1000000007
int check(vector<int> v, int n, int k) {
vector<int> p = v, s = v;
int sum = 0, i;
for (i = 1; i < v.size(); i++) {
p[i] += p[i - 1];
... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define so second
#define ps push_back
#define ld long double
#define mod 1000000007
int check(vector<int> v, int n, int k) {
vector<int> p = v, s = v;
int sum = 0, i;
for (i = 1; i < v.size(); i++) {
p[i] += p[i - 1];
... | insert | 50 | 50 | 50 | 52 | 0 | |
p02955 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
const int MOD = 1e18;
int mpow(int a, int b, int p = MOD) {
a = a % p;
int res = 1;
while (b > 0) {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
const int MOD = 1e18;
int mpow(int a, int b, int p = MOD) {
a = a % p;
int res = 1;
while (b > 0) {
... | replace | 60 | 61 | 60 | 61 | TLE | |
p02955 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const long long INF = 1LL << 60;
const int MOD = 1000000000 + 7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template <typename T> inline string ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const long long INF = 1LL << 60;
const int MOD = 1000000000 + 7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template <typename T> inline string ... | replace | 48 | 49 | 48 | 49 | 0 | |
p02955 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll sum = 0LL;
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (ll i = 0LL; i < N; i++) {
cin >> A[i];
sum += A[i];
}
set<ll> s;
for (ll i = 1LL; i * i <= sum; i++) {
if (sum % i == 0LL) {
s.insert(i);
s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll sum = 0LL;
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (ll i = 0LL; i < N; i++) {
cin >> A[i];
sum += A[i];
}
set<ll> s;
for (ll i = 1LL; i * i <= sum; i++) {
if (sum % i == 0LL) {
s.insert(i);
s... | replace | 16 | 17 | 16 | 17 | -8 | |
p02955 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define itn int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define range(a) a.begin(), a.end()
#define print(A, n) \
rep(i, 0, n) { cout << (i ? " " : "") << A[i]; } \
cout << e... | #include <bits/stdc++.h>
using namespace std;
#define itn int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define range(a) a.begin(), a.end()
#define print(A, n) \
rep(i, 0, n) { cout << (i ? " " : "") << A[i]; } \
cout << e... | replace | 42 | 49 | 42 | 47 | TLE | |
p02955 | Python | Time Limit Exceeded | N, K = map(int, input().split())
A = list(map(int, input().split()))
divs = []
maxA = sum(A)
for i in range(1, maxA + 1):
if maxA % i == 0:
divs.append(i)
divs.append(maxA // i)
divs.sort(reverse=True)
for d in divs:
rest = [a % d for a in A]
rest.sort(reverse=True)
restSum = sum(rest... | N, K = map(int, input().split())
A = list(map(int, input().split()))
divs = []
maxA = sum(A)
for i in range(1, int(maxA**0.5) + 1):
if maxA % i == 0:
divs.append(i)
divs.append(maxA // i)
divs.sort(reverse=True)
for d in divs:
rest = [a % d for a in A]
rest.sort(reverse=True)
restSum ... | replace | 5 | 6 | 5 | 6 | TLE | |
p02955 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long k;
cin >> k;
vector<long long> a(n);
long long sum_a = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum_a += a[i];
}
for (int i = sum_a; i >= 0; i--) {
if (sum_a % i != 0)
continue;
vector<lon... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long k;
cin >> k;
vector<long long> a(n);
long long sum_a = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum_a += a[i];
}
set<long long> factors;
for (int i = 1; i * i <= sum_a; i++) {
if (sum_a % i == 0) ... | replace | 14 | 15 | 14 | 23 | TLE | |
p02956 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 100, mod = 998244353;
void plusle(int &a, int b) {
a += b;
if (a >= mod)
a -= mod;
return;
}
void minun(int &a, int b) {
a -= b;
if (a < 0)
a += mod;
return;
}
int add(int a, int b) {
a += b;
return a >= mod ? a - mod : a;
}
in... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 100, mod = 998244353;
void plusle(int &a, int b) {
a += b;
if (a >= mod)
a -= mod;
return;
}
void minun(int &a, int b) {
a -= b;
if (a < 0)
a += mod;
return;
}
int add(int a, int b) {
a += b;
return a >= mod ? a - mod : a;
}
in... | replace | 27 | 28 | 27 | 32 | 0 | |
p02956 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#incl... | replace | 24 | 25 | 24 | 25 | 0 | |
p02956 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 998244353
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
ll fpow(ll x, ll p) {
if (p == 0)
return 1;
return ((p & 1) ? x : 1) * fpow(x * x % MOD, p >> 1) % MOD;
}
ll subs(ll x, ll d) { return ((x - d) % MOD + MOD) % MOD; }
ll comb(ll n) {
if (n ... | #include <bits/stdc++.h>
#define MOD 998244353
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
ll fpow(ll x, ll p) {
if (p == 0)
return 1;
return ((p & 1) ? x : 1) * fpow(x * x % MOD, p >> 1) % MOD;
}
ll subs(ll x, ll d) { return ((x - d) % MOD + MOD) % MOD; }
ll comb(ll n) {
if (n ... | replace | 47 | 48 | 47 | 48 | 0 | |
p02956 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FI first
#define SE second
#define EPS 1e-9
#define ALL(a) a.begin(), a.end()
#define SZ(a) int((a).size())
#define MS(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORE(i, a, b) for (int i = (a); i >= (b); i--)
#define FORALL(it, a) ... | #include <bits/stdc++.h>
#define FI first
#define SE second
#define EPS 1e-9
#define ALL(a) a.begin(), a.end()
#define SZ(a) int((a).size())
#define MS(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORE(i, a, b) for (int i = (a); i >= (b); i--)
#define FORALL(it, a) ... | replace | 40 | 41 | 40 | 41 | 0 | |
p02956 | C++ | Runtime Error | #include <bits/stdc++.h>
#define f first
#define s second
#define MOD 1000000007
#define PMOD 998244353
#define pb(x) push_back(x)
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plii;
typedef pair<int, pii> piii;
const int INF = 1e9 + 10;
const ll LINF = 1LL * INF * INF... | #include <bits/stdc++.h>
#define f first
#define s second
#define MOD 1000000007
#define PMOD 998244353
#define pb(x) push_back(x)
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plii;
typedef pair<int, pii> piii;
const int INF = 1e9 + 10;
const ll LINF = 1LL * INF * INF... | replace | 14 | 15 | 14 | 15 | 0 | |
p02956 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define elif else if
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define elif else if
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll... | replace | 17 | 18 | 17 | 18 | 0 | |
p02956 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 998244353LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<P, int> PP;
class segtree {
public:
static const int N = 1 << 18;
int dp[1 << 19];
segtree() { memset(dp, 0, sizeof(dp)); }
void update(int k, int v) {
k += N - 1;
dp[k] +=... | #include <bits/stdc++.h>
#define MOD 998244353LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<P, int> PP;
class segtree {
public:
static const int N = 1 << 18;
int dp[1 << 19];
segtree() { memset(dp, 0, sizeof(dp)); }
void update(int k, int v) {
k += N - 1;
dp[k] +=... | replace | 37 | 38 | 37 | 38 | 0 | |
p02956 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
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;
}
using ll = long long;
using P = pair<ll, ll>;
using grap... | #include <bits/stdc++.h>
using namespace std;
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;
}
using ll = long long;
using P = pair<ll, ll>;
using grap... | replace | 63 | 64 | 63 | 64 | TLE | |
p02956 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define form2(i, a, b) for (int i = (a); i < (b); ++i)
#define ford2(i, a, b) for (int i = (a - 1); i >= (b); --i)
#define form(i, n) form2(i, 0, n)
#define ford(i, n) ford2(i, n, 0)
#define chmax(x, v) x = max(x, (v))
#define chmin(x, v) x = min(x, ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define form2(i, a, b) for (int i = (a); i < (b); ++i)
#define ford2(i, a, b) for (int i = (a - 1); i >= (b); --i)
#define form(i, n) form2(i, 0, n)
#define ford(i, n) ford2(i, n, 0)
#define chmax(x, v) x = max(x, (v))
#define chmin(x, v) x = min(x, ... | replace | 87 | 91 | 87 | 89 | 0 | |
p02956 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
const i64 MOD = (i64)1e9 + 7;
const i64 INF = (i64)1e18 + 7;
template <typename T = i64> struct Range {
struct iterator {
T value;
const T step, last;
const T &operator*() { return value; }
iterator(T value, T step, T last)
... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
const i64 MOD = (i64)1e9 + 7;
const i64 INF = (i64)1e18 + 7;
template <typename T = i64> struct Range {
struct iterator {
T value;
const T step, last;
const T &operator*() { return value; }
iterator(T value, T step, T last)
... | replace | 294 | 295 | 294 | 295 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.