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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> X(M);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
if (N >= M) {
cout << 0 << endl;
return 1;
}
sort(X.begin(), X.end());
int sum_differe... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> X(M);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
if (N >= M) {
cout << 0 << endl;
return 0;
}
sort(X.begin(), X.end());
int sum_differe... | replace | 17 | 18 | 17 | 18 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repi(i, start, end) for (int i = start; i < end; i++)
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << (x) << endl;
#define INF (1e9)
#define add_mod(a, b, x) ((ll)(a) + (ll)(b)) % ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repi(i, start, end) for (int i = start; i < end; i++)
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << (x) << endl;
#define INF (1e9)
#define add_mod(a, b, x) ((ll)(a) + (ll)(b)) % ... | replace | 40 | 41 | 40 | 44 | 0 | |
p03137 | C++ | Time Limit Exceeded | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include... | replace | 102 | 107 | 102 | 105 | TLE | |
p03137 | Python | Runtime Error | import sys
n, m = map(int, input().split())
x = list(map(int, input().split()))
if m == 1:
print(0)
sys.exit()
if n == 1:
print(max(x) - min(x))
sys.exit()
x.sort()
a = []
for i in range(m - 1):
a.append(abs(x[i] - x[i + 1]))
ans = sum(a)
a.sort(reverse=True)
for i in range(n - 1):
ans -= a[i]
... | import sys
n, m = map(int, input().split())
x = list(map(int, input().split()))
if m == 1:
print(0)
sys.exit()
if n == 1:
print(max(x) - min(x))
sys.exit()
if n >= m:
print(0)
sys.exit()
x.sort()
a = []
for i in range(m - 1):
a.append(abs(x[i] - x[i + 1]))
ans = sum(a)
a.sort(reverse=True)
... | insert | 10 | 10 | 10 | 13 | 0 | |
p03137 | Python | Runtime Error | def main():
N, M = map(int, input().split())
X = sorted(list(map(int, input().split())))
if M == 1:
print(0)
elif N == 1:
print(max(X) - min(X))
else:
dx = [abs(X[m] - X[m + 1]) for m in range(M - 1)]
for _ in range(N - 1):
dx.pop(dx.index(max(dx)))
... | def main():
N, M = map(int, input().split())
X = sorted(list(map(int, input().split())))
if M == 1:
print(0)
elif N == 1:
print(max(X) - min(X))
else:
if N > M:
N = M
dx = sorted([abs(X[m] - X[m + 1]) for m in range(M - 1)])
print(sum(dx[: M - N])... | replace | 9 | 13 | 9 | 13 | 0 | |
p03137 | Python | Time Limit Exceeded | N, M = map(int, input().split())
X = list(map(int, input().split()))
X.sort()
if N >= M:
ans = 0
else:
x_diff = [X[i + 1] - X[i] for i in range(len(X) - 1)]
for _ in range(N - 1):
x_diff.remove(max(x_diff))
ans = sum(x_diff)
print(ans)
| N, M = map(int, input().split())
X = list(map(int, input().split()))
X.sort()
if N >= M:
ans = 0
else:
x_diff = [
xn - x for xn, x in zip(X[1:], X[:-1])
] # [X[i + 1] - X[i] for i in range(len(X) - 1)]
# for _ in range(N - 1):
# x_diff.remove(max(x_diff))
x_diff.sort(reverse=True)
... | replace | 7 | 11 | 7 | 14 | TLE | |
p03137 | Python | Runtime Error | def solve():
n, m = map(int, input().split())
x = list(map(int, input().split()))
x.sort()
diff = [x[i + 1] - x[i] for i in range(m)]
diff.sort(reverse=True)
return sum(diff[n - 1 :])
if __name__ == "__main__":
print(solve())
| def solve():
n, m = map(int, input().split())
x = sorted(list(map(int, input().split())))
diff = sorted([x[i + 1] - x[i] for i in range(m - 1)], reverse=True)
return sum(diff[n - 1 :])
if __name__ == "__main__":
print(solve())
| replace | 2 | 6 | 2 | 4 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03137/Python/s563492969.py", line 11, in <module>
print(solve())
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03137/Python/s563492969.py", line 5, in solve
diff = [x[i + 1] - x[i] ... |
p03137 | Python | Runtime Error | N, M = map(int, input().split())
x = list(map(int, input().split()))
x.sort()
s = [0] * (M - 1)
for i in range(M - 1):
s[i] = x[i + 1] - x[i]
s.sort(reverse=True)
res = sum(s)
if M == 1:
print(0)
quit()
else:
for i in range(N - 1):
res -= s[i]
print(res)
| N, M = map(int, input().split())
x = list(map(int, input().split()))
if N >= M:
print(0)
quit()
x.sort()
s = [0] * (M - 1)
for i in range(M - 1):
s[i] = x[i + 1] - x[i]
s.sort(reverse=True)
res = sum(s)
if M == 1:
print(0)
quit()
else:
for i in range(N - 1):
res -= s[i]
print(res)
| insert | 2 | 2 | 2 | 6 | 0 | |
p03137 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<long long> X(M);
for (int i = 0; i < M; i++)
cin >> X[i];
sort(X.begin(), X.end());
vector<long long> Y(M - 1);
for (int i = 0; i < M - 1; i++)
Y[i] = X[i + 1] - X[i];
sort(Y.begin(), Y.end());
long... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<long long> X(M);
for (int i = 0; i < M; i++)
cin >> X[i];
sort(X.begin(), X.end());
vector<long long> Y(M - 1);
for (int i = 0; i < M - 1; i++)
Y[i] = X[i + 1] - X[i];
sort(Y.begin(), Y.end());
long... | insert | 24 | 24 | 24 | 25 | TLE | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m), diff(m);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
adjacent_difference(x.begin(), x.end(), diff.begin());
diff[0] = -100001;
sort(diff.begin(), diff.end());
int ans... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n > m) {
cout << 0 << endl;
return 0;
}
vector<int> x(m), diff(m);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
adjacent_difference(x.begin(), x.end(), diff.begin());
diff[0... | insert | 6 | 6 | 6 | 10 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using ... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using ... | replace | 55 | 56 | 55 | 56 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 100100100
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 100100100
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ... | insert | 26 | 26 | 26 | 34 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, M;
int X[10005];
int diff[10005];
cin >> N >> M;
for (int i = 0; i < M; ++i)
cin >> X[i];
sort(X, X + M);
for (int i = 0; i < M - 1; ++i)
diff[i] = X[i + 1] - X[i];
sort(diff, diff + (M - 1));
int ans = 0;
f... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, M;
int X[100005];
int diff[100005];
cin >> N >> M;
for (int i = 0; i < M; ++i)
cin >> X[i];
sort(X, X + M);
for (int i = 0; i < M - 1; ++i)
diff[i] = X[i + 1] - X[i];
sort(diff, diff + (M - 1));
int ans = 0;
... | replace | 6 | 8 | 6 | 8 | 0 | |
p03137 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
typedef long long ll;
ll mod = 1000000007;
int numsplit(vector<tuple<int, int, int>> &vt, vector<int> &vpos) {
int cntsplit = 1;
auto tmp = vt;
sort(all(tmp), [](tuple<int, int, int> &a, tuple<int, int, int> &b) {
return get<... | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
typedef long long ll;
ll mod = 1000000007;
int numsplit(vector<tuple<int, int, int>> &vt, vector<int> &vpos) {
int cntsplit = 1;
auto tmp = vt;
sort(all(tmp), [](tuple<int, int, int> &a, tuple<int, int, int> &b) {
return get<... | replace | 41 | 44 | 41 | 45 | TLE | |
p03137 | C++ | Runtime Error | /*|In The Name of Allah|*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<pair<int, int>> vii;
typedef map<int, int> mii;
typedef map<string, int> msi;
typedef pair<int, int> pii;
#define el '\n'
#define lp(i,... | /*|In The Name of Allah|*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<pair<int, int>> vii;
typedef map<int, int> mii;
typedef map<string, int> msi;
typedef pair<int, int> pii;
#define el '\n'
#define lp(i,... | replace | 47 | 48 | 47 | 48 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
return 1;
}
vector<int> X(M);
for (int i; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> Y(M - 1);
for (int i = 0; i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
return 0;
}
vector<int> X(M);
for (int i; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> Y(M - 1);
for (int i = 0; i... | replace | 10 | 11 | 10 | 11 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
if (m == 1)
cout << 0;
else {
vector<int> x(m);
for (int i = 0; i < m; i++)
cin >> x[i];
sort(x.begin(), x.end());
vector<int> d(m - 1);
for (int i = 0; i < m - 1; i++)
d[i] = x[i + 1] - x... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++)
cin >> x[i];
sort(x.begin(), x.end());
vector<int> d(m - 1);
for (int i = 0; i < m - 1; i++)
d[i] = x[i + 1] - x[i];
sort(d.begin(), d.end());
for (int i = 0; i... | replace | 5 | 23 | 5 | 19 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define bp __builtin_popcount
#define pb push_back
#define sz(s) (int)(s.size())
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define bp __builtin_popcount
#define pb push_back
#define sz(s) (int)(s.size())
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
... | replace | 167 | 168 | 167 | 168 | -11 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k = 0;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++) {
cin >> x.at(i);
}
sort(x.begin(), x.end());
if (n >= m) {
k = 0;
} else {
vector<int> y(m - 1);
for (int i = 0; i < m - 1; i++) {
y.at(i) = x.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k = 0;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++) {
cin >> x.at(i);
}
sort(x.begin(), x.end());
if (n >= m) {
k = 0;
} else {
vector<int> y(m - 1);
for (int i = 0; i < m - 1; i++) {
y.at(i) = x.... | replace | 19 | 20 | 19 | 20 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
vector<int> diffs(m);
for (int i = 1; i < m; i++) {
diffs.push_back(x[i] - x... | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
vector<int> diffs(m);
for (int i = 1; i < m; i++) {
diffs.push_back(x[i] - x... | replace | 21 | 22 | 21 | 22 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | insert | 34 | 34 | 34 | 39 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#defin... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#defin... | replace | 51 | 52 | 51 | 52 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int n, m;
cin >> n >> m;
if (m == 1) { // m==1のとき
cout << 0 << endl;
return 0;
}
vector<int> x(m);
rep(i, m) { cin >> x.at(i); }
sort(x.begin(), x.end());
vector<int> d(m - 1);... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int n, m;
cin >> n >> m;
if (n >= m) { // n>=mのとき０
cout << 0 << endl;
return 0;
}
vector<int> x(m);
rep(i, m) { cin >> x.at(i); }
sort(x.begin(), x.end());
vector<int> d(m - 1)... | replace | 8 | 9 | 8 | 9 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define uint __int128_t
#define pb push_back
#define fi first
#define se second
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define al... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define uint __int128_t
#define pb push_back
#define fi first
#define se second
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define al... | replace | 39 | 40 | 39 | 40 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
rep(i, m) cin >> x[i];
sort(x.begin(), x.end());
if (m == 1) {
cout << 0 << endl;
return 0;
}
vector<int> interval(m - 1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
rep(i, m) cin >> x[i];
sort(x.begin(), x.end());
if (m == 1) {
cout << 0 << endl;
return 0;
}
vector<int> interval(m - 1... | replace | 19 | 21 | 19 | 22 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
signed main() {
ll n, m;
cin >> n >> m;
vector<ll> a(m);
for (auto &x : a)
cin >> x;
sort(a.begin(), a.end());
vector<ll> dist;
for (ll i = 0; i < m - 1; ++i)
dist.emplace_back(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
signed main() {
ll n, m;
cin >> n >> m;
vector<ll> a(m);
for (auto &x : a)
cin >> x;
sort(a.begin(), a.end());
vector<ll> dist;
for (ll i = 0; i < m - 1; ++i)
dist.emplace_back(... | replace | 21 | 22 | 21 | 22 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int N, M, X[10000];
int d[10000], ans;
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> X[i];
}
if (N < M) {
sort(X, X + M);
for (int i = 0; i < M - 1; i++) {
d[i] = X[i + 1] - X[i];
}... | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int N, M, X[100000];
int d[100000], ans;
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> X[i];
}
if (N < M) {
sort(X, X + M);
for (int i = 0; i < M - 1; i++) {
d[i] = X[i + 1] - X[i];
... | replace | 5 | 7 | 5 | 7 | 0 | |
p03137 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int ... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int ... | insert | 14 | 14 | 14 | 18 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(M), B(M - 1);
long long V;
for (int X = 0; X < M; X++) {
cin >> A[X];
}
sort(A.begin(), A.end());
V = A[M - 1] - A[0];
for (int X = 0; X < M; X++) {
if (X != 0) {
B[X - 1] = A[X] - A[X - 1];... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(M), B(M - 1);
long long V = 0;
if (N >= M) {
cout << 0 << endl;
return 0;
}
for (int X = 0; X < M; X++) {
cin >> A[X];
}
sort(A.begin(), A.end());
V = A[M - 1] - A[0];
for (int X = 0; X < ... | replace | 6 | 7 | 6 | 11 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> X(M);
for (int i = 0; i < M; i++)
cin >> X.at(i);
sort(X.begin(), X.end());
int kyori = X.at(M - 1) - X.at(0);
if (M == 1) {
cout << 0 << endl;
} else {
vector<int> sa(M - 1);
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> X(M);
for (int i = 0; i < M; i++)
cin >> X.at(i);
sort(X.begin(), X.end());
int kyori = X.at(M - 1) - X.at(0);
if (M == 1 || N >= M) {
cout << 0 << endl;
} else {
vector<int> sa(M - 1);
for ... | replace | 12 | 13 | 12 | 13 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N, M;
std::cin >> N >> M;
std::vector<int> X;
for (int i = 0; i < M; i++) {
int t;
std::cin >> t;
X.push_back(t);
}
std::sort(X.begin(), X.end());
int pos_min = X.at(0);
int pos_max = X.at(X.size() - 1);
int an... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N, M;
std::cin >> N >> M;
std::vector<int> X;
for (int i = 0; i < M; i++) {
int t;
std::cin >> t;
X.push_back(t);
}
if (N > M) {
std::cout << 0 << std::endl;
return 0;
}
std::sort(X.begin(), X.end());
... | insert | 13 | 13 | 13 | 18 | 0 | |
p03137 | C++ | Runtime Error | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | replace | 126 | 127 | 126 | 127 | 0 | |
p03137 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
if (M == 1) {
cout << 0 << endl;
return 0;
}
vector<int> X(M);
for (int i = 0; i < M; i++)
cin >> X.at(i);
sort(X.begin(), X.end());
vector<int> D(M - 1);
for (int i = 0; i < M - 1; i++)
D.at(i... | #include "bits/stdc++.h"
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
if (M == 1) {
cout << 0 << endl;
return 0;
}
vector<int> X(M);
for (int i = 0; i < M; i++)
cin >> X.at(i);
sort(X.begin(), X.end());
vector<int> D(M - 1);
for (int i = 0; i < M - 1; i++)
D.at(i... | replace | 25 | 26 | 25 | 26 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int x[m], dx[m + 1];
REP(i, m) cin >> x[i];
sort(x, x ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int x[m], dx[m + 1];
REP(i, m) cin >> x[i];
sort(x, x ... | replace | 15 | 16 | 15 | 16 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define r... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define r... | replace | 58 | 59 | 58 | 66 | 0 | sh: 1: pause: not found
|
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
if (M <= N) {
cout << 0 << endl;
return 0;
}
vector<int> X(M);
for (int i = 0; i < M; ++i) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> L(... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
if (M <= N) {
cout << 0 << endl;
return 0;
}
vector<int> X(M);
for (int i = 0; i < M; ++i) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> L(... | replace | 20 | 21 | 20 | 21 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
int n, m;
int x[maxn];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.t... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
int n, m;
int x[maxn];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.t... | replace | 32 | 33 | 32 | 33 | 0 | |
p03137 | C++ | Runtime Error | #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
... | #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
... | replace | 42 | 43 | 42 | 43 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; ++i)
cin >> x[i];
if (m == 1) {
cout << 0;
} else {
vector<int> y(m - 1);
sort(x.begi... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; ++i)
cin >> x[i];
if ((m == 1) || (n >= m)) {
cout << 0;
} else {
vector<int> y(m - 1);
... | replace | 12 | 13 | 12 | 13 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> x(M);
for (int i = 0; i < M; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
// Mが1のときの例外処理をいれるよう
if (M == 1) {
cout << "0" << endl;
return 0;
}
vector<int> x_(M - 1);
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> x(M);
for (int i = 0; i < M; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
// Mが1のときの例外処理をいれるよう
if (M == 1) {
cout << "0" << endl;
return 0;
}
vector<int> x_(M - 1);
for (int i = 0; i < ... | insert | 24 | 24 | 24 | 29 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
vector<int> diff(m - 1);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
if (n >= m) {
cout << 0 << endl;
}
sort(x.begin(), x.end());
fo... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
vector<int> diff(m - 1);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
if (n >= m) {
cout << 0 << endl;
return 0;
}
sort(x.begin(), ... | insert | 18 | 18 | 18 | 19 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; ++i)
cin >> x[i];
sort(x.begin(), x.end());
vector<int> dis(m - 1);
for (int i = 1; i < m; ++i)
dis[i - 1] = x[i] - x[i - 1];
sort(dis.rbegin(), dis.rend());
int res... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; ++i)
cin >> x[i];
sort(x.begin(), x.end());
vector<int> dis(m - 1);
for (int i = 1; i < m; ++i)
dis[i - 1] = x[i] - x[i - 1];
sort(dis.rbegin(), dis.rend());
int res... | replace | 14 | 15 | 14 | 15 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
if (m != 1) {
vector<long long> x(m);
vector<long long> dx(m, 0);
for (long long i = 0; i < m; i++) {
cin >> x.at(i);
}
sort(x.begin(), x.end());
for (long long i = 1; i < m; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
if (m != 1) {
vector<long long> x(m);
vector<long long> dx(m, 0);
for (long long i = 0; i < m; i++) {
cin >> x.at(i);
}
sort(x.begin(), x.end());
for (long long i = 1; i < m; i++) {
... | replace | 25 | 27 | 25 | 33 | 0 | |
p03137 | C++ | Runtime Error | #include <iostream>
#include <math.h>
// #include <numeric>
#include <algorithm>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define n_max 100000
#define rep(i, n) for (int i = 0; i < n; i++)
#define in(a) cin >> a
#define out(a) cout << a << endl
typedef long long ll;
int main() {
int n... | #include <iostream>
#include <math.h>
// #include <numeric>
#include <algorithm>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define n_max 100000
#define rep(i, n) for (int i = 0; i < n; i++)
#define in(a) cin >> a
#define out(a) cout << a << endl
typedef long long ll;
int main() {
int n... | replace | 35 | 36 | 35 | 41 | 0 | |
p03137 | C++ | Runtime Error | // https://atcoder.jp/contests/abc117/tasks/abc117_c
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define max(a, b) (((a) > (b)) ? (a) : (b))
#define min(a, b) (((a) < (b)) ? (a) : (b))
int main() {
int n, m, tmp;
vector<int> v, w;
cin >> n >> m;
for (int i... | // https://atcoder.jp/contests/abc117/tasks/abc117_c
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define max(a, b) (((a) > (b)) ? (a) : (b))
#define min(a, b) (((a) < (b)) ? (a) : (b))
int main() {
int n, m, tmp;
vector<int> v, w;
cin >> n >> m;
for (int i... | replace | 27 | 29 | 27 | 29 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define INF 100000000
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
int main() {
int N, M;
cin >> N >> M;
vector<int> X(M);
for (int i = 0; i < M; i++) {
cin >> X[... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define INF 100000000
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
int main() {
int N, M;
cin >> N >> M;
if (N > M) {
cout << "0" << endl;
return 0;
}
vecto... | insert | 12 | 12 | 12 | 16 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
swap(n, m);
vector<ll> arr(n), delta;
for (int i = 0; i < n; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
for (int i = 1; i < n; i++) {
delta.push_back(arr[i] - arr[i - 1]);
}
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
swap(n, m);
vector<ll> arr(n), delta;
for (int i = 0; i < n; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
for (int i = 1; i < n; i++) {
delta.push_back(arr[i] - arr[i - 1]);
}
i... | replace | 21 | 22 | 21 | 22 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> pil;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
const int maxN = 5e2 + 5;
const ll INF = 1ll << 60;
int n, m;
ll a[maxN];
ll b[maxN];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
scanf("%... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> pil;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
const int maxN = 5e5 + 5;
const ll INF = 1ll << 60;
int n, m;
ll a[maxN];
ll b[maxN];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
scanf("%... | replace | 7 | 8 | 7 | 8 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int X[M];
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X, X + M);
vector<int> sub;
int ans = 0;
if (M > 1 && M < N) {
for (int i = 0; i < M - 1; i++) {
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int X[M];
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X, X + M);
vector<int> sub;
int ans = 0;
if (M > 1 && M > N) {
for (int i = 0; i < M - 1; i++) {
... | replace | 16 | 17 | 16 | 17 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int n, m, a[100005], b[100005], ans;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> a[i];
}
sort(a + 1, a + m + 1);
for (int i = 1; i < m; i++) {
b[i] = a[i + 1] - a[i];
}
sort(b + 1, b + m);
ans = a[m] - a[1];
... | #include <algorithm>
#include <iostream>
using namespace std;
int n, m, a[100005], b[100005], ans;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> a[i];
}
if (n >= m) {
cout << 0 << endl;
return 0;
}
sort(a + 1, a + m + 1);
for (int i = 1; i < m; i++) {
b[i] = a[i + 1]... | insert | 11 | 11 | 11 | 15 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define F first
#define S second
#define p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define F first
#define S second
#define p... | replace | 104 | 105 | 104 | 106 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const ll LINF = 1e18;
const int INF = 1e8;
using namespace std;
#define vvint(vec, ... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const ll LINF = 1e18;
const int INF = 1e8;
using namespace std;
#define vvint(vec, ... | replace | 46 | 47 | 46 | 47 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define mREP(i, a, b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chma... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define mREP(i, a, b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chma... | insert | 27 | 27 | 27 | 29 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <type_traits>
#include <... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <type_traits>
#include <... | replace | 48 | 49 | 48 | 49 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <algorithm>
#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d", &a)
#def... | #include <algorithm>
#include <algorithm>
#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d", &a)
#def... | replace | 103 | 104 | 103 | 104 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#define rep(i, n) for ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#define rep(i, n) for ... | replace | 55 | 56 | 55 | 58 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N, M, sum, S;
cin >> N >> M;
vector<int> X(M), Y(M - 1);
for (int i = 0; i < M; ++i)
cin >> X.at(i);
sort(X.begin(), X.end());
for (int i = 0; i < M - 1; ++i)
Y.at(i) = X.at(i + 1) - X.at(i);
s... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N, M, sum, S;
cin >> N >> M;
if (N >= M)
cout << 0 << endl;
else {
vector<int> X(M), Y(M - 1);
for (int i = 0; i < M; ++i)
cin >> X.at(i);
sort(X.begin(), X.end());
for (int i = 0; ... | replace | 8 | 20 | 8 | 24 | 0 | |
p03137 | C++ | Runtime Error | // s配列に格納した単語を、辞書順にソートする
// sort(s.begin(), s.end());
// string t = "keyence";//で文字列入力ができる
// s.empty() //emptyなら1を出力 入っていれば0を出力
/*//ABC018-B 部分的にreverseをかける解法
int main() {
string s;
cin >> s;
int n;
cin >> n;
vector<int>a(n);
vector<int>b(n);
rep(i,n) cin>>a.at(i)>>b.at(i);
rep(i,n)a.at(i)--;
rep... | // s配列に格納した単語を、辞書順にソートする
// sort(s.begin(), s.end());
// string t = "keyence";//で文字列入力ができる
// s.empty() //emptyなら1を出力 入っていれば0を出力
/*//ABC018-B 部分的にreverseをかける解法
int main() {
string s;
cin >> s;
int n;
cin >> n;
vector<int>a(n);
vector<int>b(n);
rep(i,n) cin>>a.at(i)>>b.at(i);
rep(i,n)a.at(i)--;
rep... | insert | 88 | 88 | 88 | 91 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
if (m == 1) {
cout << 0 << endl;
return 0;
}
sort(x.begin(), x.end());
vector<int> d(m - 1);
for (int i = 0; i < m - ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
if (m == 1) {
cout << 0 << endl;
return 0;
}
sort(x.begin(), x.end());
vector<int> d(m - 1);
for (int i = 0; i < m - ... | replace | 23 | 24 | 23 | 24 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
rep(i, m) cin >> x[i];
if (m == 1) {
cout << 0 << endl;
return 0;
}
sort(x.begin(), x.end());
vector<int> dist(m -... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
rep(i, m) cin >> x[i];
if (m == 1) {
cout << 0 << endl;
return 0;
}
sort(x.begin(), x.end());
vector<int> dist(m -... | replace | 25 | 26 | 25 | 27 | 0 | |
p03137 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define COUNTOF(array) (sizeof(array) / sizeof(array[0]))
#define OUT(P) cout << (P) << endl
#define OUT2(P1, P2) cout << (P1) << " " << (P2) << endl
#define PRINT_ARRAY(P) \
for (int i = 0; i < P.size(); i++) ... | #include "bits/stdc++.h"
using namespace std;
#define COUNTOF(array) (sizeof(array) / sizeof(array[0]))
#define OUT(P) cout << (P) << endl
#define OUT2(P1, P2) cout << (P1) << " " << (P2) << endl
#define PRINT_ARRAY(P) \
for (int i = 0; i < P.size(); i++) ... | replace | 37 | 38 | 37 | 38 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 0; i <= (int)(n); i++)
using P = pair<int, int>;
using pq = priority_queue<int>;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int sum = 0;
vector<int> x(m);
rep(i,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 0; i <= (int)(n); i++)
using P = pair<int, int>;
using pq = priority_queue<int>;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int sum = 0;
vector<int> x(m);
rep(i,... | replace | 22 | 24 | 22 | 26 | 0 | |
p03137 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
int getMinMove(int n, const std::vector<int> &positions) {
if (static_cast<int>(positions.size()) <= n) {
return 0;
}
auto pos_sorted = positions;
std::sort(pos_sorted.begin(), pos_sorted.end());
std::vector<int> diffs(position... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
int getMinMove(int n, const std::vector<int> &positions) {
if (static_cast<int>(positions.size()) <= n) {
return 0;
}
auto pos_sorted = positions;
std::sort(pos_sorted.begin(), pos_sorted.end());
std::vector<int> diffs(position... | replace | 15 | 21 | 15 | 17 | TLE | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int x[n];
for (int i = 0; i < m; ++i)
cin >> x[i];
if (n >= m) {
cout << 0 << '\n';
return 0;
}
sort(x, x + m);
priority_queue<int> pq;
for (int i = 0; i < m - 1; ++i) {
pq.push(x[i + 1] - x[i]);
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int x[m];
for (int i = 0; i < m; ++i)
cin >> x[i];
if (n >= m) {
cout << 0 << '\n';
return 0;
}
sort(x, x + m);
priority_queue<int> pq;
for (int i = 0; i < m - 1; ++i) {
pq.push(x[i + 1] - x[i]);
}
... | replace | 6 | 7 | 6 | 7 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(); \
cout.tie(... | #include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(); \
cout.tie(... | insert | 27 | 27 | 27 | 31 | 0 | |
p03137 | C++ | Runtime Error | #include <stdio.h>
int N, M;
int X[100000], D[99999];
void merge_sort(int *a, int n) {
if (n == 1)
return;
int m = n / 2;
merge_sort(a, m);
merge_sort(a + m, n - m);
static int a_[100000];
for (int i = 0; i < n; i++) {
a_[i] = a[i];
}
int i = 0;
int j = m;
int k = 0;
while (i < m || j < ... | #include <stdio.h>
int N, M;
int X[100000], D[99999];
void merge_sort(int *a, int n) {
if (n <= 1)
return;
int m = n / 2;
merge_sort(a, m);
merge_sort(a + m, n - m);
static int a_[100000];
for (int i = 0; i < n; i++) {
a_[i] = a[i];
}
int i = 0;
int j = m;
int k = 0;
while (i < m || j < ... | replace | 6 | 7 | 6 | 7 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int M = 0;
int N;
cin >> N;
cin >> M;
vector<int> A(M, 0);
if (M == 1) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < M; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
ll ans = A.at(M - 1) - A.... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int M = 0;
int N;
cin >> N;
cin >> M;
vector<int> A(M, 0);
if (M == 1 || N >= M) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < M; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
ll ans = A.at(M... | replace | 11 | 12 | 11 | 12 | 0 | |
p03137 | 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>;
#define chmax(x, y) x = max(x, y);
#define chmin(x, y) x = min(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
... | #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>;
#define chmax(x, y) x = max(x, y);
#define chmin(x, y) x = min(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
... | insert | 14 | 14 | 14 | 18 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++)
cin >> x[i];
sort(x.begin(), x.end());
int ans = x[m - 1] - x[0];
if (m == 1)
cout << ans << endl;
else {
vector<int> dif(m - 1);
for (int i = 0; i < m -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++)
cin >> x[i];
sort(x.begin(), x.end());
int ans = x[m - 1] - x[0];
if (m == 1)
cout << ans << endl;
else {
vector<int> dif(m - 1);
for (int i = 0; i < m -... | replace | 25 | 26 | 25 | 26 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
/*
int find(int x, vector<int> &p) {
if (p[x] == x)return x;
return p[x] = find(p[x], p);
}
void uni(int x, int y, vect... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
/*
int find(int x, vector<int> &p) {
if (p[x] == x)return x;
return p[x] = find(p[x], p);
}
void uni(int x, int y, vect... | insert | 48 | 48 | 48 | 52 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> x(M);
for (int i = 0; i < M; i++) {
cin >> x[i];
}
if (M <= N) {
cout << 0 << endl;
}
sort(x.begin(), x.end());
vector<int> xsub(M - 1);
for (int i = 0; i <... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> x(M);
for (int i = 0; i < M; i++) {
cin >> x[i];
}
if (M <= N) {
cout << 0 << endl;
return 0;
}
sort(x.begin(), x.end());
vector<int> xsub(M - 1);
for (... | insert | 15 | 15 | 15 | 16 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <climits>
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define srep(i, begin, end) for (__typeof(e... | #include <bits/stdc++.h>
#include <climits>
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define srep(i, begin, end) for (__typeof(e... | replace | 75 | 76 | 75 | 76 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> destinations(M);
for (int i = 0; i < M; ++i) {
cin >> destinations[i];
}
sort(destinations.begin(), destinations.end());
if (M == 1) {
cout << 0 <<... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> destinations(M);
for (int i = 0; i < M; ++i) {
cin >> destinations[i];
}
sort(destinations.begin(), destinations.end());
if (M == 1) {
cout << 0 <<... | replace | 25 | 26 | 25 | 26 | 0 | |
p03137 | C++ | Runtime Error | #pragma once
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#... | #pragma once
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#... | replace | 59 | 60 | 59 | 60 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int SZ = 10005;
priority_queue<int> pq;
int arr[SZ];
int main(void) {
int n, m;
scanf("%d %d", &n, &m);
n--;
for (int i = 0; i < m; i++)
scanf("%d", &arr[i]);
sort(arr, arr + m);
int ans = arr[m - 1] - arr[0];
for (int i = 1; i < m; i++) {
pq.pus... | #include <bits/stdc++.h>
using namespace std;
const int SZ = 100005;
priority_queue<int> pq;
int arr[SZ];
int main(void) {
int n, m;
scanf("%d %d", &n, &m);
n--;
for (int i = 0; i < m; i++)
scanf("%d", &arr[i]);
sort(arr, arr + m);
int ans = arr[m - 1] - arr[0];
for (int i = 1; i < m; i++) {
pq.pu... | replace | 2 | 3 | 2 | 3 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> x(m);
vector<int> xx(m - 1);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
if (m == 1) {
cout << 0 << endl;
return 0;
}
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> x(m);
vector<int> xx(m - 1);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
if (m == 1) {
cout << 0 << endl;
return 0;
}
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; i++) {
... | insert | 30 | 30 | 30 | 33 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#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 = (... | #include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#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 = (... | replace | 33 | 34 | 33 | 34 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0;
return 0;
}
vector<int> X(M, 0);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> sa(M - 1, 0);
for (int i = 0; i <= M - 1; i++) {
sa[i] = X... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0;
return 0;
}
vector<int> X(M, 0);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> sa(M - 1, 0);
for (int i = 0; i < M - 1; i++) {
sa[i] = X[... | replace | 16 | 17 | 16 | 17 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (... | replace | 34 | 35 | 34 | 35 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef long long ll;
typedef... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef long long ll;
typedef... | insert | 65 | 65 | 65 | 69 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (M == 1) {
cout << "0\n";
return 0;
}
vector<int> L(M);
for (int i = 0; i < M; i++) {
cin >> L[i];
}
sort(L.begin(), L.end());
vector<int> Width(M - ... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << "0\n";
return 0;
}
if (M == 1) {
cout << "0\n";
return 0;
}
vector<int> L(M);
for (int i = 0; i < M; i++) {
cin >> L[i];
}... | insert | 9 | 9 | 9 | 13 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<long long> X(M);
for (int i = 0; i < M; i++)
cin >> X[i];
if (M == 1) {
cout << 0 << endl;
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<long long> X(M);
for (int i = 0; i < M; i++)
cin >> X[i];
if (M == 1) {
cout << 0 << endl;
... | replace | 29 | 30 | 29 | 30 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m == 1) {
cout << "0" << endl;
return 0;
}
vector<int> x(m);
vector<int> dist(m - 1);
for (int i = 0; i < m; i++) {
cin >> x.at(i);
}
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; i++) {
d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m == 1) {
cout << "0" << endl;
return 0;
}
vector<int> x(m);
vector<int> dist(m - 1);
for (int i = 0; i < m; i++) {
cin >> x.at(i);
}
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; i++) {
d... | replace | 24 | 25 | 24 | 26 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int const static n_max = 100000;
int n, m, x[n_max + 10], l[n_max + 10];
int main() {
cin >> n >> ... | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int const static n_max = 100000;
int n, m, x[n_max + 10], l[n_max + 10];
int main() {
cin >> n >> ... | insert | 18 | 18 | 18 | 23 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// 4近傍、8近傍
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
// 入力
int N, M;
cin >> N >> M;
ll x[M];
for (int i = 0; i < M;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// 4近傍、8近傍
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
// 入力
int N, M;
cin >> N >> M;
ll x[M];
for (int i = 0; i < M;... | replace | 21 | 22 | 21 | 22 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MAX 10005
#define MOD 1000000007
#define INF 1e9
#define mp make_pair
using namespace std;
typedef long long ll;
int arr[MAX];
vector<int> diff;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// ... | #include <bits/stdc++.h>
#define MAX 100005
#define MOD 1000000007
#define INF 1e9
#define mp make_pair
using namespace std;
typedef long long ll;
int arr[MAX];
vector<int> diff;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// ... | replace | 1 | 2 | 1 | 2 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, m, x[100009];
long long int sm = 0;
vector<long long> v1, v2;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> x[i];
v1.push_back(x[i]);
}
if (m == 1) {
cout << 0 << endl;
} else {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, m, x[100009];
long long int sm = 0;
vector<long long> v1, v2;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> x[i];
v1.push_back(x[i]);
}
if (n >= m) {
cout << 0 << endl;
} else {
... | replace | 14 | 15 | 14 | 15 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for (int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<v... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for (int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<v... | replace | 26 | 27 | 26 | 27 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03137 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
#define N 11000
#define INF 0x3f3f3f3f
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
int a[N], dif[N];
int main() {
int n, m;
while (scanf("%d%d", &m, &n) != EOF) {
int res = 0;
for (int i = 0... | #include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
#define N 110000
#define INF 0x3f3f3f3f
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
int a[N], dif[N];
int main() {
int n, m;
while (scanf("%d%d", &m, &n) != EOF) {
int res = 0;
for (int i = ... | replace | 6 | 7 | 6 | 7 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (int i = 1; i <= N; i++)
typedef... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (int i = 1; i <= N; i++)
typedef... | replace | 17 | 19 | 17 | 19 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
using... | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
using... | replace | 21 | 22 | 21 | 22 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m, ans = 0;
cin >> n >> m;
vector<int> x(m), xm(m - 1);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
if (m == 1) {
cout << 0;
return 0;
}
sort(x.begin(), x.end());
for... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m, ans = 0;
cin >> n >> m;
vector<int> x(m), xm(m - 1);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
if (m == 1 || n > m) {
cout << 0;
return 0;
}
sort(x.begin(), x.end()... | replace | 13 | 14 | 13 | 14 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
template <class T> usi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
template <class T> usi... | replace | 508 | 509 | 508 | 509 | 0 | |
p03137 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <map>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(_x) _x.begin(), ... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <map>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(_x) _x.begin(), ... | replace | 23 | 24 | 23 | 24 | 0 | |
p03137 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | insert | 80 | 80 | 80 | 81 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<long long> v(k);
vector<long long> dv(k - 1);
for (int i = 0; i < k; i++) {
cin >> v[i];
}
std::sort(v.begin(), v.end(), std::greater<int>());
long... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<long long> v(k);
vector<long long> dv(k - 1);
for (int i = 0; i < k; i++) {
cin >> v[i];
}
std::sort(v.begin(), v.end(), std::greater<int>());
long... | replace | 23 | 24 | 23 | 24 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FOR... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FOR... | insert | 44 | 44 | 44 | 49 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define... | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define... | replace | 206 | 207 | 206 | 207 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if (m == 1) {
cout << 0 << '\n';
return 0;
}
if (n == 1) {
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if (m == 1) {
cout << 0 << '\n';
return 0;
}
if (n == 1) {
cout << ... | replace | 28 | 29 | 28 | 29 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, m;
cin >> n >> m;
ll a[n];
for (int i = 0; i < m; i++) {
cin >> a[i];
}
if (m <= n) {
// cout<<"if"<<endl;
cout << 0 << endl;
} else {
sort(a, a + m);
vector<ll> v;
for (int i = 1; i < m; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, m;
cin >> n >> m;
ll a[m];
for (int i = 0; i < m; i++) {
cin >> a[i];
}
if (m <= n) {
// cout<<"if"<<endl;
cout << 0 << endl;
} else {
sort(a, a + m);
vector<ll> v;
for (int i = 1; i < m; i++) {
... | replace | 7 | 8 | 7 | 8 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.