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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02915 | Python | Runtime Error | a = input()
print(a**3)
| a = int(input())
print(a**3)
| replace | 0 | 1 | 0 | 1 | TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02915/Python/s461864634.py", line 2, in <module>
print(a ** 3)
TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'
|
p02915 | Python | Runtime Error | N = input(int())
print(N**3)
| N = int(input())
print(N**3)
| replace | 0 | 1 | 0 | 1 | TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02915/Python/s203905734.py", line 2, in <module>
print(N**3)
TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'
|
p02915 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define pb push_b... | #include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define pb push_b... | delete | 36 | 40 | 36 | 36 | 0 | |
p02915 | Python | Runtime Error | len = input()
print(len**3)
| len = int(input())
print(len**3)
| replace | 0 | 1 | 0 | 1 | TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02915/Python/s357662058.py", line 2, in <module>
print(len**3)
TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'
|
p02915 | Python | Runtime Error | a = input()
print(a**3)
| a = int(input())
print(a**3)
| replace | 0 | 1 | 0 | 1 | TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02915/Python/s464353610.py", line 2, in <module>
print(a**3)
TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'
|
p02915 | C++ | Runtime Error | /*
Life Before Death, Strength Before Weakness, Journey Before Destination
------------------------------------------------------------------------
You don't become great by trying to be great.
You become great by wanting to do something,
and then doing it so hard that you become great in the process.
*/
// #pragma co... | /*
Life Before Death, Strength Before Weakness, Journey Before Destination
------------------------------------------------------------------------
You don't become great by trying to be great.
You become great by wanting to do something,
and then doing it so hard that you become great in the process.
*/
// #pragma co... | replace | 61 | 65 | 61 | 63 | -6 | terminate called after throwing an instance of 'std::__ios_failure'
what(): basic_ios::clear: iostream error
|
p02915 | C++ | Runtime Error | #include <stdio.h>
int main() {
int N;
scanf("%d", N);
printf("%d", N * N * N);
return 0;
} | #include <stdio.h>
int main() {
int n;
scanf("%d", &n);
printf("%d\n", n * n * n);
return 0;
} | replace | 3 | 6 | 3 | 6 | -11 | |
p02915 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | replace | 85 | 86 | 85 | 86 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02915 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n) for (ll i = 0; i < (n); i++)
int main() {
ll n, ans = 0;
cin >> n;
vector<ll> vec(10000000);
for (ll i = 0; i < 1000; i++) {
for (ll j = 0; j < 10000; j++) {
for (int k = 0; k < 500; k++) {
vec.at(i + j + k)+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n) for (ll i = 0; i < (n); i++)
int main() {
ll n, ans = 0;
cin >> n;
vector<ll> vec(10000000);
for (ll i = 0; i < 1000; i++) {
for (ll j = 0; j < 10000; j++) {
for (int k = 0; k < 50; k++) {
vec.at(i + j + k)++... | replace | 10 | 11 | 10 | 11 | TLE | |
p02915 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
return n * n * n;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * n * n << endl;
return 0;
} | replace | 7 | 8 | 7 | 9 | 8 | |
p02915 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
//
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
#define sz(a) int((a).size())
#define all(c) (... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
//
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
#define sz(a) int((a).size())
#define all(c) (... | replace | 27 | 31 | 27 | 28 | 0 | |
p02915 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
int n;
n = a * a * a;
return n;
} | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
int n;
n = a * a * a;
cout << n;
} | replace | 7 | 8 | 7 | 8 | 8 | |
p02915 | C++ | Runtime Error | #include <iostream>
int main() {
int n;
std::cin >> n;
return (n * n * n);
} | #include <iostream>
int main() {
int n;
std::cin >> n;
std::cout << n * n * n;
} | replace | 5 | 6 | 5 | 6 | 8 | |
p02915 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long
#define ff first
#define ss second
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long
#define ff first
#define ss second
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | delete | 17 | 21 | 17 | 17 | 0 | |
p02915 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
typedef unsigned long long int ull;
typedef tree<int, null_type, less<int>, rb_tree_tag,
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
typedef unsigned long long int ull;
typedef tree<int, null_type, less<int>, rb_tree_tag,
... | delete | 72 | 77 | 72 | 72 | 0 | |
p02915 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int i;
cin >> i;
long long j = 1;
while (i > 0) {
j <<= 1;
}
cout << j;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int i;
cin >> i;
cout << i * i * i;
return 0;
}
| replace | 5 | 10 | 5 | 6 | TLE | |
p02915 | C++ | Time Limit Exceeded | // #pragma GCC optimize("O3", "unroll-loops")
// #pragma GCC target("avx2")
#include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | // #pragma GCC optimize("O3", "unroll-loops")
// #pragma GCC target("avx2")
#include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | delete | 110 | 114 | 110 | 110 | TLE | |
p02915 | C++ | Runtime Error | /* ###########################
# Author : Pranay Garg #
# College : SGSITS #
###########################
*/
#include <bits/stdc++.h>
#define ll long long int
#define ironman \
ios_base::sync_with_stdio(false); ... | /* ###########################
# Author : Pranay Garg #
# College : SGSITS #
###########################
*/
#include <bits/stdc++.h>
#define ll long long int
#define ironman \
ios_base::sync_with_stdio(false); ... | replace | 113 | 114 | 113 | 114 | 0 | |
p02915 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Ans = 0;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
// cout << A[i] << endl;
}
int B[N];
for (int i = 0; i < N; i++) {
cin >> B[i];
// cout << B[i] << endl;
}
int C[N - 1];
for (int i = 0; i < N - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
cout << a * a * a << endl;
return 0;
} | replace | 4 | 31 | 4 | 7 | -11 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), c(n - 1);
for (int i = 0; i < n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n - 1; i++)
cin >> c.at(i);
int sum = 0;
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), c(n - 1);
for (int i = 0; i < n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n - 1; i++)
cin >> c.at(i);
int sum = 0;
for (int i = 0; i < n; i++) {
... | replace | 17 | 18 | 17 | 18 | 0 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int *a = (int *)malloc(n * sizeof(int));
int *nxt = (int *)malloc(n * sizeof(int));
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++)
nxt[a[i - 1]] = a[i];
int ans = 0;
for (int i = 0; i < n; i++) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int *a = (int *)malloc(n * sizeof(int));
int *nxt = (int *)malloc((n + 1) * sizeof(int));
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++)
nxt[a[i - 1]] = a[i];
int ans = 0;
for (int i = 0; i < n; ... | replace | 8 | 9 | 8 | 9 | 0 | |
p02916 | Python | Runtime Error | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
# 定義してないリストを参照するとエラーがでるからダミー置いといた。
A.append(100)
C.append(0)
total = 0
total = sum(B)
for i in range(1, N):
if A[i] - A[i - 1] == 1:
total += C[A[i] - 1 - 1]
print(total)
A = li... | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
# 定義してないリストを参照するとエラーがでるからダミー置いといた。
A.append(100)
C.append(0)
total = 0
total = sum(B)
for i in range(1, N):
if A[i] - A[i - 1] == 1:
total += C[A[i] - 1 - 1]
print(total)
| delete | 18 | 22 | 18 | 18 | EOFError: EOF when reading a line | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02916/Python/s740527149.py", line 20, in <module>
A = list(map(int, input().split()))
EOFError: EOF when reading a line
|
p02916 | Python | Runtime Error | n = int(input())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
if len(c) == 1:
print(sum(b) + sum(c))
else:
print(sum(b) + sum(c) - c[a[n - 1] - 1])
| n = int(input())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
ans = b[a[0] - 1]
for i in range(1, n):
ans += b[a[i] - 1]
if a[i] == a[i - 1] + 1:
ans += c[a[i - 1] - 1]
print(ans)
| replace | 4 | 8 | 4 | 10 | 0 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), c(n - 1);
int cnt = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
cin >> b[i];
}
for (int i = 1; i <= n - 1; i++) {
cin >> c[i];
}
for (int i = 1; i <=... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(100), b(100), c(100);
int cnt = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
cin >> b[i];
}
for (int i = 1; i <= n - 1; i++) {
cin >> c[i];
}
for (int i = 1; i ... | replace | 6 | 7 | 6 | 7 | 0 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
vector<int> c(n - 1);
int cnt = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
cin >> b[i];
}
for (int i = 1; i <= n - 1; i++) {
cin >> c[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
vector<int> c(n);
int cnt = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
cin >> b[i];
}
for (int i = 1; i <= n - 1; i++) {
cin >> ... | replace | 6 | 9 | 6 | 9 | 0 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(0);
vector<int> b(0);
vector<int> c(0);
int in;
for (int i = 0; i < n; i++) {
cin >> in;
a.push_back(in);
}
for (int i = 0; i < n; i++) {
cin >> in;
b.push_back(in);
}
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(0);
vector<int> b(0);
vector<int> c(0);
int in;
for (int i = 0; i < n; i++) {
cin >> in;
a.push_back(in);
}
for (int i = 0; i < n; i++) {
cin >> in;
b.push_back(in);
}
for (int i = 0; i <... | replace | 33 | 34 | 33 | 34 | 0 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i < (int)n + 1; i++)
using namespace std;
int main() {
int n, ans, temp;
cin >> n;
vector<int> a(20), b(50), c(50);
rep(i, n) { cin >> a.at(i); }
rep(i, n) { cin >> b.at(i); }
rep(i, n - 1) { cin >> c.at(i); }
ans = 0;
rep(i, n) {
te... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i < (int)n + 1; i++)
using namespace std;
int main() {
int n, ans, temp;
cin >> n;
vector<int> a(21), b(51), c(51);
rep(i, n) { cin >> a.at(i); }
rep(i, n) { cin >> b.at(i); }
rep(i, n - 1) { cin >> c.at(i); }
ans = 0;
rep(i, n) {
te... | replace | 9 | 10 | 9 | 10 | 0 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// ----------------------R00TDADA------------------------------
#define rep(i, a, b) for (__typeof((b)) i = (a); i < (b); i++)
#define nrep(i, a, b) for (__typeof((b)) i = (b); i > (a); i--)
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pp... | #include <bits/stdc++.h>
using namespace std;
// ----------------------R00TDADA------------------------------
#define rep(i, a, b) for (__typeof((b)) i = (a); i < (b); i++)
#define nrep(i, a, b) for (__typeof((b)) i = (b); i > (a); i--)
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pp... | replace | 22 | 28 | 22 | 23 | -11 | |
p02916 | C++ | Runtime Error | #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.at(i);
vector<int> B(N);
for (int i = 0; i < N; i++)
cin >> B.at(i);
vector<int> C(N - 1);
for (int i = 0; i < N - 1; i++)
cin >> C.at(i);
int sum = 0;
for (... | #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.at(i);
vector<int> B(N);
for (int i = 0; i < N; i++)
cin >> B.at(i);
vector<int> C(N - 1);
for (int i = 0; i < N - 1; i++)
cin >> C.at(i);
int sum = 0;
for (... | replace | 20 | 21 | 20 | 21 | 0 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
// vector<int> b(n);
int ans = 0;
int tmp;
vector<int> c(n - 1);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> tmp;
ans += tmp;
}
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
// vector<int> b(n);
int ans = 0;
int tmp;
vector<int> c(n - 1);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> tmp;
ans += tmp;
}
for (int i = 0; i < ... | replace | 23 | 24 | 23 | 24 | 0 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int tManzoku = 0;
cin >> N;
vector<int> Ryouri(N);
vector<int> Manzoku(N);
vector<int> mBonus(N - 1);
for (int i = 0; i < N; i++)
cin >> Ryouri.at(i);
for (int i = 0; i < N; i++)
cin >> Manzoku.at(i);
for (int i = 0; i < N - 1;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int tManzoku = 0;
cin >> N;
vector<int> Ryouri(N);
vector<int> Manzoku(N);
vector<int> mBonus(N - 1);
for (int i = 0; i < N; i++)
cin >> Ryouri.at(i);
for (int i = 0; i < N; i++)
cin >> Manzoku.at(i);
for (int i = 0; i < N - 1;... | replace | 17 | 26 | 17 | 20 | 0 | |
p02916 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#inclu... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#inclu... | replace | 36 | 37 | 36 | 37 | 0 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), B(N), C(N - 1);
for (int i = 0; i < N; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
for (int i = 0; i < N - 1; i++)
cin >> C.at(i);
int ans = 0;
for (int i = 0; i < N; i++) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), B(N), C(N - 1);
for (int i = 0; i < N; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
for (int i = 0; i < N - 1; i++)
cin >> C.at(i);
int ans = 0;
for (int i = 0; i < N; i++) ... | replace | 24 | 25 | 24 | 25 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p02916 | C++ | Runtime Error | /*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
... | /*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
... | insert | 98 | 98 | 98 | 99 | 0 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
int ans;
ans = 0;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
vector<int> C(N - 1);
for (int i = 0; i < N - 1; i++) {
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
int ans;
ans = 0;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
vector<int> C(N - 1);
for (int i = 0; i < N - 1; i++) {
c... | replace | 22 | 23 | 22 | 23 | 0 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n), b(n), c(n - 1);
for (auto &i : a)
cin >> i;
for (auto &i : b)
cin >> i;
for (auto &i : c)
cin >> i;
int sut = 0;
int prex = 0;
for (auto xa : a) {
sut += b.at(xa - 1);
if (xa == prex ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n), b(n), c(n - 1);
for (auto &i : a)
cin >> i;
for (auto &i : b)
cin >> i;
for (auto &i : c)
cin >> i;
int sut = 0;
int prex = 0;
for (auto xa : a) {
sut += b.at(xa - 1);
if (xa >= 2 && ... | replace | 17 | 18 | 17 | 18 | 0 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
long long ncr(int n, int r) {
if (r > n - r)
r = n - r; // because C(n, r) == C(n, n - r)
long long ans = 1;
int i;
for (i = 1; i <= r; i++) {
ans *= n - r + i;
ans /= i;
... | #include <bits/stdc++.h>
#include <iostream>
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
long long ncr(int n, int r) {
if (r > n - r)
r = n - r; // because C(n, r) == C(n, n - r)
long long ans = 1;
int i;
for (i = 1; i <= r; i++) {
ans *= n - r + i;
ans /= i;
... | replace | 40 | 41 | 40 | 41 | 0 | |
p02916 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<ll> vl;
typedef vector<vector<int, int>> vvi;
#define pb push_back
#define mp make_pair
#define f first
#defin... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<ll> vl;
typedef vector<vector<int, int>> vvi;
#define pb push_back
#define mp make_pair
#define f first
#defin... | replace | 39 | 46 | 39 | 42 | TLE | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i <= (int)n; i++)
#define rep2(i, m, n) for (int i = (int)m; i < (int)n; i++)
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vii; // 2次元配列
typedef vector<ll> vll;
typedef vector<string> vs;
/*FUNC... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i <= (int)n; i++)
#define rep2(i, m, n) for (int i = (int)m; i < (int)n; i++)
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vii; // 2次元配列
typedef vector<ll> vll;
typedef vector<string> vs;
/*FUNC... | replace | 21 | 22 | 21 | 22 | 0 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
vector<int> c(n - 1);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n - 1; i++) {
cin >> c.at(i);
}
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
vector<int> c(n - 1);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n - 1; i++) {
cin >> c.at(i);
}
i... | replace | 24 | 25 | 24 | 25 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p02916 | C++ | Runtime Error | /* ****mittal**** */
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for ... | /* ****mittal**** */
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for ... | replace | 41 | 43 | 41 | 43 | 0 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define double long double
using namespace std;
signed main() {
int a;
cin >> a;
vector<int> b(a);
v... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define double long double
using namespace std;
signed main() {
int a;
cin >> a;
vector<int> b(a);
v... | replace | 19 | 24 | 19 | 24 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p02916 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, f, n) for (int(i) = (f); i < (n); i++)
#define LL long long int
/*
greater<int>()
sortの第三因数に入れて降順
sq... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, f, n) for (int(i) = (f); i < (n); i++)
#define LL long long int
/*
greater<int>()
sortの第三因数に入れて降順
sq... | replace | 45 | 46 | 45 | 46 | 0 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> a(n);
vector<int> b(n);
vector<int> c(n - 1);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n - 1; i++) {
cin >> c.at(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> a(n);
vector<int> b(n);
vector<int> c(n - 1);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n - 1; i++) {
cin >> c.at(... | replace | 26 | 27 | 26 | 27 | 0 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
vector<int> C(N);
int ans = 0;
rep(i, N) { cin >> A[i]; }
rep(i, N) {
cin >> B[i];
ans += B[i];
}
rep(i, N) { cin >> C[i]; }
... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
vector<int> C(N);
int ans = 0;
rep(i, N) { cin >> A[i]; }
rep(i, N) {
cin >> B[i];
ans += B[i];
}
rep(i, N) { cin >> C[i]; }
... | replace | 16 | 18 | 16 | 18 | 0 | |
p02916 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int MOD = 1000000007;
int main(void) {
int N, ans = 0;
cin >> N;
int A[N + 10], B[N + 10], C[N + 10];
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
for (int ... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int MOD = 1000000007;
int main(void) {
int N, ans = 0;
cin >> N;
int A[N + 10], B[N + 10], C[N + 10];
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
for (int ... | replace | 20 | 21 | 20 | 21 | 0 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
scanf("%d", &N);
vector<int> A(N, 0);
for (int i = 0; i < N; i++) {
scanf("%d", &A.at(i));
A.at(i)--;
}
vector<int> B(N, 0);
for (int i = 0; i < N; i++) {
scanf("%d", &B.at(i));
}
vector<int> C(N - 1, 0);
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
scanf("%d", &N);
vector<int> A(N, 0);
for (int i = 0; i < N; i++) {
scanf("%d", &A.at(i));
A.at(i)--;
}
vector<int> B(N, 0);
for (int i = 0; i < N; i++) {
scanf("%d", &B.at(i));
}
vector<int> C(N - 1, 0);
for (int i = ... | replace | 26 | 27 | 26 | 27 | 0 | |
p02916 | C++ | Time Limit Exceeded |
#include <iostream>
#include <string>
int main(void) {
//
int N;
N = 0;
std::cin >> N;
// A
int *A = new int[N]();
int *B = new int[N]();
int *C = new int[N]();
for (int i = 1; i <= N; i++) {
while (!(std::cin >> A[i])) {
}
// std::cout << A[i] << std::endl;
//
}
// B
int sum =... |
#include <iostream>
#include <string>
int main(void) {
//
int N;
N = 0;
std::cin >> N;
// A
int *A = new int[N]();
int *B = new int[N]();
int *C = new int[N]();
for (int i = 1; i <= N; i++) {
while (!(std::cin >> A[i])) {
}
// std::cout << A[i] << std::endl;
//
}
// B
int sum =... | delete | 43 | 45 | 43 | 43 | TLE | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
cin >> A;
vector<int> b(A + 1);
vector<int> c(A + 1);
vector<int> d(A + 1);
int ans = 0;
for (int i = 0; i < A; i++) {
cin >> b.at(i);
}
for (int i = 0; i < A; i++) {
cin >> c.at(i);
}
for (int i = 0; i < A - 1; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
cin >> A;
vector<int> b(A + 1);
vector<int> c(A + 1);
vector<int> d(A + 1);
int ans = 0;
for (int i = 0; i < A; i++) {
cin >> b.at(i);
}
for (int i = 0; i < A; i++) {
cin >> c.at(i);
}
for (int i = 0; i < A - 1; i++) {
... | replace | 22 | 25 | 22 | 25 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 18446744073709551615) >= this->size() (which is 4)
|
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int chk = -1;
int pnt = 0;
cin >> n;
vector<int> a(n);
vector<int> b(n);
vector<int> c(n - 1);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n - 1; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int chk = -1;
int pnt = 0;
cin >> n;
vector<int> a(n);
vector<int> b(n);
vector<int> c(n - 1);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n - 1; i... | replace | 26 | 27 | 26 | 27 | 0 | |
p02916 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> a{0}, b{0}, c{0};
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
for (int i = 0; i < n - 1; ++i)
cin >> c[i];
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
int a[n], b[n], c[n - 1];
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
for (int i = 0; i < n - 1; ++i)
cin >> c[i];
fo... | replace | 9 | 10 | 9 | 10 | 0 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
int before = n + 1;
vector<int> a(n), b(n), c(n - 1);
for (int i = 0; i < n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n - 1; i++)
cin >> c.at(i);
for (in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
int before = n + 1;
vector<int> a(n), b(n), c(n - 1);
for (int i = 0; i < n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n - 1; i++)
cin >> c.at(i);
for (in... | replace | 22 | 23 | 22 | 23 | 0 | |
p02916 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define pp pair<int, int>
const int INF = 1001001001;
// int 2×10の9乗
// vector<vector<int>> a(n, vector<int>(m));
// rep(i,n){
// rep(j,m) cin >> a[i][j];
//}
int main() {
int n;
cin >> n;
vec... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define pp pair<int, int>
const int INF = 1001001001;
// int 2×10の9乗
// vector<vector<int>> a(n, vector<int>(m));
// rep(i,n){
// rep(j,m) cin >> a[i][j];
//}
int main() {
int n;
cin >> n;
vec... | replace | 17 | 29 | 17 | 26 | 0 | |
p02916 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, a[n], b[n], c[n - 1];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i <= n; i++) {
cin >> c[i];
}
int score = b[a[0] - 1];
for (int i = 1; i < n; i++) {
... | #include <iostream>
using namespace std;
int main() {
int n, a[21], b[21], c[21];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i <= n; i++) {
cin >> c[i];
}
int score = b[a[0] - 1];
for (int i = 1; i < n; i++) {
... | replace | 4 | 5 | 4 | 5 | -11 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[21], b[21], s = 0;
cin >> n;
for (int i = 1; i <= n - 1; i++)
scanf("%d", &b[i]);
for (int i = n - 1; i >= 1; i--) {
if (i == n - 1) {
a[i + 1] = b[i];
a[i] = b[i];
} else if (b[i] < a[i + 1]) {
a[i + 1] = b[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[101], b[101], s = 0;
cin >> n;
for (int i = 1; i <= n - 1; i++)
scanf("%d", &b[i]);
for (int i = n - 1; i >= 1; i--) {
if (i == n - 1) {
a[i + 1] = b[i];
a[i] = b[i];
} else if (b[i] < a[i + 1]) {
a[i + 1] = b[i];
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (in i = 0; i < (in)(n); i++)
const double PI = 3.14159265358979323846;
const int64_t waru = 1000000007;
const in INF = 1 << 30;
#define vecvec(a, y, x) vector<vector<int>> a(y... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (in i = 0; i < (in)(n); i++)
const double PI = 3.14159265358979323846;
const int64_t waru = 1000000007;
const in INF = 1 << 30;
#define vecvec(a, y, x) vector<vector<int>> a(y... | insert | 16 | 16 | 16 | 17 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p02917 | 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;
int main() {
int n;
vector<int> b(n - 1);
rep(i, n - 1) cin >> b[i];
vector<int> a(n);
a[0] = b[0];
for (int i = 1; i <= n - 2; i++) {
a[i] = min(b[i], b[i - 1]);
}
a[n - 1] = b[n - 2... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> b(n - 1);
rep(i, n - 1) cin >> b[i];
vector<int> a(n);
a[0] = b[0];
for (int i = 1; i <= n - 2; i++) {
a[i] = min(b[i], b[i - 1]);
}
a[n - ... | insert | 7 | 7 | 7 | 8 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define pp pair<int, int>
const int INF = 1001001001;
// int 2×10の9乗
// vector<vector<int>> a(n, vector<int>(m));
// rep(i,n){
// rep(j,m) cin >> a[i][j];
//}
int main() {
int n;
cin >> n;
vec... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define pp pair<int, int>
const int INF = 1001001001;
// int 2×10の9乗
// vector<vector<int>> a(n, vector<int>(m));
// rep(i,n){
// rep(j,m) cin >> a[i][j];
//}
int main() {
int n;
cin >> n;
vec... | replace | 17 | 24 | 17 | 23 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int BIG = 1e9 + 555;
const int maxN = 20 + 9;
int n;
int a[maxN], b[maxN];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i + 1 <= n; i++) {
cin >> b[i];
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int BIG = 1e9 + 555;
const int maxN = 1e5 + 9;
int n;
int a[maxN], b[maxN];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i + 1 <= n; i++) {
cin >> b[i];
}
... | replace | 6 | 7 | 6 | 7 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
typedef long long ll;
int n;
vector<int> b;
ll ans;
const int inf = 100000000;
int main(int argc, char **argv) {
cin >> n;
b.resize(n - 1);
rep(i, n - 1) { cin >> b[i]; }... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
typedef long long ll;
int n;
vector<int> b;
ll ans;
const int inf = 100000000;
int main(int argc, char **argv) {
cin >> n;
b.resize(n);
rep(i, n - 1) { cin >> b[i]; }
b... | replace | 11 | 12 | 11 | 12 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
vector<int> b(n - 1);
rep(i, n - 1) cin >> b[i];
vector<int> a(n);
a[0] = b[0];
for (int i = 1; i <= n - 2; i++) {
a[i] = min(b[i], b[i - 1])... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> b(n - 1);
rep(i, n - 1) cin >> b[i];
vector<int> a(n);
a[0] = b[0];
for (int i = 1; i <= n - 2; i++) {
a[i] = min(b[i... | insert | 8 | 8 | 8 | 9 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
int main() {
int N;
vector<ll> A(N + 1);
vector<ll> B(N);
for (int i = 1; i <= N - 1; i++)
cin >> B[i];
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
for (int i = 1; i <= N - 1; i++)
ci... | insert | 8 | 8 | 8 | 9 | 0 | |
p02917 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), B(N - 1);
for (int i = 1; i <= N - 1; i++) {
cin >> B[i];
}
int ans = B[1] + B[N - 1];
for (int i = 0; i <= N - 2; i++) {
ans += min(B[i], B[i + 1]);
}
cout << ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> B(N);
for (int i = 1; i <= N - 1; i++) {
cin >> B[i];
}
int ans = B[1] + B[N - 1];
for (int i = 0; i <= N - 2; i++) {
ans += min(B[i], B[i + 1]);
}
cout << ans << end... | replace | 9 | 10 | 9 | 10 | 0 | |
p02917 | 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 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> B(N - 1);
for (int i = 0; i < N - 1; i++) {
cin >> B.at(i);
}
int A = B.at(0) + B.at(N - 1);
for (int i = 0; i < N - 2; i++) {
if (B.at(i) <= B.at(i + 1)) {
A = A + B.at(i);
} else if (B.at(i) > B... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> B(N - 1);
for (int i = 0; i < N - 1; i++) {
cin >> B.at(i);
}
int A = B.at(0) + B.at(N - 2);
for (int i = 0; i < N - 2; i++) {
if (B.at(i) <= B.at(i + 1)) {
A = A + B.at(i);
} else if (B.at(i) > B... | replace | 13 | 14 | 13 | 14 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p02917 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define i64 int64_t
#define tos(x) to_string(x)
int main() {
int n;
vector<int> data(n + 1)... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define i64 int64_t
#define tos(x) to_string(x)
int main() {
int n;
cin >> n;
vector<int>... | insert | 16 | 16 | 16 | 17 | 0 | |
p02917 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> B(N - 1, 0);
for (int i = 0; i < N - 1; i++) {
int Bi;
cin >> Bi;
B[i] = Bi;
}
B[N - 1] = B[N - 2];
vector<int> A(N, 0);
A[0] = B[0];
int prev = B[1];
for (int i = 1;... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> B(N, 0);
for (int i = 0; i < N - 1; i++) {
int Bi;
cin >> Bi;
B[i] = Bi;
}
B[N - 1] = B[N - 2];
vector<int> A(N, 0);
A[0] = B[0];
int prev = B[1];
for (int i = 1; i <... | replace | 9 | 10 | 9 | 10 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF 1 << 30
#define endl '\n'
#define maxn 100005
#define tc printf("Case %d: ", cs)
#define tcn printf("Case %d:\n", cs);
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
const double PI = acos(-1.0);
#define dbg1(x) ... | #include <bits/stdc++.h>
using namespace std;
#define INF 1 << 30
#define endl '\n'
#define maxn 100005
#define tc printf("Case %d: ", cs)
#define tcn printf("Case %d:\n", cs);
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
const double PI = acos(-1.0);
#define dbg1(x) ... | replace | 108 | 109 | 108 | 109 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define p... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define p... | replace | 180 | 181 | 180 | 181 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define ALL(x) (x).begin(), (x).end()
#defi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define ALL(x) (x).begin(), (x).end()
#defi... | replace | 46 | 48 | 46 | 48 | -6 | 2 0 5
munmap_chunk(): invalid pointer
|
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
const... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
const... | replace | 15 | 16 | 15 | 16 | -6 | free(): invalid pointer
|
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | replace | 197 | 198 | 197 | 198 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p02917 | Python | Runtime Error | n = int(input())
B = list(map(int, input().split()))
ans = 0
ans += B[0]
for i in range(n - 2):
if B[i] > B[i + 1]:
ans += B[i + i]
else:
ans += B[i]
ans += B[-1]
print(ans)
| n = int(input())
B = list(map(int, input().split()))
ans = 0
ans += B[0]
for i in range(n - 2):
if B[i] > B[i + 1]:
ans += B[i + 1]
else:
ans += B[i]
ans += B[-1]
print(ans)
| replace | 6 | 7 | 6 | 7 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int b[1000010];
long long ans = 0;
int main() {
int n;
scanf("%d", n);
for (int i = 1; i < n; i++)
scanf("%d", &b[i]);
b[0] = b[n] = 0x7f7f7f7f;
for (int i = 1; i <= n; i++)
ans += min(b[i - 1], b[i]);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int b[1000010];
long long ans = 0;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i < n; i++)
scanf("%d", &b[i]);
b[0] = b[n] = 0x7f7f7f7f;
for (int i = 1; i <= n; i++)
ans += min(b[i - 1], b[i]);
cout << ans << endl;
return 0;
}
| replace | 9 | 10 | 9 | 10 | -11 | |
p02917 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int numbers_count;
vector<int> limit_values;
cin >> numbers_count;
for (int i = 0; i < numbers_count - 1; i++) {
int lv;
cin >> lv;
limit_values.push_back(lv);
}
int sum = limit_values[0];
for (int i = 1; i < numb... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int numbers_count;
vector<int> limit_values;
cin >> numbers_count;
for (int i = 0; i < numbers_count - 1; i++) {
int lv;
cin >> lv;
limit_values.push_back(lv);
}
int sum = limit_values[0];
for (int i = 1; i < numb... | replace | 18 | 19 | 18 | 19 | TLE | |
p02917 | Python | Runtime Error | N = int(input())
B = [int(i) for i in input().split()][::-1]
# N = 6
# B = [0, 153, 10, 10, 23]
# N = 3
# B = [2, 5]
ans = 0
ans += B[1] # A[1]
for i in range(0, N - 1):
ans += min(B[i - 1], B[i])
print(ans)
| N = int(input())
B = [int(i) for i in input().split()][::-1]
ret = B[0] + B[N - 2]
for i in range(1, N - 1):
ret += min(B[i - 1], B[i])
print(ret)
| replace | 2 | 11 | 2 | 6 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n - 1);
for (int i = 0; i < n - 1; i++) {
cin >> b[i];
}
a[0] = b[0];
a[n] = b[n - 1];
for (int i = 0; i < n - 1; i++) {
a[i + 1] = min(b[i], b[i + 1]);
}
int sum = 0;
for (int i = 0; i < n;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n - 1);
for (int i = 0; i < n - 1; i++) {
cin >> b[i];
}
a[0] = b[0];
a[n - 1] = b[n - 2];
for (int i = 0; i < n - 2; i++) {
a[i + 1] = min(b[i], b[i + 1]);
}
int sum = 0;
for (int i = 0; i ... | replace | 13 | 15 | 13 | 15 | 0 | |
p02917 | C++ | Runtime Error | #include <iostream>
int main() {
int i, N, B[20];
scanf("%d", &N);
for (i = 0; i <= N - 2; i++) {
scanf("%d", &B[i]);
}
if (N == 2) {
printf("%d", B[0] * 2);
return 0;
}
int sum = B[0];
for (i = 0; i <= N - 3; i++) {
if (B[i] >= B[i + 1]) {
sum = sum + B[i + 1];
} else {
... | #include <iostream>
int main() {
int i, N, B[100];
scanf("%d", &N);
for (i = 0; i <= N - 2; i++) {
scanf("%d", &B[i]);
}
if (N == 2) {
printf("%d", B[0] * 2);
return 0;
}
int sum = B[0];
for (i = 0; i <= N - 3; i++) {
if (B[i] >= B[i + 1]) {
sum = sum + B[i + 1];
} else {
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> B(N - 1);
long sum = 0;
bool flag = true;
for (int i = 0; i < N - 1; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N - 1; i++) {
if (i == 0) {
sum += B.at(i);
if (B.at(i) > B.at(i + 1)) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> B(N - 1);
long sum = 0;
bool flag = true;
for (int i = 0; i < N - 1; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N - 1; i++) {
if (i == 0) {
sum += B.at(i);
if (N > 2) {
if (B.at(i)... | replace | 19 | 21 | 19 | 25 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// ----------------------R00TDADA------------------------------
#define rep(i, a, b) for (__typeof((b)) i = (a); i < (b); i++)
#define nrep(i, a, b) for (__typeof((b)) i = (b); i > (a); i--)
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pp... | #include <bits/stdc++.h>
using namespace std;
// ----------------------R00TDADA------------------------------
#define rep(i, a, b) for (__typeof((b)) i = (a); i < (b); i++)
#define nrep(i, a, b) for (__typeof((b)) i = (b); i > (a); i--)
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pp... | replace | 22 | 28 | 22 | 23 | -11 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
vector<int> b(n - 1);
rep(i, n - 1) cin >> b[i];
vector<int> a(n);
rep(i, n) {
if (i == 0)
a[i] = b[i];
else if (i == n - 1)
a[... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> b(n - 1);
rep(i, n - 1) cin >> b[i];
vector<int> a(n);
rep(i, n) {
if (i == 0)
a[i] = b[i];
else if (i == n -... | insert | 8 | 8 | 8 | 9 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> b(n);
for (int i = 0; i < n - 1; i++)
cin >> b[i];
b[n] = 0;
vector<int> a(n);
a[0] = b[0];
for (int i = 1; i < n - 1; i++) {
if (b[i] >= b[i - 1])
a[i] = b[i - 1];
else
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> b(n);
for (int i = 0; i < n - 1; i++)
cin >> b[i];
b[n - 1] = 0;
vector<int> a(n);
a[0] = b[0];
for (int i = 1; i < n - 1; i++) {
if (b[i] >= b[i - 1])
a[i] = b[i - 1];
else
... | replace | 10 | 11 | 10 | 11 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum;
sum = 0;
vector<int> b(n - 1);
vector<int> a(n);
for (int i = 0; i < n - 1; i++) {
cin >> b.at(i);
}
a.at(0) = b.at(0);
a.at(n - 1) = b.at(n - 2);
for (int i = 1; i < n - 1; i++) {
a.at(i) = min(b.at(i - 1), b.at(i));
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum;
sum = 0;
cin >> n;
vector<int> b(n - 1);
vector<int> a(n);
for (int i = 0; i < n - 1; i++) {
cin >> b.at(i);
}
a.at(0) = b.at(0);
a.at(n - 1) = b.at(n - 2);
for (int i = 1; i < n - 1; i++) {
a.at(i) = min(b.at(i - 1), b.... | insert | 6 | 6 | 6 | 7 | 0 | |
p02917 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = (int)m; i ... |
#include <bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = (int)m; i ... | replace | 36 | 37 | 36 | 37 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
int n;
cin >> n;
n--;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int sum = 0;
for (int i = n - 1; i >= 0; i--) {
// cout<<a... | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
int n;
cin >> n;
n--;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int sum = 0;
for (int i = n - 1; i >= 0; i--) {
// cout<<a[i]<<endl;
if (i + 1 < n) {
if (a[i] > a[i + 1]) {
... | replace | 6 | 9 | 6 | 7 | -11 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ff first
#define ss second
#define MAX 10005
#define endl "\n"
#define mp make_pair
#define pb push_back
#define int long long
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define vi vector<int>
#define mii map<int, int>
#define pii pair<int, int>
#define len(x) (x.size())
#define all(... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define MAX 10005
#define endl "\n"
#define mp make_pair
#define pb push_back
#define int long long
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define vi vector<int>
#define mii map<int, int>
#define pii pair<int, int>
#define len(x) (x.size())
#define all(... | replace | 45 | 49 | 45 | 46 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> b(n - 1);
cin >> n;
for (int i = 0; i < n - 1; ++i)
cin >> b[i];
vector<int> a(n);
a[0] = b[0];
a[n - 1] = b[n - 2];
for (int i = 1; i < n - 1; ++i) {
a[i] = min(b[i - 1], b[i]);
}
int sum = 0;
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> b(n - 1);
cin >> n;
for (int i = 0; i < n - 1; ++i)
cin >> b[i];
vector<int> a(n);
a[0] = b[0];
a[n - 1] = b[n - 2];
for (int i = 1; i < n - 1; ++i) {
a[i] = min(b[i - 1], b[i]);
}
int sum = 0;
for (int i = 0; i ... | delete | 19 | 21 | 19 | 19 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> b(n - 1);
vector<int> a(n);
for (int i = 0; i < n - 1; i++)
cin >> b[i];
for (int i = n - 1; i >= 0; i++) {
if (i == 0) {
a[i] = b[i];
} else if (i == n - 1) {
a[i] = b[i - 1];
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> b(n - 1);
vector<int> a(n);
for (int i = 0; i < n - 1; i++)
cin >> b[i];
for (int i = n - 1; i >= 0; i--) {
if (i == 0) {
a[i] = b[i];
} else if (i == n - 1) {
a[i] = b[i - 1];
} else {
... | replace | 11 | 12 | 11 | 12 | -11 | |
p02917 | C++ | Runtime Error | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n - 1);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
a[0] = b[0];
a[n] = b[n - 1];
int count = a[0] + a[n];
for (int j = 1; j < n; j++) {
a[j] = min(b[j... | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n - 1);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
a[0] = b[0];
a[n - 1] = b[n - 2];
int count = a[n - 1] + a[0];
for (int j = 1; j < n - 1; j++) {
a[... | replace | 14 | 17 | 14 | 17 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc ... | insert | 16 | 16 | 16 | 17 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, b[n - 1], a[n];
int c = 0;
cin >> n;
for (int i = 0; i < n - 1; i++) {
cin >> b[i];
}
a[0] = b[0];
a[n - 1] = b[n - 2];
for (int i = 0; i < n - 2; i++) {
a[i + 1] = min(b[i], b[i + 1]);
}
for (int i = 0; i < n; i++) {
c +=... | #include <bits/stdc++.h>
using namespace std;
int main() {
long int n, b[n - 1], a[n];
long int c = 0;
cin >> n;
for (int i = 0; i < n - 1; i++) {
cin >> b[i];
}
a[0] = b[0];
a[n - 1] = b[n - 2];
for (int i = 0; i < n - 2; i++) {
a[i + 1] = min(b[i], b[i + 1]);
}
for (int i = 0; i < n; i++) ... | replace | 3 | 5 | 3 | 5 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repm(i, m, n) for (int i = (m); i < (int)(n); i++)
#define repr(i, n) for (int i = (n); i > 0; i--)
#define all(vec) vec.begin(), vec.end()
using namespace std;
int main() {
int a;
// string a;
cin >> a;
vector<int> seq(a - 1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repm(i, m, n) for (int i = (m); i < (int)(n); i++)
#define repr(i, n) for (int i = (n); i > 0; i--)
#define all(vec) vec.begin(), vec.end()
using namespace std;
int main() {
int a;
// string a;
cin >> a;
vector<int> seq(a - 1... | replace | 20 | 23 | 20 | 25 | 0 | |
p02917 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> B(N);
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
A[i] = B[i];
if (B[i] < B[i + 1])
A[i + 1] = B[i];
else
A[i + 1] = B[i + 1];
}
int ans = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> B(N);
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> B[i];
A[0] = B[0];
A[N - 1] = B[N - 2];
for (int i = 1; i < N - 1; i++) {
A[i] = min(B[i], B[i - 1]);
}
int ans = 0;
for (int i = 0; i < N; i+... | replace | 10 | 17 | 10 | 14 | 0 | |
p02918 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<pair<char, int>> T;
S += "X";
char prev = S[0];
int num = 1;
for (int i = 1; i < S.siz... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<pair<char, int>> T;
S += "X";
char prev = S[0];
int num = 1;
for (int i = 1; i < S.siz... | replace | 41 | 42 | 41 | 43 | 0 | |
p02918 | C++ | Time Limit Exceeded | #include <iostream>
#include <unordered_map>
using namespace std;
unordered_map<string, int> mp;
int getHappyValue(string &s) {
int size = s.size();
int happy = 0;
for (int i = 0; i < size - 1; i++) {
if (s[i] == s[i + 1]) {
happy++;
}
}
return happy;
}
void getRotateString(string &s, int l, ... | #include <iostream>
#include <unordered_map>
using namespace std;
unordered_map<string, int> mp;
int getHappyValue(string &s) {
int size = s.size();
int happy = 0;
for (int i = 0; i < size - 1; i++) {
if (s[i] == s[i + 1]) {
happy++;
}
}
return happy;
}
void getRotateString(string &s, int l, ... | replace | 19 | 28 | 19 | 24 | TLE | |
p02918 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
string s... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
string s... | replace | 17 | 53 | 17 | 20 | 0 | |
p02918 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <util... | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <util... | replace | 82 | 83 | 82 | 96 | 0 | |
p02918 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define int long long
using namespace std;
const int INF = 1e10;
const int ZERO = 0;
signed main() {
int... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define int long long
using namespace std;
const int INF = 1e10;
const int ZERO = 0;
signed main() {
int... | replace | 39 | 40 | 39 | 44 | 0 | |
p02918 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
string str;
int N, K;
char nt(char a) {
if (a == 'R') {
return 'L';
}
if (a == 'L') {
return 'R';
}
}
int findInd(int a) {
int i = a;
char c = str[a];
while (str[i] == c) {
i++;
}
return i;
}
int rep(int l, int r) {
string a(str);
for (int i =... | #include <iostream>
using namespace std;
string str;
int N, K;
char nt(char a) {
if (a == 'R') {
return 'L';
}
if (a == 'L') {
return 'R';
}
}
int findInd(int a) {
int i = a;
char c = str[a];
while (str[i] == c) {
i++;
}
return i;
}
int rep(int l, int r) {
string a(str);
for (int i =... | replace | 45 | 47 | 45 | 49 | TLE | |
p02918 | C++ | Runtime Error | #include <algorithm> // minmax, sort, swap
#include <climits> // INT_MIN, LLONG_MIN
#include <cmath> // long, trig, pow
#include <cstdio> // printf, scanf
#include <deque> // deque
#include <functional> // std::function<void(int)>
#include <iomanip> // cout<<setprecision(n)
#in... | #include <algorithm> // minmax, sort, swap
#include <climits> // INT_MIN, LLONG_MIN
#include <cmath> // long, trig, pow
#include <cstdio> // printf, scanf
#include <deque> // deque
#include <functional> // std::function<void(int)>
#include <iomanip> // cout<<setprecision(n)
#in... | replace | 44 | 45 | 44 | 47 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.