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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02923 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N;
int H[10000];
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
int max_step = 0;
int step = 0;
for (int i = 0; i < N - 1; ++i) {
if (H[i] >= H[i + 1]) {
step += 1;
} else {
max_step = max(step, max_step);
... | #include <iostream>
using namespace std;
int main() {
int N;
int H[100000];
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
int max_step = 0;
int step = 0;
for (int i = 0; i < N - 1; ++i) {
if (H[i] >= H[i + 1]) {
step += 1;
} else {
max_step = max(step, max_step);
... | replace | 5 | 6 | 5 | 6 | 0 | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
vector<int> nvec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
for (int j = i; j < N - 1; j++) {
if (vec.at(j) >= vec.at(j + 1)) {
nvec.at(i)++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
vector<int> nvec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
for (int j = i; j < N - 1; j++) {
if (vec.at(j) >= vec.at(j + 1)) {
nvec.at(i)++;
... | insert | 23 | 23 | 23 | 26 | TLE | |
p02923 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i... | insert | 25 | 25 | 25 | 26 | 0 | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
int cur = arr[i];
int tmp = 0;
for (int j = i + 1; j < n; j++) {
if (arr[j] > cur) {
break;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
int rem = n - (i + 1);
if (rem < ans) {
break;
}
int cur = arr[i];
int tmp = 0;
for (int j =... | insert | 13 | 13 | 13 | 17 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, max = 0;
cin >> n;
vector<int> h;
int x;
for (int i = 0; i < n; i++) {
cin >> x;
h.push_back(x);
}
for (int i = 0; i < n; i++) {
int count = 0;
for (i... | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, max = 0;
cin >> n;
vector<int> h;
int x;
for (int i = 0; i < n; i++) {
cin >> x;
h.push_back(x);
}
int count = 0;
for (int i = 0; i < n - 1; i++) {
if (... | replace | 15 | 23 | 15 | 21 | TLE | |
p02923 | C++ | Runtime Error | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include... | replace | 330 | 332 | 330 | 337 | 0 | |
p02923 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(a) ((a) > (0) ? (a) : -(... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(a) ((a) > (0) ? (a) : -(... | insert | 68 | 68 | 68 | 70 | TLE | |
p02923 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
vector<ll> H(N);
vector<ll> can_move(N - 1);
cin >> H[0];
for (int i = 1; i < N; i++) {
cin >> H[i];
if (H[i - 1] >= H[i]) {
can_move[i - 1] = 1;
} else {
can_move[i - 1] = 0;
}
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
if (N == 1) {
cout << 0 << endl;
return 0;
}
vector<ll> H(N);
vector<ll> can_move(N - 1);
cin >> H[0];
for (int i = 1; i < N; i++) {
cin >> H[i];
if (H[i - 1] >= H[i]) {
can_move[i ... | insert | 8 | 8 | 8 | 14 | 0 | |
p02923 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#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>
#define EPS (1e-7)
#define INF (1e... | #include <algorithm>
#include <cmath>
#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>
#define EPS (1e-7)
#define INF (1e... | insert | 64 | 64 | 64 | 67 | TLE | |
p02923 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int n, i, max = 0, memo = 0;
long long h[10005];
cin >> n;
for (i = 1; i <= n; i++) {
cin >> h[i];
if (i > 1) {
if (h[i - 1] >= h[i])
memo++;
else
memo = 0;
if (memo > max)
max ... | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int n, i, max = 0, memo = 0;
long long h[100005];
cin >> n;
for (i = 1; i <= n; i++) {
cin >> h[i];
if (i > 1) {
if (h[i - 1] >= h[i])
memo++;
else
memo = 0;
if (memo > max)
max... | replace | 6 | 7 | 6 | 7 | 0 | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
int count;
int ans = 0;
for (int i = 0; i < n - 1; i++) {
count = 0;
for (int h = i; h < n - 1; h++) {
if (a.at(h + 1) <= a.at(h))
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
int count;
int ans = 0;
for (int i = 0; i < n - 1; i++) {
count = 0;
for (int h = i; h < n - 1; h++) {
if (a.at(h + 1) <= a.at(h))
... | insert | 22 | 22 | 22 | 24 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int N;
int max_move(vector<int> &H, int i) {
int a = 0;
int j = i;
while (j <= N - 1) {
if (H[j] >= H[j + 1]) {
j++;
a++;
} else {
break;
}
}
return a;
}
int main() {
cin >> N;
vector<int> H(N + 1);
for (int i = 1; i <= N; i+... | #include <bits/stdc++.h>
using namespace std;
int N;
int max_move(vector<int> &H, int i) {
int a = 0;
int j = i;
while (j <= N - 1) {
if (H[j] >= H[j + 1]) {
j++;
a++;
} else {
break;
}
}
return a;
}
int main() {
cin >> N;
vector<int> H(N + 1);
for (int i = 1; i <= N; i+... | replace | 27 | 29 | 27 | 32 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
int t;
vector<int> b(n);
for (int i = 0; i < n; i++) {
t = 0;
for (int j ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
int t;
vector<int> b(n);
for (int i = 0; i < n; i += t + 1) {
t = 0;
for ... | replace | 17 | 18 | 17 | 18 | TLE | |
p02923 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define ll long long
#define rep(i, end) for (ll i = 0; i < (ll)(end); i++)
int main() {
ll n, count = 0, maxi = 0, last;
cin >> n;
ll h[10001];
rep(i, n) { cin >> h[i]; }
rep(i, n) {
if (i != 0) {
if (h[i] <= last)
count++;
else {
maxi... | #include <iostream>
using namespace std;
#define ll long long
#define rep(i, end) for (ll i = 0; i < (ll)(end); i++)
int main() {
ll n, count = 0, maxi = 0, last;
cin >> n;
ll h[100001] = {};
rep(i, n) { cin >> h[i]; }
rep(i, n) {
if (i != 0) {
if (h[i] <= last)
count++;
else {
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02923 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#define vec2c vector<vector<char>>
#define vec2i vector<vector<int>>
#define vecc vector<char>
#define vecs vector<string>
#define veci vector<int>
#define vecd vector<double>
#defin... | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#define vec2c vector<vector<char>>
#define vec2i vector<vector<int>>
#define vecc vector<char>
#define vecs vector<string>
#define veci vector<int>
#define vecd vector<double>
#defin... | insert | 34 | 34 | 34 | 36 | TLE | |
p02923 | 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.at(i);
}
int maxi = 0;
for (int i = 0; i < N - 1; i++) {
int count = 0;
int checking = i;
bool canLoop = true;
while (canLoop) {
if (H.at(checking... | #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 maxi = 0;
for (int i = 0; i < N - 1; i++) {
int count = 0;
int checking = i;
bool canLoop = true;
while (canLoop) {
if (H.at(checking... | insert | 27 | 27 | 27 | 30 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h[100010];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int now = INT_MAX, maxx = 0, thisone = 0;
for (int j = 0; j < n - 1; j++) {
thisone = 0;
int under = j;
while (h[under] >= h[under + 1] && under < n - 1) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h[100010];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int now = INT_MAX, maxx = 0, thisone = 0;
for (int j = 0; j < n - 1; j++) {
thisone = 0;
int under = j;
while (h[under] >= h[under + 1] && under < n - 1) {
... | insert | 16 | 16 | 16 | 17 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int n, h[100005], x, o;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int n, h[100005], x, o;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin... | replace | 25 | 26 | 25 | 26 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i)
cin >> a[i];
int res = 0;
for (int i = 0; i < N;) {
int j = i + 1;
while (j < N && a[j] <= a[j - 1])
++j;
res = max(res, j - i - 1);
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i)
cin >> a[i];
int res = 0;
for (int i = 0; i < N;) {
int j = i + 1;
while (j < N && a[j] <= a[j - 1])
++j;
res = max(res, j - i - 1);
i = j;
}
cout << res <... | insert | 15 | 15 | 15 | 16 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long;
#define _CRT_SECURE_NO_WARNINGS
const double pai = acos(-1.0);
const int max1 = 5e5 + 5;
int a[max1], maxlen[max1];
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int i, k, sum = 1, n, j, sum1 = 1;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long;
#define _CRT_SECURE_NO_WARNINGS
const double pai = acos(-1.0);
const int max1 = 5e5 + 5;
int a[max1], maxlen[max1];
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int i, k, sum = 1, n, j, sum1 = 1;... | replace | 14 | 21 | 14 | 20 | TLE | |
p02923 | 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 | 19 | 20 | 19 | 20 | 0 | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll ... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll ... | insert | 91 | 91 | 91 | 92 | TLE | |
p02923 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> data(N);
for (int i = 0; i < N; i++) {
cin >> data.at(i);
}
int count = 0;
int c = 0;
for (int i = 0; i < N; i++) {
if (data.at(i) >= data.at(i + 1)) {
count++;
c = max(count, c);
} else i... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> data(N + 10, 1e10);
for (int i = 0; i < N; i++) {
cin >> data.at(i);
}
int count = 0;
int c = 0;
for (int i = 0; i < N; i++) {
if (data.at(i) >= data.at(i + 1)) {
count++;
c = max(count, c);
... | replace | 5 | 6 | 5 | 6 | -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)
|
p02923 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
int n;
int h[100010];
vector<int> result(100010, 0);
int move(int x) {
if (h[x + 1] > h[x] || x == n - 1) {
return 0;
}
return move(x + 1) + 1;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
/... | #include "bits/stdc++.h"
using namespace std;
int n;
int h[100010];
vector<int> result(100010, 0);
int move(int x) {
if (h[x + 1] > h[x] || x == n - 1) {
return 0;
}
return move(x + 1) + 1;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
/... | replace | 21 | 22 | 21 | 28 | TLE | |
p02923 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
vector<int> A(N - 1, 0);
vector<int> B(N - 1, 0);
for (int i = 0; i < N - 1; i++) {
if (H.at(i) >= H.at(i + 1)) {
A.at(i) = 1;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << 0 << endl;
return 0;
}
vector<long long> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
vector<int> A(N - 1, 0);
vector<int> B(N - 1, 0);
for (int i = 0; i < N - 1; i++) {
if... | insert | 6 | 6 | 6 | 11 | 0 | |
p02923 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
long long int n, i = 0, j, cnt = 0, max = 0;
cin >> n;
vector<int> h(n);
for (i = 0; i < n; i++) {
cin >> h[i];
}
for (i = 0; i < n - 1; i++) {
cnt = 0;
for (j = i; j < n - 1; j++) {
if (h[j]... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
long long int n, i = 0, j, cnt = 0, max = 0;
cin >> n;
vector<int> h(n);
for (i = 0; i < n; i++) {
cin >> h[i];
}
for (i = 0; i < n - 1; i++) {
cnt = 0;
for (j = i; j < n - 1; j++) {
if (h[j]... | insert | 24 | 24 | 24 | 26 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (auto &&h : H) {
cin >> h;
}
int point = 0;
int move = 0;
for (int i = 0; i < N - 1; i++) {
int m = 0;
int j = 0;
int dh = 0;
dh = H[i + j] - H[i + j + 1];
while (dh >= 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (auto &&h : H) {
cin >> h;
}
int point = 0;
int move = 0;
for (int i = 0; i < N - 1; i++) {
int m = 0;
int j = 0;
int dh = 0;
dh = H[i + j] - H[i + j + 1];
while (dh >= 0) {
... | insert | 25 | 25 | 25 | 26 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int curr = 0, max = INT_MIN;
for (int i = 0; i < n; i++) {
curr = 0;
for (int j = i + 1; j < n; j++) {
if (h[j] > h[j -... | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int curr = 0, max = INT_MIN;
for (int i = 1; i < n; i++) {
if (h[i] > h[i - 1])
curr = 0;
else
curr++;
if (cu... | replace | 11 | 21 | 11 | 18 | TLE | |
p02923 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define Maxn 10005
int n, s, ans;
int h[Maxn];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 2; i <= n; i++)
if (h[i] <= h[i - 1]) {
s++;
ans = max(ans, s);
} else
s = 0;
cout << ans << endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
#define Maxn 100005
int n, s, ans;
int h[Maxn];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 2; i <= n; i++)
if (h[i] <= h[i - 1]) {
s++;
ans = max(ans, s);
} else
s = 0;
cout << ans << endl;
return 0;... | replace | 2 | 3 | 2 | 3 | 0 | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++) {
cin >> v.at(i);
}
int max = -1;
for (int i = 0; i < N; i++) {
int j = i;
int cnt = 0;
while ((j != N - 1) && (v.at(j) >= v.at(j + 1))) {
j++;
cnt++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++) {
cin >> v.at(i);
}
int max = -1;
for (int i = 0; i < N; i++) {
int j = i;
int cnt = 0;
if (max < N - i) {
while ((j != N - 1) && (v.at(j) >= v.at(j + 1))) {
... | replace | 14 | 17 | 14 | 19 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define ALL(v) ((v).begin(), (v).end())
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
REP(i, n) cin >> h[i];
int sum[10... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define ALL(v) ((v).begin(), (v).end())
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
REP(i, n) cin >> h[i];
int result... | replace | 13 | 28 | 13 | 21 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, count = 0, tmp = 0;
vector<int> h;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
h.push_back(x);
}
for (int i = 0; i < n - 1; i++) {
if (h[i] >= h[i + 1]) {
for (int j = i;; j++) {
... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, count = 0, tmp = 0;
vector<int> h;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
h.push_back(x);
}
for (int i = 0; i < n - 1; i++) {
if (h[i] >= h[i + 1] && n - i >= count) {
for (int j ... | replace | 19 | 20 | 19 | 20 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> data(N);
for (int i = 0; i < N; i++) {
cin >> data[i];
}
int ans = 0;
for (int i = 0; i < N - 1; i++) {
if (data[i] < data[i + 1]) {
continue;
}
int tmp_i = i;
int count = 0;
for (int j... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> data(N);
for (int i = 0; i < N; i++) {
cin >> data[i];
}
int ans = 0;
for (int i = 0; i < N - 1; i++) {
if (data[i] < data[i + 1]) {
continue;
}
int tmp_i = i;
int count = 0;
for (int j... | insert | 27 | 27 | 27 | 29 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
int main() {
int n;
cin >> n;
int h[n];
rep(i, n) cin >> h[i];
int max = 0;
int count = 0;
rep(i, n) {
count = 0;
for (int j = i; j < n - 1; j... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
int main() {
int n;
cin >> n;
int h[n];
rep(i, n) cin >> h[i];
int max = 0;
int count = 0;
rep(i, n) {
if (n - i < max)
break;
count = ... | insert | 15 | 15 | 15 | 18 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#defi... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#defi... | replace | 149 | 150 | 149 | 150 | TLE | |
p02923 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a[10005];
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> a[i];
}
long long sum = 0, m = 0;
for (long long i = 0; i < n - 1; i++) {
if (a[i] < a[i + 1] || i == n - 2) {
if (a[i] >= a[i + 1])
sum++;
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a[100005];
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> a[i];
}
long long sum = 0, m = 0;
for (long long i = 0; i < n - 1; i++) {
if (a[i] < a[i + 1] || i == n - 2) {
if (a[i] >= a[i + 1])
sum++;
if ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02923 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
priority_queue<int> A;
vector<ll> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int count = 0;
for (int i = 0; i < N - 1; i++) {
if (H[i] >= H[i + 1]) {
count++;
} ... | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
priority_queue<int> A;
vector<ll> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int count = 0;
for (int i = 0; i < N - 1; i++) {
if (H[i] >= H[i + 1]) {
count++;
} ... | insert | 22 | 22 | 22 | 23 | 0 | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++)
cin >> s.at(i);
for (int i = 0; i < n - 1; i++) {
int cnt = 0;
for (int j = i; j + 1 < n; j++) {
if (s.at(j) >= s.at(j + 1))
cnt++;
else
br... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++)
cin >> s.at(i);
for (int i = 0; i < n - 1; i++) {
int cnt = 0;
for (int j = i; j + 1 < n; j++) {
if (s.at(j) >= s.at(j + 1))
cnt++;
else
br... | insert | 16 | 16 | 16 | 17 | TLE | |
p02923 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
int main(void) {
int n;
std::cin >> n;
std::vector<int> h(n);
for (int i = 0; i < n; i++) {
std::cin >> h.at(i);
}
std::reverse(h.begin(), h.end());
int ans = 0;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (h.at(i) <= h.at(i + 1)... | #include <algorithm>
#include <iostream>
#include <vector>
int main(void) {
int n;
std::cin >> n;
std::vector<int> h(n);
for (int i = 0; i < n; i++) {
std::cin >> h.at(i);
}
std::reverse(h.begin(), h.end());
int ans = 0;
int cnt = 0;
for (int i = 0; i < n - 1; i++) {
if (h.at(i) <= h.at(i ... | replace | 17 | 18 | 17 | 18 | -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)
|
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int n, h[123456], c;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++) {
int j = i, k = i + 1, a = 0;
while (h[j] >= h[k] && h[k] != 0) {
j++;
k++;
a++;
}
if (c < a)
c = a;
}
cou... | #include <bits/stdc++.h>
using namespace std;
int n, h[123456], c;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++) {
int j = i, k = i + 1, a = 0;
while (h[j] >= h[k] && h[k] != 0) {
j++;
k++;
a++;
}
if (c < a)
c = a;
i = j... | insert | 16 | 16 | 16 | 17 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <stdio.h>
#include <stdlib.h>
/*ABC 139 C*/
int main(void) {
int N;
int *heap;
int count = 0;
int max = 0;
scanf("%d", &N);
heap = (int *)malloc(sizeof(int) * N);
if (heap == NULL) {
exit(0);
}
for (size_t i = 0; i < N; i++) {
scanf("%d", &heap[i]);
}
for (size_t i = 0; i < N;... | #include <stdio.h>
#include <stdlib.h>
/*ABC 139 C*/
int main(void) {
int N;
int *heap;
int count = 0;
int max = 0;
scanf("%d", &N);
heap = (int *)malloc(sizeof(int) * N);
if (heap == NULL) {
exit(0);
}
for (size_t i = 0; i < N; i++) {
scanf("%d", &heap[i]);
}
for (size_t i = 0; i < N;... | insert | 30 | 30 | 30 | 34 | TLE | |
p02923 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int N;
int Hs[10005];
int main() {
cin >> N;
rep(i, N) { cin >> Hs[i]; }
int st = Hs[0];
int mx = 0;
int now = 0;
for (int i = 1; i < N; i++) {
if (Hs[i] <= Hs[i - 1]) {
now++;
} else {
m... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int N;
int Hs[100005];
int main() {
cin >> N;
rep(i, N) { cin >> Hs[i]; }
int st = Hs[0];
int mx = 0;
int now = 0;
for (int i = 1; i < N; i++) {
if (Hs[i] <= Hs[i - 1]) {
now++;
} else {
... | replace | 5 | 6 | 5 | 6 | 0 | |
p02923 | 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 count = 0;
int countt = -1;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - i - 1; j++) {
if (H.at(i + j) >= H.at(i + j + 1)) {
... | #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 count = 0;
int countt = -1;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - i - 1; j++) {
if (H.at(i + j) >= H.at(i + j + 1)) {
... | replace | 28 | 29 | 28 | 29 | TLE | |
p02923 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int count = 0;
vector<int> v;
for (int i = 1; i < n; i++) {
if (h[i - 1] >= h[i]) {
++count;
v.push_back(count);
} else {
count = 0;
}
}
sor... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int count = 0;
vector<int> v(1);
for (int i = 1; i < n; i++) {
if (h[i - 1] >= h[i]) {
++count;
v.push_back(count);
} else {
count = 0;
}
}
... | replace | 10 | 11 | 10 | 11 | 0 | |
p02923 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
int main(int argc, char const *argv[]) {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
int n;
cin >> n;
vector<int> v(n);
f... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
int main(int argc, char const *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
int low = 0, high = 1, ans = 0, cnt = 0;
while (high <... | delete | 5 | 9 | 5 | 5 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p02923 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h.at(i);
vector<int> count(n);
for (int i = 0; i < n; ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h.at(i);
vector<int> count(n, 0);
int p = 0;
for (in... | replace | 14 | 22 | 14 | 21 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, max = 0;
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 count = 0;
for (int j = i; j < N - 1; j++) {
if (H... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, max = 0;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N - 1; i++) {
if (max > N - i - 2) {
break;
}
int count = 0;
... | insert | 15 | 15 | 15 | 18 | TLE | |
p02923 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[10000];
int n, m, ans;
int main() {
int i, ans = 0, anss = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (i != 1) {
if (a[i] <= a[i - 1])
ans++, anss = max(anss, ans);
else
anss = max(anss, ans), ans = ... | #include <bits/stdc++.h>
using namespace std;
int a[100010];
int n, m, ans;
int main() {
int i, ans = 0, anss = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (i != 1) {
if (a[i] <= a[i - 1])
ans++, anss = max(anss, ans);
else
anss = max(anss, ans), ans =... | replace | 2 | 3 | 2 | 3 | 0 | |
p02923 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
long long count = 0;
long long max = 0;
long long N;
cin >> N;
vector<long long> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
count = 0;
... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
long long count = 0;
long long max = 0;
long long N;
cin >> N;
vector<long long> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
count = 0;
... | insert | 33 | 33 | 33 | 36 | TLE | |
p02923 | 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];
int ans = 0;
for (int i = 0; i < n; i++) {
int res = 0;
for (int j = i + 1; j < n; j++) {
if (h[j - 1] >= h[j])
res = j - i;
else {
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[i];
int ans = 0;
int res = 0;
for (int i = 1; i < n; i++) {
if (h[i] <= h[i - 1])
res++;
else
res = 0;
ans = max(ans, res);
}
cout << ans << en... | replace | 9 | 19 | 9 | 15 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long long h[110000];
for (int i = 0; i < n; i++)
cin >> h[... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long long h[110000];
for (int i = 0; i < n; i++)
cin >> h[... | insert | 29 | 29 | 29 | 30 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int count = 0;
int N;
cin >> N;
vector<int> H(N + 1);
H[N] = 1000000001;
vector<int> Hc(N);
rep(i, N) { cin >> H[i]; }
rep(i, N) {
int c = 0;
for (int j = i; j < N; j++) {
if (H... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int count = 0;
int N;
cin >> N;
vector<int> H(N + 1);
H[N] = 1000000001;
vector<int> Hc(N);
rep(i, N) { cin >> H[i]; }
rep(i, N) {
int c = 0;
for (int j = i; j < N; j++) {
if (H... | insert | 22 | 22 | 22 | 23 | TLE | |
p02923 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define INF 2147483647
int dp[100];
int main() {
ios_base::sync_with_stdio(false);
int n;
cin ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define INF 2147483647
int dp[100001];
int main() {
ios_base::sync_with_stdio(false);
int n;
c... | replace | 14 | 15 | 14 | 15 | 0 | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0, N;
cin >> N;
vector<int> H(N), X(N, 0);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
if (N > 1) {
for (int i = 0; i < N - 1; i++) {
if (H.at(i) >= H.at(i + 1)) {
int j = i;
while (j < N - 1 && H.at(j) >= ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0, N;
cin >> N;
vector<int> H(N), X(N, 0);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
if (N > 1) {
for (int i = 0; i < N - 1; i++) {
if (i == 0 ||
(i > 0 && H.at(i) >= H.at(i + 1) && H.at(i - 1) < H.at(i))) {
... | replace | 12 | 13 | 12 | 14 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h;
for (int i = 0; i < n; ++i) {
int height;
cin >> height;
h.push_back(height);
}
int max_ = 0;
for (int i = 0; i < n; ++i) {
int current = 0;
for (int j = i; j < n - 1; ++j) {
if (h[j + 1]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h;
for (int i = 0; i < n; ++i) {
int height;
cin >> height;
h.push_back(height);
}
int max_ = 0, curr = 0;
for (int i = 0; i < n - 1; ++i) {
if (h[i + 1] <= h[i]) {
curr++;
max_ = max(max_... | replace | 13 | 23 | 13 | 20 | TLE | |
p02923 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define INF (1ll << 40)
#define mod 1000000007
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define INF (1ll << 40)
#define mod 1000000007
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return... | replace | 30 | 31 | 30 | 31 | 0 | |
p02923 | 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.at(i);
}
int answer = 0;
for (int i = 0; i < N - 1; i++) {
int j, count;
for (j = i, count = 0; j < N - 1 && H.at(j + 1) <= H.at(j); j++, count++) {
}
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);
}
int answer = 0;
for (int i = 0; i < N - 1; i++) {
int j, count;
for (j = i, count = 0; j < N - 1 && H.at(j + 1) <= H.at(j); j++, count++) {
i++;
... | insert | 14 | 14 | 14 | 15 | TLE | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
vector<ll> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
ll currentHeight = H[i];
int step = 0;
for (int j = i + 1; H[j] <= currentHeight &&... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
vector<ll> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
ll currentHeight = H[i];
int step = 0;
for (int j = i + 1; H[j] <= currentHeight &&... | insert | 23 | 23 | 23 | 24 | TLE | |
p02923 | C++ | Runtime Error | /////////////////////////////////////////////////
///// Give me AC!!!! /////
/////////////////////////////////////////////////
// ↑これじゃ気合いが足りない！
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////
/////
///お願いしますACをくださいそうじゃないと僕泣きますお願いし... | /////////////////////////////////////////////////
///// Give me AC!!!! /////
/////////////////////////////////////////////////
// ↑これじゃ気合いが足りない！
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////
/////
///お願いしますACをくださいそうじゃないと僕泣きますお願いし... | insert | 160 | 160 | 160 | 164 | 0 | |
p02923 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> height(n);
for (int i = 0; i < n; i++) {
cin >> height.at(i);
}
int max = 0;
for (int i = 0; i < n - 1; i++) {
int cnt = 0;
int j = i;
while (j < n - 1 && height.at(j) >= height.at(j + 1)) {
j++;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> height(n);
for (int i = 0; i < n; i++) {
cin >> height.at(i);
}
int max = 0;
for (int i = 0; i < n - 1; i++) {
int cnt = 0;
int j = i;
while (j < n - 1 && height.at(j) >= height.at(j + 1)) {
j++;... | insert | 20 | 20 | 20 | 22 | TLE | |
p02923 | 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];
int res = 0;
for (int i = 0; i < N; ++i) {
int cnt = 0;
for (int k = i + 1; k < N; ++k) {
if (H[k - 1] >= H[k]) {
cnt++;
} else {
b... | #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];
int res = 0;
int cnt = 0;
for (int i = 1; i < N; ++i) {
if (H[i - 1] >= H[i]) {
cnt++;
} else {
cnt = 0;
}
if (res < cnt) {
res = ... | replace | 11 | 19 | 11 | 17 | TLE | |
p02923 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
typedef long long int ll;
using namespace std;
int main() {
int N;
vector<int> H;
cin >> N;
rep(i, N) {
int val;
cin >> val;
H.push_back(val);
}
int co... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
typedef long long int ll;
using namespace std;
int main() {
int N;
vector<int> H;
cin >> N;
rep(i, N) {
int val;
cin >> val;
H.push_back(val);
}
int co... | replace | 18 | 19 | 18 | 19 | 0 | |
p02924 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define forsn(i, s, n) for (int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define all(v) v.begin(), v.end()
#define NACHO \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
#define forsn(i, s, n) for (int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define all(v) v.begin(), v.end()
#define NACHO \
ios_base::sync_with_stdio(0); ... | replace | 16 | 26 | 16 | 18 | 0 | |
p02924 | Python | Time Limit Exceeded | N = int(input())
ans = 0
for i in range(1, N):
ans += i
print(ans)
| N = int(input())
print((N - 1) * N // 2)
| replace | 1 | 7 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
c = 0
for i in range(1, N):
c += i
print(c)
| N = int(input())
print(N * (N - 1) // 2)
| replace | 1 | 7 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
sum = 0
for i in range(n):
sum += i
print(sum)
| n = int(input())
print((n * (n - 1)) // 2)
| replace | 2 | 7 | 2 | 3 | TLE | |
p02924 | Python | Time Limit Exceeded | import sys
sys.setrecursionlimit(int(1e6))
N = int(input())
M_sum = 0
M_sum = sum(range(1, N))
M_sum += N % 1
print(M_sum)
| import sys
sys.setrecursionlimit(int(1e6))
N = int(input())
n = N - 1
if bool(n % 2):
ans = (n // 2) * (n) + n
else:
ans = (n // 2) * (n + 1)
print(ans)
| replace | 6 | 10 | 6 | 13 | TLE | |
p02924 | Python | Runtime Error | N = int(input())
print(sum(list(range(N))))
| N = int(input())
print((N - 1) * N // 2)
| replace | 1 | 2 | 1 | 2 | 0 | |
p02924 | Python | Runtime Error | N = int(input())
print(sum(list(range(N))[1:]))
| N = int(input())
print((N - 1) * (N) // 2)
| replace | 1 | 2 | 1 | 2 | 0 | |
p02924 | Python | Time Limit Exceeded | n = int(input())
ans = 0
for i in range(1, n):
ans += i
print(ans)
| n = int(input()) - 1
print(n * (n + 1) // 2)
| replace | 0 | 7 | 0 | 2 | TLE | |
p02924 | Python | Runtime Error | n = int(input())
a = list(range(1, n))
print(sum(a))
| n = int(input())
ans = (n - 1) * (1 + n - 1) // 2
print(ans)
| replace | 1 | 3 | 1 | 3 | 0 | |
p02924 | Python | Time Limit Exceeded | def main():
n = int(input())
sum = 0
for i in range(n):
sum += i
print(sum)
if __name__ == "__main__":
main()
| def main():
n = int(input())
print(n * (n - 1) // 2)
if __name__ == "__main__":
main()
| replace | 2 | 6 | 2 | 3 | TLE | |
p02924 | Python | Runtime Error | n = int(input())
a = list(range(1, n))
print(sum(a))
| n = int(input())
a = (1 + n - 1) * (n - 1) // 2
print(a)
| replace | 3 | 6 | 3 | 5 | 0 | |
p02924 | Python | Time Limit Exceeded | n = int(input())
ans = 0
for i in range(n):
ans += i
print(ans)
| n = int(input())
ans = n * (n - 1) // 2
print(ans)
| replace | 2 | 5 | 2 | 3 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
print(sum(range(1, N)))
| N = int(input())
print((N - 1) * N // 2)
| replace | 1 | 2 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
print(sum([i for i in range(N)]))
| N = int(input())
print(N * (N - 1) // 2)
| replace | 1 | 2 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
print(sum(range(1, n)))
| n = int(input())
ans = n * (n - 1) // 2
print(ans)
| replace | 1 | 2 | 1 | 4 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
ans = 0
for i in range(1, n):
ans += i
print(ans)
| n = int(input())
print((n * (n - 1)) // 2)
| replace | 2 | 8 | 2 | 3 | TLE | |
p02924 | Python | Time Limit Exceeded | import sys
N = int(sys.stdin.readline())
print(sum(n + 1 for n in range(N - 1)))
| import sys
N = int(sys.stdin.readline())
print(int((N - 1) * N // 2))
| replace | 3 | 4 | 3 | 4 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
ans = 0
for i in range(1, n):
ans += i
print(ans)
| n = int(input())
print(n * (n - 1) // 2)
| replace | 1 | 5 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
result = 0
for i in range(N):
result += i
print(result)
| N = int(input())
print(N * (N - 1) // 2)
| replace | 2 | 6 | 2 | 3 | TLE | |
p02924 | Python | Time Limit Exceeded | a = int(input())
sum = 0
for i in range(a):
sum += i
print(sum)
| a = int(input())
sum = 0
sum = (a - 1) * a // 2
print(sum)
| replace | 2 | 4 | 2 | 3 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
ans = 0
for i in range(n):
ans += i
print(ans)
| n = int(input())
print(n * (n - 1) // 2)
| replace | 2 | 7 | 2 | 3 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
// int l[n+1];
int main() {
int n;
cin >> n;
long long res = 0;
for (int i = 1; i < n; i++) {
res += i % (i + 1);
}
cout << res;
}
| #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
// int l[n+1];
int main() {
int n;
cin >> n;
long long res = 0;
for (int i = 1; i < n; i++) {
res += i;
}
cout << res;
}
| replace | 9 | 10 | 9 | 10 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n, sol;
int main() {
cin >> n;
for (int i = 1; i < n; ++i)
sol += i % (i + 1);
cout << sol;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n, sol;
int main() {
cin >> n;
cout << n * (n - 1) / 2;
return 0;
}
| replace | 10 | 14 | 10 | 11 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <iostream>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long N;
cin >> N;
long ans = 0;
rep(i, N) {
if (i != N - 1)
ans += (i + 1) % (i + 2);
}
cout << ans << endl;
return 0;
} | #include <iostream>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long N;
cin >> N;
long ans = ((N - 1) * N) / 2;
cout << ans << endl;
return 0;
} | replace | 14 | 19 | 14 | 15 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long int N;
cin >> N;
long long int sum;
sum = 0;
for (long long int i = 0; i < N - 1; i++) {
sum = sum + ((N - 1 - i) % (N - i));
}
cout << sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
} | replace | 7 | 15 | 7 | 8 | TLE | |
p02924 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define _GLIBCXX_DEBUG
signed main() {
int N;
cin >> N;
vector<int> vec(N);
int ans = 0;
cout << N * (N - 1) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define _GLIBCXX_DEBUG
signed main() {
int N;
cin >> N;
// vector<int> vec(N);
int ans = 0;
cout << N * (N - 1) / 2 << endl;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define frw(i, a, b) for (int i = a; i < b; i++)
#define fi first
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define frw(i, a, b) for (int i = a; i < b; i++)
#define fi first
... | replace | 67 | 73 | 67 | 69 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
for (int i = 1; i <= n; i++) {
ans += i % (n + i - i);
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (long long)(n - 1) * n / 2 << endl;
return 0;
}
| replace | 8 | 14 | 8 | 9 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
typedef long long ll;
const ll mod = 1000000007;
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
int main() {
ll n;
cin >> n;
ll out = 0;
for (ll i = n - 1; i >= 1; --i) {
out += i % (i + 1);
}
cout << out <... | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
typedef long long ll;
const ll mod = 1000000007;
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
int main() {
ll n;
cin >> n;
cout << n * (n - 1LL) / 2LL << endl;
return 0;
}
| replace | 10 | 15 | 10 | 11 | TLE | |
p02924 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <vector>
#define int long long
#include <string>
#define float long double
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, s = 0;
cin >> n;
int a[n];
for (int i = 0; i < n - 1; i++) {
a[i] = i + 2;
}
a[n - 1] = 1;
for (... | #include <bits/stdc++.h>
#include <vector>
#define int long long
#include <string>
#define float long double
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, s = 0;
cin >> n;
for (int i = 1; i < n; i++)
s = s + i;
cout << s;
}
| replace | 11 | 18 | 11 | 13 | 0 | |
p02924 | Python | Time Limit Exceeded | def calc(n):
r = 0
for i in range(1, n):
r += i
return r
n = int(input())
r = calc(n)
print(r)
| def calc(n):
return (1 + n - 1) * (n - 1) // 2
n = int(input())
r = calc(n)
print(r)
| replace | 1 | 5 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
print(sum(i % (i + 1) for i in range(1, N)))
| N = int(input())
print(int(N * (N - 1) // 2))
| replace | 2 | 3 | 2 | 3 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
print(sum(v for v in range(N)))
| N = int(input())
print(N * (N - 1) // 2)
| replace | 1 | 2 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | print(sum(range(int(input()))))
| n = int(input())
print(n * (n - 1) // 2)
| replace | 0 | 1 | 0 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
ret = 0
for i in range(1, N):
ret += i
# 1 2 3 4 5 6 7 8 9 10 11 12 13
# 2 3 4 5 6 7 8 9 10 11 12 13 1
print(ret)
| N = int(input())
ret = (1 + N) * N // 2 - N
# 1 2 3 4 5 6 7 8 9 10 11 12 13
# 2 3 4 5 6 7 8 9 10 11 12 13 1
print(ret)
| replace | 1 | 4 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
if N == 1:
print(0)
else:
print(sum([i for i in range(1, N)]))
| N = int(input())
print(N * (N - 1) // 2)
| replace | 1 | 6 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | # from math import factorial,sqrt
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque,Counter
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)
# import numpy as np
# import scipy as scp
# 入力の受け取り
n = int(input... | # from math import factorial,sqrt
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque,Counter
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)
# import numpy as np
# import scipy as scp
# 入力の受け取り
n = int(input... | replace | 14 | 15 | 14 | 17 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
ans = 0
for i in range(N):
ans += i
print(ans)
| N = int(input())
print(N * (N - 1) // 2)
| replace | 1 | 6 | 1 | 2 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.