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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define F(i, j, k, in) for (int i = j; i < k; i += in)
#define DF(i, j, k, in) for (int i = j; i >= k; i -= in)
#define foreach(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define PB push_back
#define ub upper_bound
#define lb lower_bound
#define ins insert
#d... | #include <bits/stdc++.h>
#define ll long long int
#define F(i, j, k, in) for (int i = j; i < k; i += in)
#define DF(i, j, k, in) for (int i = j; i >= k; i -= in)
#define foreach(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define PB push_back
#define ub upper_bound
#define lb lower_bound
#define ins insert
#d... | replace | 15 | 16 | 15 | 16 | 0 | |
p02725 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 20000... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 20000... | replace | 50 | 51 | 50 | 51 | 0 | |
p02725 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a[100005];
int k, n;
cin >> k >> n;
a[0] = 0;
a[n + 1] = k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int ans = a[n] - a[1];
for (int i = 1; i <= n; i++) {
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a[200005];
int k, n;
cin >> k >> n;
a[0] = 0;
a[n + 1] = k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int ans = a[n] - a[1];
for (int i = 1; i <= n; i++) {
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
cin >> K >> N;
int house[20010];
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> house[i];
}
for (int i = 0; i < N - 1; i++) {
ans = max(house[i + 1] - house[i], ans);
}
ans = max(K - house[N - 1] + house[0], ans);
cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
cin >> K >> N;
int house[200010];
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> house[i];
}
for (int i = 0; i < N - 1; i++) {
ans = max(house[i + 1] - house[i], ans);
}
ans = max(K - house[N - 1] + house[0], ans);
cou... | replace | 6 | 7 | 6 | 7 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
vector<int> A(N);
cin >> K >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
int ans = A[N - 1] - A[0];
for (int i = 0; i < N - 1; i++) {
if (K - (A[i + 1] - A[i]) < ans)
ans = K - (A[i + 1] - A[i]);
}
cout << ans << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long K, N;
vector<long long> A(N);
cin >> K >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
int ans = A[N - 1] - A[0];
for (int i = 0; i < N - 1; i++) {
if (K - (A[i + 1] - A[i]) < ans)
ans = K - (A[i + 1] - A[i]);
}
cout... | replace | 5 | 7 | 5 | 7 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int K, N;
cin >> K >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
int distance = K - A.at(0) + A.at(N - 1);
for (int i = 0; i < N; i++) {
if (distance ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int K, N;
cin >> K >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
int distance = K - A.at(0) + A.at(N - 1);
for (int i = 0; i < N - 1; i++) {
if (dista... | replace | 12 | 13 | 12 | 13 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 3) >= this->size() (which is 3)
|
p02725 | C++ | Runtime Error | #define __LOCAL_DEBUG__
#include <bits/stdc++.h>
using namespace std;
#ifdef __LOCAL_DEBUG__
#define _debug(x) \
{ cerr << "\033[94m" << __func__ << " " << #x << ": " << (x) << "\n\033[0m"; }
#else
#define _debug(x) ... | #define __LOCAL_DEBUG__
#include <bits/stdc++.h>
using namespace std;
#ifdef __LOCAL_DEBUG__
#define _debug(x) \
{ cerr << "\033[94m" << __func__ << " " << #x << ": " << (x) << "\n\033[0m"; }
#else
#define _debug(x) ... | replace | 35 | 36 | 35 | 36 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
#define f(i, a, b) for (ll i = a; i < (ll)b; i++)
#define af(i, a, b) for (ll i = a; i >= (ll)b; i--)
#define rep(i, a, b, k) for (ll i = a; i < b; i += k)
#define arep(i, a, b, k) for (ll i = a; i >= b; i -= k)
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#defi... | #include <bits/stdc++.h>
#define f(i, a, b) for (ll i = a; i < (ll)b; i++)
#define af(i, a, b) for (ll i = a; i >= (ll)b; i--)
#define rep(i, a, b, k) for (ll i = a; i < b; i += k)
#define arep(i, a, b, k) for (ll i = a; i >= b; i -= k)
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#defi... | replace | 28 | 29 | 28 | 29 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define M 1000000007
#define mod 998244353
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define pi pair<ll, ll>
using namespace std;
const ll N = 100010;
ll dis(ll x, ll y, ll n) { return n - min(abs(x - y), n - abs(x - y)); }
int main() {
ios_base::s... | #include <bits/stdc++.h>
#define ll long long int
#define M 1000000007
#define mod 998244353
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define pi pair<ll, ll>
using namespace std;
const ll N = 100010;
ll dis(ll x, ll y, ll n) { return n - min(abs(x - y), n - abs(x - y)); }
int main() {
ios_base::s... | replace | 24 | 25 | 24 | 25 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
int n, k;
int a[MAXN];
const int MOD = 1e9 + 7;
int main() {
cin >> k >> n;
int maxVal = -1;
cin >> a[0];
for (int i = 1; i < n; i++) {
cin >> a[i];
maxVal = max(maxVal, a[i] - a[i - 1]);
}
maxVal = max(maxVal, k - a[n ... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
int n, k;
int a[MAXN];
const int MOD = 1e9 + 7;
int main() {
cin >> k >> n;
int maxVal = -1;
cin >> a[0];
for (int i = 1; i < n; i++) {
cin >> a[i];
maxVal = max(maxVal, a[i] - a[i - 1]);
}
maxVal = max(maxVal, k - a[n ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long k, maX, ans, n, i;
long long a[100000];
int main() {
cin >> i >> n;
for (k = 1; k <= n; k++) {
cin >> a[k];
}
sort(a + 1, a + 1 + n);
for (k = 2; k <= n; k++) {
maX = max(a[k] - a[k - 1], maX);
}
maX = max(maX, a[1] - a[n] + i);
cout << i -... | #include <bits/stdc++.h>
using namespace std;
long long k, maX, ans, n, i;
long long a[10000000];
int main() {
cin >> i >> n;
for (k = 1; k <= n; k++) {
cin >> a[k];
}
sort(a + 1, a + 1 + n);
for (k = 2; k <= n; k++) {
maX = max(a[k] - a[k - 1], maX);
}
maX = max(maX, a[1] - a[n] + i);
cout << i... | replace | 3 | 4 | 3 | 4 | 0 | |
p02725 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define MOD 1000000007
#define A first
#define B second
#define... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define MOD 1000000007
#define A first
#define B second
#define... | replace | 60 | 61 | 60 | 61 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=nati... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=nati... | replace | 125 | 126 | 125 | 126 | 0 | |
p02725 | C++ | Runtime Error | /*
NO
TIME
TO
DIE
--007
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
// #include <boost/functional/hash.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long ... | /*
NO
TIME
TO
DIE
--007
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
// #include <boost/functional/hash.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long ... | replace | 48 | 52 | 48 | 49 | 0 | |
p02725 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int k, n, a[200010], minn;
int main() {
cin >> k >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n; i++) {
int ans = 0;
int j = i;
int f = (i == 0) ? (n - 1) : (i - 1);
while (1) {
ans = ans + (a[j + 1] -... | #include <bits/stdc++.h>
using namespace std;
int k, n, a[200010], minn;
int main() {
cin >> k >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n; i++) {
int ans = 0;
int f = (i + n - 1) % n;
ans = (a[f] - a[i] + k) % k;
if (i == 0)
minn = ans;
el... | replace | 11 | 20 | 11 | 13 | TLE | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mod 1e9 + 7;
#define INF 1e9 + 9;
#define ps(x, y) fixed << setprecision(y) << x
#define PI 3.14159265358979323846264338327950 L
typedef long long ll;
typedef unsigned long long ull;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ... | #include <bits/stdc++.h>
using namespace std;
#define mod 1e9 + 7;
#define INF 1e9 + 9;
#define ps(x, y) fixed << setprecision(y) << x
#define PI 3.14159265358979323846264338327950 L
typedef long long ll;
typedef unsigned long long ull;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ... | replace | 14 | 16 | 14 | 16 | 0 | |
p02725 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <u... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <u... | replace | 24 | 25 | 24 | 25 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 100;
ll a[maxn];
int main() {
int n, k;
cin >> k >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
a[n + 1] = k + a[1];
n++;
ll sum = 0, mx = 0;
for (int i = 2; i <= n; i++) {
sum += a[i] - a[i - 1];
mx = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 3e5 + 100;
ll a[maxn];
int main() {
int n, k;
cin >> k >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
a[n + 1] = k + a[1];
n++;
ll sum = 0, mx = 0;
for (int i = 2; i <= n; i++) {
sum += a[i] - a[i - 1];
mx = ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
int a[100005];
void solve() {
int k, n;
cin >> k >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ans = a[n - 1] - a[0];
for (int i = 1; i < n; i++) {
ans = min(ans, k - a[i] + a[i - 1]);
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
int a[200005];
void solve() {
int k, n;
cin >> k >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ans = a[n - 1] - a[0];
for (int i = 1; i < n; i++) {
ans = min(ans, k - a[i] + a[i - 1]);
}
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02725 | C++ | Runtime Error | // Best practice
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define pf emplace_front
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pii pair<int, int>
#define psi pair<string, int>
#define vi vector<int>
#define vpii vector<pii>
#define vvi vector<vi>
#... | // Best practice
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define pf emplace_front
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pii pair<int, int>
#define psi pair<string, int>
#define vi vector<int>
#define vpii vector<pii>
#define vvi vector<vi>
#... | replace | 31 | 39 | 31 | 32 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02725 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int k, n;
cin >> k >> n;
int a[100001];
for (int i = 0; i < n; i++)
cin >> a[i];
int m, ans;
ans = a[n - 1] - a[0];
for (int i = 0; i < n - 1; i++) {
int s = (k - a[i + 1]) + a[i];
ans = min(ans, s);
}
cout << ans... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int k, n;
cin >> k >> n;
int a[200001];
for (int i = 0; i < n; i++)
cin >> a[i];
int m, ans;
ans = a[n - 1] - a[0];
for (int i = 0; i < n - 1; i++) {
int s = (k - a[i + 1]) + a[i];
ans = min(ans, s);
}
cout << ans... | replace | 8 | 9 | 8 | 9 | 0 | |
p02725 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int K, N, maxv = 0;
int A[100000];
cin >> K >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
maxv = K - A[N - 1] + A[0];
for (int i = 0; i < N; i++) {
maxv = max(maxv, A[i + 1] - A[i]);
}
cout << K - maxv << endl;
}
| #include <iostream>
using namespace std;
int main() {
int K, N, maxv = 0;
int A[1000000];
cin >> K >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
maxv = K - A[N - 1] + A[0];
for (int i = 0; i < N; i++) {
maxv = max(maxv, A[i + 1] - A[i]);
}
cout << K - maxv << endl;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02725 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
int main(void) {
int k, n, a[100000000], b[10000000], i, p = 0, l;
scanf("%d%d", &k, &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (i != 0) {
b[i] = a[i] - a[i - 1];
}
}
b[0] = k - a[n - 1] + a[0];
std::sort(b, b + n);
for (i = 0; i < n - 1... | #include <algorithm>
#include <stdio.h>
int main(void) {
int k, n, a[10000000], b[10000000], i, p = 0, l;
scanf("%d%d", &k, &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (i != 0) {
b[i] = a[i] - a[i - 1];
}
}
b[0] = k - a[n - 1] + a[0];
std::sort(b, b + n);
for (i = 0; i < n - 1;... | replace | 3 | 4 | 3 | 4 | -11 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
signed main() {
int k, n;
cin ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
signed main() {
int k, n;
cin ... | replace | 22 | 23 | 22 | 23 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, i;
long long sum = 0;
long long arr[100005];
scanf("%lld%lld", &n, &k);
for (i = 0; i < k; i++) {
scanf("%lld", &arr[i]);
}
sort(arr, arr + k);
for (i = 1; i < k; i++) {
sum = max(sum, arr[i] - arr[i - 1]);
}
sum = ma... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, i;
long long sum = 0;
long long arr[200005];
scanf("%lld%lld", &n, &k);
for (i = 0; i < k; i++) {
scanf("%lld", &arr[i]);
}
sort(arr, arr + k);
for (i = 1; i < k; i++) {
sum = max(sum, arr[i] - arr[i - 1]);
}
sum = ma... | replace | 5 | 6 | 5 | 6 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define deb(x) cout << #x << " " << x << endl;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
#define vi vector<int>
#define ii pair<int, int>
#define vii vector<ii>
#define ll long long
#define pb push_back
#define endl "\n"
#... | #include <bits/stdc++.h>
using namespace std;
#define deb(x) cout << #x << " " << x << endl;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
#define vi vector<int>
#define ii pair<int, int>
#define vii vector<ii>
#define ll long long
#define pb push_back
#define endl "\n"
#... | replace | 22 | 26 | 22 | 26 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, N, a;
cin >> K >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
a = K + A.at(0) - A.at(N - 1);
for (int i = 0; i < N; i++) {
if (A.at(i + 1) - A.at(i) > a) {
a = A.at(i + 1) - A.at(i);
}
}
cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, N, a;
cin >> K >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
a = K + A.at(0) - A.at(N - 1);
for (int i = 0; i < N - 1; i++) {
if (A.at(i + 1) - A.at(i) > a) {
a = A.at(i + 1) - A.at(i);
}
}
co... | replace | 10 | 11 | 10 | 11 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 3) >= this->size() (which is 3)
|
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2 * 100 * 1000 + 20;
int n, k, a[N], ans;
int main() {
cin >> k >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < k; i++)
ans = max(ans, a[i] - a[i - 1]);
ans = max(ans, a[0] + k - a[n - 1]);
return cout << k - ans << "\n",... | #include <bits/stdc++.h>
using namespace std;
const int N = 2 * 100 * 1000 + 20;
int n, k, a[N], ans;
int main() {
cin >> k >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++)
ans = max(ans, a[i] - a[i - 1]);
ans = max(ans, a[0] + k - a[n - 1]);
return cout << k - ans << "\n",... | replace | 10 | 11 | 10 | 11 | 0 | |
p02725 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
// #include<bits/stdc++.h>
#define int long long
#define mod 1000000007
#define for0(i, n) for (int i = 0; i < (n); i++)
#define for1(i, n) for (int i = 1; i <= (n); i++)
#define mp make_pair
#define all(x) x.begin(), x.end()
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
// #include<bits/stdc++.h>
#define int long long
#define mod 1000000007
#define for0(i, n) for (int i = 0; i < (n); i++)
#define for1(i, n) for (int i = 1; i <= (n); i++)
#define mp make_pair
#define all(x) x.begin(), x.end()
... | replace | 13 | 14 | 13 | 14 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[100005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
cin >> a[i];
}
int ans = 1e9;
for (int i = 1; i <= k; i++) {
if (i == 1)
ans = min(ans, n - (a[1] + n - a[k]));
else
ans = min(ans, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[1000005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
cin >> a[i];
}
int ans = 1e9;
for (int i = 1; i <= k; i++) {
if (i == 1)
ans = min(ans, n - (a[1] + n - a[k]));
else
ans = min(ans,... | replace | 3 | 4 | 3 | 4 | 0 | |
p02726 | C++ | Runtime Error | #include <cstring>
#include <iostream>
#include <set>
using namespace std;
int n, x, y;
int ans[1001], viz[1001];
int modul(int x, int y) {
if (x > y)
return x - y;
else
return y - x;
}
int main() {
cin >> n >> x >> y;
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++) {
int minim =... | #include <cstring>
#include <iostream>
#include <set>
using namespace std;
int n, x, y;
int ans[3003], viz[2001];
int modul(int x, int y) {
if (x > y)
return x - y;
else
return y - x;
}
int main() {
cin >> n >> x >> y;
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++) {
int minim =... | replace | 5 | 6 | 5 | 6 | 0 | |
p02726 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define fr(j, p) for (int i = j; i < p; i++)
#define fastScan \
ios::sync_with_stdio... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define fr(j, p) for (int i = j; i < p; i++)
#define fastScan \
ios::sync_with_stdio... | replace | 64 | 65 | 64 | 65 | 0 | |
p02726 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | replace | 295 | 297 | 295 | 297 | 0 | |
p02726 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, f, e) for (int(i) = (f); (i) < (e); (i)++)
#define repr(i, e, f) for (int(i) = (e - 1); (i) >= (f); (i)--)
const ll MOD = 1e9 + 7;
const int INF = (int)1e9 + 7;
// vector<tuple<long,long>> items; // (value, weight)
// auto item = items[... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, f, e) for (int(i) = (f); (i) < (e); (i)++)
#define repr(i, e, f) for (int(i) = (e - 1); (i) >= (f); (i)--)
const ll MOD = 1e9 + 7;
const int INF = (int)1e9 + 7;
// vector<tuple<long,long>> items; // (value, weight)
// auto item = items[... | replace | 65 | 71 | 65 | 66 | TLE | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define inf 1e9
const int mod = (int)1e9 + 7;
vector<int> adj[1005];
vector<int> vis(1005), dist(1005), ans(1005);
void bfs(int v) {
queue<int> q;
q.push(v);
vis[v] = 1;
dist[v] = 0;
while (!q.empty()) {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define inf 1e9
const int mod = (int)1e9 + 7;
vector<int> adj[2005];
vector<int> vis(2005), dist(2005), ans(2005);
void bfs(int v) {
queue<int> q;
q.push(v);
vis[v] = 1;
dist[v] = 0;
while (!q.empty()) {
... | replace | 9 | 11 | 9 | 11 | 0 | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, x, y;
cin >> n >> x >> y;
vector<int> distances(n);
rep(i, n) distances[i] = 0;
for (int i = 1; i <= n - 1; i++) {
for (int j = 1; j <= n; j++) {
int d = min(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, x, y;
cin >> n >> x >> y;
vector<int> distances(n);
rep(i, n) distances[i] = 0;
for (int i = 1; i <= n - 1; i++) {
for (int j = i + 1; j <= n; j++) {
int d = ... | replace | 11 | 12 | 11 | 12 | -6 | munmap_chunk(): invalid pointer
|
p02726 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, X, Y, i, j, ans, dist, list[2001] = {0};
// stdinから入力受付
cin >> N >> X >> Y;
X--;
Y--; // 0からの値に変換
// メイン処理
for (i = 0; i < N - 1; i++) { // 始点
for (j = i + 1; j < N; j++) { // 目的地
// 道を必ず通る場合
if (abs(i -... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, X, Y, i, j, ans, dist, list[2001] = {0};
// stdinから入力受付
cin >> N >> X >> Y;
X--;
Y--; // 0からの値に変換
// メイン処理
for (i = 0; i < N - 1; i++) { // 始点
for (j = i + 1; j < N; j++) { // 目的地
// 道を必ず通る場合
if (abs(i -... | delete | 25 | 26 | 25 | 25 | TLE | |
p02726 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pi... | replace | 97 | 109 | 97 | 103 | TLE | |
p02726 | C++ | Runtime Error | // BISMILLAHIR RAHMANIR RAHIM
#include <bits/stdc++.h>
#define mem(a, b) (memset(a, b, sizeof(a)))
#define pb push_back
#define mk make_pair
#define ff first
#define ss second
#define PI acos(-1)
#define INF 2147483647
#define MOD 1000000007
#define MAX 1005
using namespace std;
typedef long long ll;
typedef vector<in... | // BISMILLAHIR RAHMANIR RAHIM
#include <bits/stdc++.h>
#define mem(a, b) (memset(a, b, sizeof(a)))
#define pb push_back
#define mk make_pair
#define ff first
#define ss second
#define PI acos(-1)
#define INF 2147483647
#define MOD 1000000007
#define MAX 1005
using namespace std;
typedef long long ll;
typedef vector<in... | replace | 23 | 24 | 23 | 24 | 0 | |
p02726 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#in... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#in... | replace | 48 | 49 | 48 | 49 | 0 | |
p02726 | C++ | Runtime Error | // RAKSHIT KADAM
// ALWAYS USE &IT FOR ITERATING USING AUTO ...
// USE COUNT(STARTING ADDRESS, ENDING ADRESS ,VALUE) FOR FINDING THE COUNT IN
// THE RESPECTIVE DATA STRUCTURE NOTE THAT MEMSET CANNOT ASSIGN A VALUE OF 10^18
// IT WILL ASSIGN A LOWER VALUE THAN THAT!!! NOTE THAT MEMSET CANT FILL THE
// DOUBLE VALUES;
#i... | // RAKSHIT KADAM
// ALWAYS USE &IT FOR ITERATING USING AUTO ...
// USE COUNT(STARTING ADDRESS, ENDING ADRESS ,VALUE) FOR FINDING THE COUNT IN
// THE RESPECTIVE DATA STRUCTURE NOTE THAT MEMSET CANNOT ASSIGN A VALUE OF 10^18
// IT WILL ASSIGN A LOWER VALUE THAN THAT!!! NOTE THAT MEMSET CANT FILL THE
// DOUBLE VALUES;
#i... | replace | 81 | 82 | 81 | 82 | 0 | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define all(c) c.begin(), c.end()
#define gmax(x, y) x = max(x, y)
#define gmin(x, y) x = min(x, y)
#define gadd(x, y) x = add(x, y)
#define gmul(x, y) x = mul(x, y)
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
const i... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define all(c) c.begin(), c.end()
#define gmax(x, y) x = max(x, y)
#define gmin(x, y) x = min(x, y)
#define gadd(x, y) x = add(x, y)
#define gmul(x, y) x = mul(x, y)
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
const i... | replace | 12 | 13 | 12 | 13 | 0 | |
p02726 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define IOS ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define IOS ... | replace | 28 | 29 | 28 | 29 | 0 | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int Inf = 1e9 + 5;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int n, x, y;
cin >> n >> x >> y;
vector<vector<int>> dis(n, vector<int>(n));
vector<int> freq(n);
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int Inf = 1e9 + 5;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int n, x, y;
cin >> n >> x >> y;
vector<vector<int>> dis(n + 1, vector<int>(n + 1));
vector<int> freq(n);
for (int i = 1; i <= n; i++) {
for (int j = i ... | replace | 11 | 12 | 11 | 12 | 0 | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll i, j, k, l, m, n, w, x, y, z, p, q, tmp, sum = 0;
ll a[1000];
string str;
cin >> n >> x >> ... | #include <bits/stdc++.h>
#define ll long long
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll i, j, k, l, m, n, w, x, y, z, p, q, tmp, sum = 0;
ll a[100000];
string str;
cin >> n >> x >... | replace | 11 | 12 | 11 | 12 | 0 | |
p02726 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -... | replace | 97 | 98 | 97 | 98 | TLE | |
p02726 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define drep(i, n) for (int... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define drep(i, n) for (int... | replace | 33 | 34 | 33 | 34 | 0 | |
p02726 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
const int MAXN = 1e3 + 5;
int n, x, y;
int dist[MAXN][MAXN], ans[MAXN];
int main() {
scanf("%d%d%d", &n, &x, &y);
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= n; ++j) {
dist[j][i] = dist[i][j] = j - i;
}
}
dist[x][y] = 1;
for (int i = 1; i <= n; +... | #include <algorithm>
#include <cstdio>
const int MAXN = 2e3 + 5;
int n, x, y;
int dist[MAXN][MAXN], ans[MAXN];
int main() {
scanf("%d%d%d", &n, &x, &y);
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= n; ++j) {
dist[j][i] = dist[i][j] = j - i;
}
}
dist[x][y] = 1;
for (int i = 1; i <= n; +... | replace | 3 | 4 | 3 | 4 | 0 | |
p02726 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#... | insert | 286 | 286 | 286 | 287 | -6 | 7fccfae5-c779-441e-8abb-51520c1c32b5.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02726/C++/s452697144.cpp:313: int main(): Assertion `m[i] % 2 == 0' failed.
|
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | delete | 43 | 47 | 43 | 43 | -11 | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[1010];
int main() {
int n, x, y;
cin >> n >> x >> y;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (x <= i && y >= j) {
a[min(j - i, i - x + y - j + 1)]++;
} else {
if (x >= i && y <= j) {
a[j - i ... | #include <bits/stdc++.h>
using namespace std;
int a[2010];
int main() {
int n, x, y;
cin >> n >> x >> y;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (x <= i && y >= j) {
a[min(j - i, i - x + y - j + 1)]++;
} else {
if (x >= i && y <= j) {
a[j - i ... | replace | 2 | 3 | 2 | 3 | 0 | |
p02726 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | replace | 245 | 259 | 245 | 258 | TLE | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5;
struct edge {
int v, nxt;
} e[N];
int p[N], eid;
int ans[N], d[N];
void bfs(int s) {
memset(d, 0x3f, sizeof(d));
queue<int> q;
q.push(s);
d[s] = 0;
while (q.size()) {
int u = q.front();
q.pop();
for (int i = p[u]; ~i; i = e[i... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5;
struct edge {
int v, nxt;
} e[N * 2];
int p[N], eid;
int ans[N], d[N];
void bfs(int s) {
memset(d, 0x3f, sizeof(d));
queue<int> q;
q.push(s);
d[s] = 0;
while (q.size()) {
int u = q.front();
q.pop();
for (int i = p[u]; ~i; i =... | replace | 6 | 7 | 6 | 7 | 0 | |
p02726 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
#define ll long long
const int N = 1e3 + 5;
queue<int> q;
int n;
struct node {
int from, to, next;
} f[2 * N];
int head[N], tot;
int ans[N], vis[N], dis[N];
void add(int a, int b) {
f[++tot].from ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
#define ll long long
const int N = 1e4 + 5;
queue<int> q;
int n;
struct node {
int from, to, next;
} f[2 * N];
int head[N], tot;
int ans[N], vis[N], dis[N];
void add(int a, int b) {
f[++tot].from ... | replace | 9 | 10 | 9 | 10 | 0 | |
p02726 | C++ | Time Limit Exceeded | // Keep Working Hard
// I__Like__Food
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rep2(i, a, b) for (int i = a; i >= b; i--)
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize... | // Keep Working Hard
// I__Like__Food
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rep2(i, a, b) for (int i = a; i >= b; i--)
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize... | delete | 101 | 104 | 101 | 101 | TLE | |
p02726 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
--x, --y;
int t = y - x - 1;
for (int i = 1; i < n; ++i) {
int res = 0;
for (int j = 0; j < n; ++j) {
for (int k = j + 1; k < n; ++k) {
if (min(k - j, abs(k - y... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
--x, --y;
vector<int> ans(n - 1);
for (int j = 0; j < n; ++j)
for (int k = j + 1; k < n; ++k)
++ans[min(k - j, abs(k - y) + abs(j - x) + 1) - 1];
for (auto a : ans)
c... | replace | 10 | 21 | 10 | 16 | TLE | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define per(i, a, b) for (ll i = (a)-1; i >= (b); i--)
const ll maxn = 2e3;
ll q[maxn], d[maxn], u[maxn], s, e, c, ans[maxn], n, x, y;
vector<ll> ady[maxn];
int main() {
cin.tie(0);
ios_base::sync... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define per(i, a, b) for (ll i = (a)-1; i >= (b); i--)
const ll maxn = 2e3 + 5;
ll q[maxn], d[maxn], u[maxn], s, e, c, ans[maxn], n, x, y;
vector<ll> ady[maxn];
int main() {
cin.tie(0);
ios_base::... | replace | 5 | 6 | 5 | 6 | 0 | |
p02726 | Python | Time Limit Exceeded | from collections import deque
n, x, y = [int(x) for x in input().split()]
x -= 1
y -= 1
BIG = 65521
ans = {i: 0 for i in range(n)}
def bfs(start_v):
"""ある始点からほかの全点に行くまでの最短距離を求める。"""
qu = deque()
qu_append = qu.append
qu_popleft = qu.popleft
qu_append(start_v)
# 始点からvに移動するまでの最短距離: dist[v]
... | from collections import deque
n, x, y = [int(x) for x in input().split()]
x -= 1
y -= 1
BIG = 65521
ans = {i: 0 for i in range(n)}
def bfs(start_v):
"""ある始点からほかの全点に行くまでの最短距離を求める。"""
qu = deque()
qu_append = qu.append
qu_popleft = qu.popleft
qu_append(start_v)
# 始点からvに移動するまでの最短距離: dist[v]
... | insert | 57 | 57 | 57 | 59 | TLE | |
p02726 | Python | Runtime Error | n, x, y = map(int, input().split())
cnt = [0] * n
# 漸化式が建てられそうでめんどくさい場合は、片方を固定する
# 端点を固定する 1..n-2 から順に大きい頂点に向かって伸びていく
for i in range(n - 1):
for j in range(i + 1, n):
if i <= x - 1:
if j <= x - 1: # 1 idx
cnt[j - i] += 1
elif j <= y - 1:
cnt[min(j - i... | n, x, y = map(int, input().split())
cnt = [0] * n
# 漸化式が建てられそうでめんどくさい場合は、片方を固定する
# 端点を固定する 1..n-2 から順に大きい頂点に向かって伸びていく
for i in range(n - 1):
for j in range(i + 1, n):
if i <= x - 1:
if j <= x - 1: # 1 idx
cnt[j - i] += 1
elif j <= y - 1:
cnt[min(j - i... | replace | 17 | 18 | 17 | 18 | TypeError: 'int' object is not iterable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02726/Python/s903600229.py", line 18, in <module>
cnt[min(j - i), 1 + (i - x + 1) + (j - y + 1)] += 1
TypeError: 'int' object is not iterable
|
p02726 | Python | Time Limit Exceeded | #!/usr/bin/python3
(n, x, y) = map(int, input().split())
cs = [0 for i in range(n)]
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
d = min(abs(j - i), abs(x - i) + 1 + abs(j - y), abs(y - i) + 1 + abs(j - x))
if d == (abs(y - i) + 1 + abs(j - x)):
print(i, j, d)
cs[d]... | #!/usr/bin/python3
(n, x, y) = map(int, input().split())
cs = [0 for i in range(n)]
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
d = min(abs(j - i), abs(x - i) + 1 + abs(j - y))
cs[d] += 1
for i in range(1, n):
print(cs[i])
| replace | 8 | 11 | 8 | 9 | TLE | |
p02726 | Python | Runtime Error | N, X, Y = map(int, input().split())
dic = {}
X = X - 1
Y = Y - 1
for i in range(N):
for j in range(i + 1, N):
if i <= X and Y <= j:
v = X - i + 1 + j - Y
elif (i <= X) and (X <= j and j <= Y):
v = min(j - i, X - i + 1 + Y - j)
elif (X <= i and i <= Y) and Y <= j:
... | N, X, Y = map(int, input().split())
dic = {}
X = X - 1
Y = Y - 1
for i in range(N):
for j in range(i + 1, N):
if i <= X and Y <= j:
v = X - i + 1 + j - Y
elif (i <= X) and (X <= j and j <= Y):
v = min(j - i, X - i + 1 + Y - j)
elif (X <= i and i <= Y) and Y <= j:
... | replace | 28 | 29 | 28 | 32 | KeyError: 4 | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02726/Python/s708368036.py", line 29, in <module>
print(dic[i])
KeyError: 4
|
p02726 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define INF (INT32_MAX / 4)
int main() {
int N, X, Y;
cin >> N >> X >> Y;
X--;
Y--;
vector<vector<int>> m(N, vector<int>(N, INF));
for (int i = 0; i < N; i++)
m[i][i] = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (i == j)... | #include <bits/stdc++.h>
using namespace std;
#define INF (INT32_MAX / 4)
int main() {
int N, X, Y;
cin >> N >> X >> Y;
X--;
Y--;
vector<vector<int>> m(N, vector<int>(N, INF));
for (int i = 0; i < N; i++)
m[i][i] = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (i == j)... | replace | 21 | 28 | 21 | 24 | TLE | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int N, x, y, ans[2010];
int main() {
cin >> N >> x >> y;
for (int i = 1; i <= x; i++)
for (int j = i + 1; j <= x; j++)
ans[j - i]++;
for (int i = y; i <= N; i++)
for (int j = y + 1; j <= N; j++)
ans[j - i]++;
for (int i = x + 1; i < y; i++)
... | #include <bits/stdc++.h>
using namespace std;
int N, x, y, ans[2010];
int main() {
cin >> N >> x >> y;
for (int i = 1; i <= x; i++)
for (int j = i + 1; j <= x; j++)
ans[j - i]++;
for (int i = y; i <= N; i++)
for (int j = i + 1; j <= N; j++)
ans[j - i]++;
for (int i = x + 1; i < y; i++)
... | replace | 12 | 13 | 12 | 13 | 0 | |
p02726 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
cons... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
cons... | replace | 77 | 87 | 77 | 90 | TLE | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 2e3 + 34;
int s[N];
void solve() {
int n, x, y;
scanf("%d%d%d", &n, ... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 2e3 + 34;
int s[N];
void solve() {
int n, x, y;
scanf("%d%d%d", &n, ... | replace | 33 | 34 | 33 | 34 | 0 | |
p02726 | C++ | Runtime Error | #define ll long long
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mp make_pair
#define fo(i, n) for (ll i = 0; i < n; i++)
// #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include ... | #define ll long long
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mp make_pair
#define fo(i, n) for (ll i = 0; i < n; i++)
// #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include ... | replace | 79 | 84 | 79 | 84 | -11 | |
p02726 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define pq priority_queue
using namespace std;
const ll INF = (ll)1e9;
const ll MOD = (ll)1e9 + 7;
const ll MAX = 100100;
vector<int> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
retu... | #include <bits/stdc++.h>
#define ll long long
#define pq priority_queue
using namespace std;
const ll INF = (ll)1e9;
const ll MOD = (ll)1e9 + 7;
const ll MAX = 100100;
vector<int> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
retu... | replace | 36 | 41 | 36 | 39 | TLE | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fs first
#define se second
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef double db;
const int maxn = 1e3 + 5;
const ll inf = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
ll num[maxn];
int main() {
int n, x, y;
scanf("%d%d%d", &n, &x, &... | #include <bits/stdc++.h>
#define fs first
#define se second
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef double db;
const int maxn = 2e3 + 5;
const ll inf = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
ll num[maxn];
int main() {
int n, x, y;
scanf("%d%d%d", &n, &x, &... | replace | 10 | 11 | 10 | 11 | 0 | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, x, y;
cin >> n >> x >> y;
x--;
y--;
vector<int> adj[1000];
rep(i, n - 1) {
adj[i].push_back(i + 1);
adj[i + 1].push_back(i);
}
adj[x].push_back(y);
adj[y].pu... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, x, y;
cin >> n >> x >> y;
x--;
y--;
vector<int> adj[10000];
rep(i, n - 1) {
adj[i].push_back(i + 1);
adj[i + 1].push_back(i);
}
adj[x].push_back(y);
adj[y].p... | replace | 10 | 11 | 10 | 11 | 0 | |
p02726 | 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++)
ll memo[2001][2001]; // 各点の最短距離を記録したもの
int main() {
ll n;
ll x;
ll y;
cin >> n >> x >> y;
x--;
y--;
rep(i, n) {
rep(j, n) { memo[i][j] = -1; }
}
rep(i, n - 1) {
memo[i][i] = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
ll memo[20001][20001]; // 各点の最短距離を記録したもの
int main() {
ll n;
ll x;
ll y;
cin >> n >> x >> y;
x--;
y--;
rep(i, n) {
rep(j, n) { memo[i][j] = -1; }
}
rep(i, n - 1) {
memo[i][i] = 0;... | replace | 5 | 6 | 5 | 6 | 0 | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int inf = 0x3f3f3f3f;
const int maxn = 4e3 + 10;
int cnt = 0, head[maxn];
int dst[maxn], vis[maxn] = {0};
int n;
struct Edge {
int val, to, next;
} edge[maxn];
struct node {
int dst, to;
bool operator<(const node... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int inf = 0x3f3f3f3f;
const int maxn = 4e3 + 10;
int cnt = 0, head[maxn];
int dst[maxn], vis[maxn] = {0};
int n;
struct Edge {
int val, to, next;
} edge[maxn];
struct node {
int dst, to;
bool operator<(const node... | replace | 61 | 62 | 61 | 62 | -11 | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pb push_back
using namespace std;
int n, x, y;
int all[1005];
int main() {
cin >> n >> x >> y;
for (int i = 1; i <= n; i++)
all[i] = 0;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
int dist1 = abs(... | #include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pb push_back
using namespace std;
int n, x, y;
int all[20005];
int main() {
cin >> n >> x >> y;
for (int i = 1; i <= n; i++)
all[i] = 0;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
int dist1 = abs... | replace | 9 | 10 | 9 | 10 | 0 | |
p02726 | C++ | Time Limit Exceeded | // *
// *
// * Created By :hozaifa wahid
// * "mai maut ko takia aur kafan ko chadar banakar sota hu"
// *------------------------------------
// * OS : Ubuntu 16.04
// * Language : CPP14
// * Editor : Sublime Text 3
// * C++ compiler : g++
// *https://www.geeksforgeeks.org/space-and-time-efficient-binomial-coeffi... | // *
// *
// * Created By :hozaifa wahid
// * "mai maut ko takia aur kafan ko chadar banakar sota hu"
// *------------------------------------
// * OS : Ubuntu 16.04
// * Language : CPP14
// * Editor : Sublime Text 3
// * C++ compiler : g++
// *https://www.geeksforgeeks.org/space-and-time-efficient-binomial-coeffi... | replace | 145 | 146 | 145 | 146 | TLE | |
p02726 | C++ | Runtime Error | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int N, X, Y, a[1004][1004], ans[10005];
vector<int> graph[3004];
queue<int> q;
int main() {
cin >> N >> X >> Y;
for (int i = 2; i < N; i++) {
graph[i].push_back(i - 1);
graph[i].push_back(i + 1);
}
graph[1].push_back(2);
gra... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int N, X, Y, a[3004][3004], ans[10005];
vector<int> graph[3004];
queue<int> q;
int main() {
cin >> N >> X >> Y;
for (int i = 2; i < N; i++) {
graph[i].push_back(i - 1);
graph[i].push_back(i + 1);
}
graph[1].push_back(2);
gra... | replace | 5 | 6 | 5 | 6 | 0 | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef double dbl;
typedef long long int lld;
#define MAX std::numeric_limits<lld>::max();
#define MIN std::numeric_limits<lld>::min();
#define FastIO ... | #include <bits/stdc++.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef double dbl;
typedef long long int lld;
#define MAX std::numeric_limits<lld>::max();
#define MIN std::numeric_limits<lld>::min();
#define FastIO ... | delete | 37 | 41 | 37 | 37 | -11 | |
p02726 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define pb push_back
#define POP pop_back()
#define ll long long
#define db double
#define POP pop_back... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define pb push_back
#define POP pop_back()
#define ll long long
#define db double
#define POP pop_back... | replace | 31 | 32 | 31 | 32 | 0 | |
p02726 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
int main() {
int N, X, Y;
cin >> N >> X >> Y;
vector<int> ans(N - 1);
for (int k = 1; k <= N - 1; k++) {
int dist_min;
ans[k - 1] = 0;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
int main() {
int N, X, Y;
cin >> N >> X >> Y;
vector<int> ans(N - 1, 0);
int dist_min;
for (int i = 1; i <= N - 1; i++) {
for (int j = i + 1; j <= N; j++... | replace | 10 | 21 | 10 | 17 | TLE | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define endl "\n"
#define ll long long
#define oo 0x3f3f3f3fLL
#define sz(s) (int)(s.size())
#define RT(s) return cout << s, 0
#define INF 0x3f3f3f3f3f3f3f3fLL
#define all(v) v.begin(), v.end()
#define watch(x) cout << (#x) ... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define endl "\n"
#define ll long long
#define oo 0x3f3f3f3fLL
#define sz(s) (int)(s.size())
#define RT(s) return cout << s, 0
#define INF 0x3f3f3f3f3f3f3f3fLL
#define all(v) v.begin(), v.end()
#define watch(x) cout << (#x) ... | replace | 31 | 32 | 31 | 32 | 0 | |
p02726 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <limits>
#include <math.h>
#include <random>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
template ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <limits>
#include <math.h>
#include <random>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
template ... | replace | 196 | 232 | 196 | 211 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p02726 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
const int MAXN = 1e3 + 10;
int n, x, y;
int sol[MAXN];
int main(void) {
scanf("%d%d%d", &n, &x, &y);
--x;
--y;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
int d = min(abs(i - j), min(1 + abs(i - x) + abs(j - y),
... | #include <algorithm>
#include <cstdio>
using namespace std;
const int MAXN = 2e3 + 10;
int n, x, y;
int sol[MAXN];
int main(void) {
scanf("%d%d%d", &n, &x, &y);
--x;
--y;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
int d = min(abs(i - j), min(1 + abs(i - x) + abs(j - y),
... | replace | 5 | 6 | 5 | 6 | 0 | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
//{ SFT
using namespace std;
#define int int64_t
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define reps(i, a, n) for (int i = (a); i > (n); --i)
#define arep(i, x) for (auto &&i : (x))
#define irep(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
// 降順はgreater<T>()
#define all(... | #include <bits/stdc++.h>
//{ SFT
using namespace std;
#define int int64_t
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define reps(i, a, n) for (int i = (a); i > (n); --i)
#define arep(i, x) for (auto &&i : (x))
#define irep(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
// 降順はgreater<T>()
#define all(... | replace | 59 | 60 | 59 | 60 | 0 | |
p02726 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | replace | 305 | 307 | 305 | 307 | 0 | |
p02726 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include ... | replace | 82 | 83 | 82 | 83 | 0 | |
p02726 | 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>;
/*
O(|E|log|V|)
P.first = shortest path, P.second = vertex index
G[v] = vector of edge (from v)
d[v] = shortest path from s to v
*/
struct edge {
int to, cost;
};
void dijk... | #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>;
/*
O(|E|log|V|)
P.first = shortest path, P.second = vertex index
G[v] = vector of edge (from v)
d[v] = shortest path from s to v
*/
struct edge {
int to, cost;
};
void dijk... | replace | 61 | 62 | 61 | 62 | -6 | double free or corruption (out)
|
p02726 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, Y;
cin >> N >> X >> Y;
vector<vector<int>> dist_mat(N, vector<int>(N, 0));
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++)
dist_mat[i][j] = j - i;
;
}
// bypass
for (int i = 0; i < N; i++) {
for (int j =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, Y;
cin >> N >> X >> Y;
vector<vector<int>> dist_mat(N, vector<int>(N, 0));
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++)
dist_mat[i][j] = j - i;
;
}
// bypass
for (int i = 0; i < N; i++) {
for (int j =... | replace | 21 | 30 | 21 | 27 | TLE | |
p02726 | C++ | Runtime Error | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | replace | 178 | 179 | 178 | 179 | 0 | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define getbit(n, i) (((n) & (1LL << (i))) != 0)
#define setbit0(n, i) ((n) & (~(1LL << (i))))
#define setbit1(n, i) ((n) | (1LL << (i)))
#define tog... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define getbit(n, i) (((n) & (1LL << (i))) != 0)
#define setbit0(n, i) ((n) & (~(1LL << (i))))
#define setbit1(n, i) ((n) | (1LL << (i)))
#define tog... | replace | 45 | 46 | 45 | 46 | 0 | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2020;
vector<int> g[N];
int d[1024][1024];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
memset(d, 255, sizeof(d));
int n, x, y;
cin >> n >> x >> y;
x--;
y--;
for (int i = 1; i < n; i++) {
g[i].push_back(i - 1);
g[i - ... | #include <bits/stdc++.h>
using namespace std;
const int N = 2020;
vector<int> g[N];
int d[N][N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
memset(d, 255, sizeof(d));
int n, x, y;
cin >> n >> x >> y;
x--;
y--;
for (int i = 1; i < n; i++) {
g[i].push_back(i - 1);
g[i - 1].pus... | replace | 6 | 7 | 6 | 7 | 0 | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 10;
int n, x, y, dist[N], ans[N];
vector<int> gg[N];
bool used[N];
queue<int> q;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> x >> y;
for ... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 10;
int n, x, y, dist[N], ans[N];
vector<int> gg[N];
bool used[N];
queue<int> q;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> x >> y;
for ... | replace | 2 | 3 | 2 | 3 | 0 | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const ll MAX = 100000;
int cnt[1005];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, x, y;
cin >> n >> x >> y;
// if (x != 1 || y != n) {
for (int i = 1; i <= n; ++i)
for (int j = i +... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const ll MAX = 100000;
int cnt[2005];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, x, y;
cin >> n >> x >> y;
// if (x != 1 || y != n) {
for (int i = 1; i <= n; ++i)
for (int j = i +... | replace | 5 | 6 | 5 | 6 | 0 | |
p02726 | C++ | Time Limit Exceeded | /* include */
#include "bits/stdc++.h"
/* namespace */
using namespace std;
/* typedef */
/* long系 */
typedef long long ll; // long long
typedef long double ld; // long double
/* vector系 */
typedef vector<int> vint; // intのvector
typedef vector<double> vdouble; // doubleのvector
typedef vec... | /* include */
#include "bits/stdc++.h"
/* namespace */
using namespace std;
/* typedef */
/* long系 */
typedef long long ll; // long long
typedef long double ld; // long double
/* vector系 */
typedef vector<int> vint; // intのvector
typedef vector<double> vdouble; // doubleのvector
typedef vec... | replace | 115 | 121 | 115 | 121 | TLE | |
p02726 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
const int MAX_N = 1e3 + 5;
int n, x, y, dis[MAX_N], ans[MAX_N];
std::vector<int> adj[MAX_N];
bool vis[MAX_N];
int main() {
scanf("%d%d%d", &n, &x, &y);
adj[x].push_back(y);
adj[y].push_back(x);
for (int i = 2; i < n;... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
const int MAX_N = 2e3 + 5;
int n, x, y, dis[MAX_N], ans[MAX_N];
std::vector<int> adj[MAX_N];
bool vis[MAX_N];
int main() {
scanf("%d%d%d", &n, &x, &y);
adj[x].push_back(y);
adj[y].push_back(x);
for (int i = 2; i < n;... | replace | 6 | 7 | 6 | 7 | 0 | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
const ll maxs = 305;
ll inf = 1e18;
ll cost[maxs][maxs];
ll dp[maxs][maxs];
ll n;
void warshall() {
for (ll k = 1; k <= n; k++)
for (ll i = 1; i <= n; i++)
for (ll j = 1; j <= n; j++)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
const ll maxs = 3005;
ll inf = 1e18;
ll cost[maxs][maxs];
ll dp[maxs][maxs];
ll n;
void warshall() {
for (ll k = 1; k <= n; k++)
for (ll i = 1; i <= n; i++)
for (ll j = 1; j <= n; j++)
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02726 | C++ | Runtime Error | // file creato da gio il 2020-03-31 21:23:51.244903
#include <iostream>
#define FAST
#ifdef FAST
#pragma GCC optimize("Ofast")
#pragma GCC target( \
"fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
#... | // file creato da gio il 2020-03-31 21:23:51.244903
#include <iostream>
#define FAST
#ifdef FAST
#pragma GCC optimize("Ofast")
#pragma GCC target( \
"fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
#... | replace | 30 | 37 | 30 | 34 | 0 | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, Y;
cin >> N >> X >> Y;
X--;
Y--;
map<int, long> m;
for (int i = 1; i < N; i++) {
m[i] = 0;
}
int a[N - 1][N - 1];
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
a[i][j] = j - i;
}
}
for (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, Y;
cin >> N >> X >> Y;
X--;
Y--;
map<int, long> m;
for (int i = 1; i < N; i++) {
m[i] = 0;
}
int a[N][N];
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
a[i][j] = abs(j - i);
}
}
for (int i = 0;... | replace | 13 | 17 | 13 | 18 | 0 | |
p02726 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define MAX 200
int main() {
int N, x, y, D[MAX], i, j, d, d1, d2;
cin >> N >> x >> y;
for (i = 1; i <= N; i++)
D[i] = 0;
for (i = 1; i < N; i++) {
for (j = i + 1; j <= N; j++) {
d1 = j - i;
d2 = abs(y - j) + abs(x - i) + 1;
d = min(d1, d2);
... | #include <iostream>
using namespace std;
#define MAX 2000
int main() {
int N, x, y, D[MAX], i, j, d, d1, d2;
cin >> N >> x >> y;
for (i = 1; i <= N; i++)
D[i] = 0;
for (i = 1; i < N; i++) {
for (j = i + 1; j <= N; j++) {
d1 = j - i;
d2 = abs(y - j) + abs(x - i) + 1;
d = min(d1, d2);
... | replace | 2 | 3 | 2 | 3 | 0 | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 100;
#define ll long long
vector<int> s[N];
void add(int x, int y) {
s[x].push_back(y);
s[y].push_back(x);
}
int a[N];
vector<int> v;
void solve() {
int n, x, y;
scanf("%d%d%d", &n, &x, &y);
for (int i = 1; i < n; ++i) {
add(i, i + 1);
... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 100;
#define ll long long
vector<int> s[N];
void add(int x, int y) {
s[x].push_back(y);
s[y].push_back(x);
}
int a[N];
vector<int> v;
void solve() {
int n, x, y;
scanf("%d%d%d", &n, &x, &y);
for (int i = 1; i < n; ++i) {
add(i, i + 1);
... | replace | 2 | 3 | 2 | 3 | 0 | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, Y;
cin >> N >> X >> Y;
vector<vector<int>> v(N - 1, vector<int>(N - 1));
vector<int> ans(N - 1);
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
v[i][j] = min(j - i, abs(Y - j - 1) + 1 + abs(X - i - 1));
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, Y;
cin >> N >> X >> Y;
vector<vector<int>> v(N, vector<int>(N));
vector<int> ans(N - 1);
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
v[i][j] = min(j - i, abs(Y - j - 1) + 1 + abs(X - i - 1));
}
}
for... | replace | 7 | 8 | 7 | 8 | 0 | |
p02726 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long LL;
int main() {
int N, X, Y;
cin >> N >> X >> Y;
--X;
--Y;
vector<vector<int>> dist(N, vector<int>(N, 99999));
REP(i, N) {
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long LL;
int main() {
int N, X, Y;
cin >> N >> X >> Y;
--X;
--Y;
vector<vector<int>> dist(N, vector<int>(N, 99999));
REP(i, N) {
... | replace | 38 | 41 | 38 | 39 | TLE | |
p02726 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
#define int long long
int N, X, Y;
cin >> N >> X >> Y;
int l;
vector<int> box(N - 1);
for (int i = 1; i <= X; i++) {
for (int j = i + 1; j <= X; j++) {
l = j - i;
box.at(l - 1)++;
}
for (int j = X + 1; j < Y; j++) {
l =... | #include <bits/stdc++.h>
using namespace std;
int main() {
#define int long long
int N, X, Y;
cin >> N >> X >> Y;
int l;
vector<int> box(N - 1);
for (int i = 1; i <= X; i++) {
for (int j = i + 1; j <= X; j++) {
l = j - i;
box.at(l - 1)++;
}
for (int j = X + 1; j < Y; j++) {
l =... | replace | 40 | 41 | 40 | 41 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.