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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
ll n, m;
cin >> n >> m;
vector<ll> l(n + 1);
vector<ll> r(n + 1);
for (int i = 1; i <= m; i++) {
cin >> l[i] >> r[i];
}
ll lmax = 1;
ll rmin = 1e5;
for (ll i = 1; i <= m; i++) {
if (l[i] >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
ll n, m;
cin >> n >> m;
vector<ll> l(m + 1);
vector<ll> r(m + 1);
for (int i = 1; i <= m; i++) {
cin >> l[i] >> r[i];
}
ll lmax = 1;
ll rmin = 1e5;
for (ll i = 1; i <= m; i++) {
if (l[i] >... | replace | 8 | 10 | 8 | 10 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF INT_MAX
#define MOD 100000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF INT_MAX
#define MOD 100000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >... | replace | 21 | 22 | 21 | 22 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;... | replace | 49 | 51 | 49 | 51 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> lr(n + 1, 0);
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
lr[l]++, lr[r + 1]--;
}
for (int i = 0; i < n; i++) {
lr[i + 1] += lr[i];
}
cout << count(lr.begin(), lr.end(), m) << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int64_t> lr(n + 1, 0);
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
lr[l]++, lr[r + 1]--;
}
for (int i = 0; i < n; i++) {
lr[i + 1] += lr[i];
}
cout << count(lr.begin(), lr.end(), m)... | replace | 7 | 8 | 7 | 8 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> imo(n + 1, 0);
for (int i = 0; i < m; ++i) {
int l, r;
cin >> l >> r;
++imo[l];
--imo[r + 1];
}
int ans = 0;
for (int i = 1; i <= n; ++i) {
imo[i] += imo[i - 1];
if (imo[i] == m)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> imo(n + 2, 0);
for (int i = 0; i < m; ++i) {
int l, r;
cin >> l >> r;
++imo[l];
--imo[r + 1];
}
int ans = 0;
for (int i = 1; i <= n; ++i) {
imo[i] += imo[i - 1];
if (imo[i] == m)
... | replace | 7 | 8 | 7 | 8 | 0 | |
p03037 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m);
vector<int> r(m);
rep(i, m) {
cin >> l[i];
cin >> r[i];
}
int ans = 0;
rep(i, n) {
bo... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m);
vector<int> r(m);
rep(i, m) {
cin >> l[i];
cin >> r[i];
}
sort(all(l));
reverse(all(l));
... | replace | 15 | 26 | 15 | 21 | TLE | |
p03037 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define num 100000
int main() {
int n, m;
cin >> n >> m;
bitset<num> a;
REP(i, m) {
int L, R;
cin >> L >> R;
bitset<num> b;
for (int j = L - 1; j < R; j++)
b.set(j, 1);
if (i == 0)
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define num 100000
int main() {
int n, m;
cin >> n >> m;
bitset<num> a;
REP(i, m) {
int L, R;
cin >> L >> R;
bitset<num> b;
b.flip();
b = (b >> L - 1) ^ (b >> R);
if (i == 0)
a = b;
... | replace | 13 | 15 | 13 | 15 | TLE | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using P = pair<llong, llong>;
#define ALL(x) x.begin(), x.end()
const llong inf = 1100100100100100ll;
const llong mod = 1e9 + 7;
int main() {
llong N, M;
vector<llong> L, R, rui;
cin >> N >> M;
L.resize(N);
R... | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using P = pair<llong, llong>;
#define ALL(x) x.begin(), x.end()
const llong inf = 1100100100100100ll;
const llong mod = 1e9 + 7;
int main() {
llong N, M;
vector<llong> L, R, rui;
cin >> N >> M;
L.resize(M);
R... | replace | 17 | 19 | 17 | 19 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int mxsz = 1e5 + 3;
int n, m;
vector<pii> v;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> v[i].fi >> v[i].se... | #include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int mxsz = 1e5 + 3;
int n, m;
vector<pii> v;
int main() {
cin >> n >> m;
v.resize(m);
for (int i = 0; i < m; i++) {
cin >> v[i]... | replace | 14 | 15 | 14 | 16 | -11 | |
p03037 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
// #include "bits/std... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
// #include "bits/std... | replace | 126 | 127 | 126 | 127 | 0 | |
p03037 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
u... | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
u... | replace | 23 | 24 | 23 | 24 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
vector<int> L(N, 0), R(N, 0);
scanf("%d%d", &N, &M);
for (int i = 0; i < M; i++)
scanf("%d%d", &L[i], &R[i]);
int min = 1, max = N;
for (int i = 0; i < M; i++) {
if (L[i] > min)
min = L[i];
if (R[i] < max)
max = R[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
vector<int> L(N, 0), R(N, 0);
scanf("%d%d", &N, &M);
for (int i = 0; i < M; i++) {
int l, r;
scanf("%d%d", &l, &r);
L[i] = l;
R[i] = r;
}
int min = 1, max = N;
for (int i = 0; i < M; i++) {
if (L[i] > min)
min ... | replace | 7 | 9 | 7 | 13 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03037 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#includ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#includ... | replace | 26 | 27 | 26 | 27 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(n);
vector<int> r(n);
int mal = 0;
int mar = 10000000;
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
mal = max(mal, l[i]);
mar = min(mar, r[i]);
}
if (mal <= mar) {
cout << mar - mal... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m);
vector<int> r(m);
int mal = 0;
int mar = 10000000;
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
mal = max(mal, l[i]);
mar = min(mar, r[i]);
}
if (mal <= mar) {
cout << mar - mal... | replace | 5 | 7 | 5 | 7 | 0 | |
p03037 | C++ | Runtime Error | // C - Prison
// https://atcoder.jp/contests/abc127/tasks/abc127_c
#include <bits/stdc++.h>
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x)... | // C - Prison
// https://atcoder.jp/contests/abc127/tasks/abc127_c
#include <bits/stdc++.h>
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x)... | replace | 57 | 76 | 57 | 63 | 0 | |
p03037 | C++ | Runtime Error | #ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>:... | #ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>:... | replace | 44 | 45 | 44 | 45 | 0 | |
p03037 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
for (int i = 0; i < m; i++) {
cin >> l.at(i) >> r.at(i);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
int count = 0;
for (int j = 0; j < m; j++) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
for (int i = 0; i < m; i++) {
cin >> l.at(i) >> r.at(i);
}
cout << max(0, *min_element(r.begin(), r.end()) -
*max_element(l.begin(), l.end()... | replace | 12 | 25 | 12 | 14 | TLE | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(N), R(N);
int maxl = 0, minr = 100010;
for (int i = 0; i < M; ++i) {
cin >> L[i] >> R[i];
maxl = max(maxl, L[i]);
minr = min(minr, R[i]);
}
cout << max(0, minr - maxl + 1) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
int maxl = 0, minr = 100010;
for (int i = 0; i < M; ++i) {
cin >> L[i] >> R[i];
maxl = max(maxl, L[i]);
minr = min(minr, R[i]);
}
cout << max(0, minr - maxl + 1) ... | replace | 8 | 9 | 8 | 9 | 0 | |
p03037 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<bool> can_use_card(n, true);
for (int i = 0; i < m; i++) {
int l, r;
std::cin >> l >> r;
l--;
r--;
for (int j = 0; j < l; j++) {
can_use_card[j] = false;
}
for... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<bool> can_use_card(n, true);
for (int i = 0; i < m; i++) {
int l, r;
std::cin >> l >> r;
l--;
r--;
std::fill(can_use_card.begin(), can_use_card.begin() + l, false);
std::... | replace | 16 | 23 | 16 | 18 | TLE | |
p03037 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(n);
vector<int> r(n);
int r_min = n;
int l_max = 1;
for (int i = 0; i < m; ++i) {
cin >> l[i] >> r[i];
if (r[i] < r_min) {
r_min = r[i];
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m);
vector<int> r(m);
int r_min = n;
int l_max = 1;
for (int i = 0; i < m; ++i) {
cin >> l[i] >> r[i];
if (r[i] < r_min) {
r_min = r[i];
... | replace | 10 | 12 | 10 | 12 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
// 立ってるビットの数を数える (https://www.slideshare.net/KMC_JP/ss-45855264)
// 01111001 -> 5
inline std::uint64_t popcount(std::uint64_t x) {
x = ((x & 0xaaaaaaaaaaaaaaaa) >> 1) + (x & 0x5555555555555555);
x = ((x & 0xcccccccccccccccc) >> 2) + (x & 0x3333333333333333);
x = ((x & 0xf0f0f0f0f0f0f0f0)... | #include <bits/stdc++.h>
// 立ってるビットの数を数える (https://www.slideshare.net/KMC_JP/ss-45855264)
// 01111001 -> 5
inline std::uint64_t popcount(std::uint64_t x) {
x = ((x & 0xaaaaaaaaaaaaaaaa) >> 1) + (x & 0x5555555555555555);
x = ((x & 0xcccccccccccccccc) >> 2) + (x & 0x3333333333333333);
x = ((x & 0xf0f0f0f0f0f0f0f0)... | replace | 124 | 125 | 124 | 125 | 0 | |
p03037 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long
... | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long
... | replace | 22 | 37 | 22 | 30 | TLE | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
vector<int> card_list(N + 1, 0);
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
card_list[L[i]]++;
card_list[R[i] + 1]--;
}
for (int i = 0; i < N; i++) {
card_list[i + 1] += ca... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
vector<int> card_list(N + 1, 0);
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
card_list[L[i] - 1]++;
card_list[R[i] + 1 - 1]--;
}
for (int i = 0; i < N; i++) {
card_list[i + ... | replace | 10 | 12 | 10 | 12 | 0 | |
p03037 | C++ | Runtime Error |
// </> : towhid1zaman
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
#define fill(a, b) memset(a, b, sizeof(a))
#define all(v) (v).begin(), (v).end()
#define sp(k) cout << setprecision(k) << fi... |
// </> : towhid1zaman
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
#define fill(a, b) memset(a, b, sizeof(a))
#define all(v) (v).begin(), (v).end()
#define sp(k) cout << setprecision(k) << fi... | replace | 38 | 39 | 38 | 39 | 0 | |
p03037 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
map<int, int> ok;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
for (int j = a; j <= b; j++) {
ok[j - 1]++;
}
}
int ans = 0;
for (int i = 0; i < n; i++)
if (ok[i] == m)
ans++;
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
vector<int> b(m);
for (int i = 0; i < m; i++)
cin >> a.at(i) >> b.at(i);
sort(a.begin(), a.end(), greater());
sort(b.begin(), b.end());
cout << max(0, b.at(0) - a.at(0) + 1) << endl;
return 0;
} | replace | 6 | 19 | 6 | 13 | TLE | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int max_l = INT_MIN;
int min_r = INT_MAX;
for (int i = 0; i < M; i++) {
int l, r;
cin >> l >> r;
max_l = max(max_l, l);
min_r = min(min_r, r);
}
if (min_r - max_l < 0)
return -1;
cout << min_r - max_l... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int max_l = INT_MIN;
int min_r = INT_MAX;
for (int i = 0; i < M; i++) {
int l, r;
cin >> l >> r;
max_l = max(max_l, l);
min_r = min(min_r, r);
}
if (min_r - max_l < 0)
cout << 0 << endl;
else
cout... | replace | 14 | 16 | 14 | 17 | 0 | |
p03037 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
vector<long long> L(M);
vector<long long> R(M);
for (long long i = 0; i < M; i++) {
cin >> L[i] >> R[i];
}
long long check = 0;
for (long long i = 1; i < N + 1; i++) {
long long count = 0;
for (long lon... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
vector<long long> L(M);
vector<long long> R(M);
for (long long i = 0; i < M; i++) {
cin >> L[i] >> R[i];
}
long long check = 0;
sort(L.begin(), L.end());
sort(R.begin(), R.end());
long long Lmax = L[M - 1];... | replace | 11 | 19 | 11 | 17 | TLE | |
p03037 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
using ll = long long;
int main() {
ll N, M;
cin >> N >> M;
ll L[N + 10], R[N + 10], l, r;
for (int k = 1; k <= M; k++)
cin >> L[k] >> R[k];
l = L[1];
for (int i = 1; i <= M; i++) {
if (L[i] >= l)
l = L[i];
}
r =... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
using ll = long long;
int main() {
ll N, M;
cin >> N >> M;
ll L[M + 10], R[M + 10], l, r;
for (int k = 1; k <= M; k++)
cin >> L[k] >> R[k];
l = L[1];
for (int i = 1; i <= M; i++) {
if (L[i] >= l)
l = L[i];
}
r =... | replace | 8 | 9 | 8 | 9 | 0 | |
p03037 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long INF = 1e18, MOD = 1e9 + 7;
using namespace std;
int main() {
ll N, M, ans;
ll maxL = -1;
cin >> N >> M;
vector<ll> L(N), R(N);
rep(i, M) { cin... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long INF = 1e18, MOD = 1e9 + 7;
using namespace std;
int main() {
ll N, M, ans;
ll maxL = -1;
cin >> N >> M;
vector<ll> L(M), R(M);
rep(i, M) { cin... | replace | 12 | 13 | 12 | 13 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
vector<int> a(M);
vector<int> b(M);
for (int i = 0; i < M; i++) {
cin >> a.at(i) >> b.at(i);
}
sort(a.begin(), a.end());
sort(b.begin(), b.end());
if (b[0] >= a[M - 1])
cout << b[0] - a[M - 1] + 1 << endl;
else
cout << 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M);
vector<int> b(M);
for (int i = 0; i < M; i++) {
cin >> a.at(i) >> b.at(i);
}
sort(a.begin(), a.end());
sort(b.begin(), b.end());
if (b[0] >= a[M - 1])
cout << b[0] - a[M - 1] + 1 << endl;
e... | insert | 5 | 5 | 5 | 6 | 0 | |
p03037 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L[N], R[N];
for (int i = 0; i ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L[M], R[M];
for (int i = 0; i ... | replace | 17 | 18 | 17 | 18 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<int> xx, yy;
const int maxn = 1e5 + 7;
struct q {
int x, y;
} N[maxn];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int x, y;
scanf("%d%d", &x, &y);
xx.push_back(x);
yy.push_back(y);
}
sort(xx.begin(), xx.end());
... | #include <bits/stdc++.h>
using namespace std;
vector<int> xx, yy;
const int maxn = 1e5 + 7;
struct q {
int x, y;
} N[maxn];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int x, y;
scanf("%d%d", &x, &y);
xx.push_back(x);
yy.push_back(y);
}
sort(xx.begin(), xx.end());
... | replace | 18 | 19 | 18 | 19 | 0 | |
p03037 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | insert | 90 | 90 | 90 | 91 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int r[N];
int l[N];
int left = 0;
int right = 100000;
for (int i = 0; i < M; i++) {
cin >> l[i] >> r[i];
if (left < l[i]) {
left = l[i];
}
if (right > r[i]) {
right = r[i];
}
}
if ((rig... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int r[M];
int l[M];
int left = 0;
int right = 100000;
for (int i = 0; i < M; i++) {
cin >> l[i] >> r[i];
if (left < l[i]) {
left = l[i];
}
if (right > r[i]) {
right = r[i];
}
}
if ((rig... | replace | 6 | 8 | 6 | 8 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mx 100000
#define md 1000000007ll
#define prMX 10000000
ll prime[prMX + 2];
bool vis[prMX + 2];
#define MX 10000000000000ll
int main() {
int n, m;
cin >> n >> m;
int ar[m + 2];
memset(ar, 0, sizeof ar);
for (int i = 1; i <= m; i++) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mx 100000
#define md 1000000007ll
#define prMX 10000000
ll prime[prMX + 2];
bool vis[prMX + 2];
#define MX 10000000000000ll
int main() {
int n, m;
cin >> n >> m;
int ar[n + 2];
memset(ar, 0, sizeof ar);
for (int i = 1; i <= m; i++) ... | replace | 14 | 15 | 14 | 15 | 0 | |
p03037 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = unsigned long long;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
map<int, int> card;
for (int i = 1; i <= m; i++) {
int l, r;
cin >> l >> r;
for (int j = l; j <= r; j++) {
card[j]++;
}
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = unsigned long long;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m);
vector<int> r(m);
rep(i, m) cin >> l[i] >> r[i];
sort(l.begin(), l.end(), greater<int>());
sort(r.begin(), r.end());
int... | replace | 8 | 20 | 8 | 18 | TLE | |
p03037 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int min(vector<int> a, int m) {
sort(a.begin(), a.end());
return a.at(0);
}
int max(vector<int> a, int m) {
sort(a.begin(), a.end());
return a.at(m - 1);
}
int main() {
int n, m;
cin >> n >> m;
vector<int> L(m);
vector<int> R(m);
int ans = 0;
for (in... | #include <bits/stdc++.h>
using namespace std;
int min(vector<int> a, int m) {
sort(a.begin(), a.end());
return a.at(0);
}
int max(vector<int> a, int m) {
sort(a.begin(), a.end());
return a.at(m - 1);
}
int main() {
int n, m;
cin >> n >> m;
vector<int> L(m);
vector<int> R(m);
int ans = 0;
for (in... | replace | 27 | 46 | 27 | 31 | TLE | |
p03037 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
for (int i = 0; i < M; i++)
cin >> L.at(i) >> R.at(i);
// vector<bool> A(N,true);
int ans = 0;
for (int i = 1; i <= N; i++) {
bool mighty = true;
for (int j = 0; j < M; j++) {
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
for (int i = 0; i < M; i++)
cin >> L.at(i) >> R.at(i);
// vector<bool> A(N,true);
sort(L.begin(), L.end());
sort(R.begin(), R.end());
reverse(L.begin(), L.end());
if (L.at(0) <= R.at(0))
... | replace | 10 | 23 | 10 | 17 | TLE | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m);
vector<int> r(m);
for (int i = 0; i < m; ++i) {
cin >> l[i] >> r[i];
}
sort(l.begin(), l.end());
sort(r.begin(), r.end());
int num = l[n - 1] - r[0] + 1;
cout << num << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m);
vector<int> r(m);
for (int i = 0; i < m; ++i) {
cin >> l[i] >> r[i];
}
sort(l.begin(), l.end());
sort(r.begin(), r.end());
if (r[0] >= l[m - 1]) {
int num = r[0] - l[m - 1] + 1;
cout << n... | replace | 13 | 15 | 13 | 19 | 0 | |
p03037 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<int> a(n + 2, 0);
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
for (int j = l; j <= r; j++) {
a[j]++;
}
}
long long kotae = 0;
for (int i = 1; i <= n; i++) {
if (a[i] == m)... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<int> a(n + 2, 0);
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
a[l]++;
a[r + 1]--;
}
for (int i = 1; i < n + 2; i++) {
a[i] += a[i - 1];
}
long long kotae = 0;
for (int i = 1... | replace | 10 | 13 | 10 | 15 | TLE | |
p03037 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define int long long
#ifndef FAST_IO
#define IOS ios_base::sync_with_stdio(false), cin.tie(nullptr);
#endif
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
template <typename T> void print(T t) {
for (auto &it : t)
... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define int long long
#ifndef FAST_IO
#define IOS ios_base::sync_with_stdio(false), cin.tie(nullptr);
#endif
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
template <typename T> void print(T t) {
for (auto &it : t)
... | replace | 19 | 21 | 19 | 21 | 0 | |
p03037 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const int INF = 1e+9;
int main() {
int n, m = 0;
cin >> n >> m;
vector<int> l_list(m);
vector<int> r_list(m);
int r_min = INF;
int l_max = -99999;
int l = 0;
int r = 0;
for (int i = 0; i < m; i++) {
ci... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const int INF = 1e+9;
int main() {
int n, m = 0;
cin >> n >> m;
vector<int> l_list(m);
vector<int> r_list(m);
int r_min = INF;
int l_max = -99999;
int l = 0;
int r = 0;
for (int i = 0; i < m; i++) {
ci... | replace | 25 | 33 | 25 | 26 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
map<int, ll> mp;
for (int i = 0; i < m; i++) {
int b, c;
cin >> b >> c;
mp[c] += b;
}
ll ans = 0;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
map<int, ll> mp;
for (int i = 0; i < m; i++) {
int b, c;
cin >> b >> c;
mp[c] += b;
}
ll ans = 0;
for (int i =... | replace | 20 | 21 | 20 | 21 | 0 | |
p03038 | C++ | Runtime Error | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
#define pb push_back
#define f first
#define s second
#define double long double
const int MAX = 2e5 + 5;
const int MAX2 = 2e5 + 4;
const in... | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
#define pb push_back
#define f first
#define s second
#define double long double
const int MAX = 2e5 + 5;
const int MAX2 = 2e5 + 4;
const in... | replace | 34 | 35 | 34 | 35 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int N, M;
long long int A[100005], C[100005];
int B[100005];
vector<long long int> V;
set<long long int> temp;
vector<long long int> W;
map<long long int, int> MAP;
int main(void) {
cin >> N >> M;
for ... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int N, M;
long long int A[100005], C[100005];
int B[100005];
vector<long long int> V;
set<long long int> temp;
vector<long long int> W;
map<long long int, int> MAP;
int main(void) {
cin >> N >> M;
for ... | insert | 41 | 41 | 41 | 44 | TLE | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// g++ -std=c++11
using namespace std;
typedef long long ll;
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 // 10^9+7
int main() {
ll N, M;
cin >> N >> M;
priority_queue<ll, vector<ll>, greater<ll>> Q;
rep(i, N) {
ll a;
cin >> a;
Q.push(a);
... | #include <bits/stdc++.h>
// g++ -std=c++11
using namespace std;
typedef long long ll;
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 // 10^9+7
int main() {
ll N, M;
cin >> N >> M;
priority_queue<ll, vector<ll>, greater<ll>> Q;
rep(i, N) {
ll a;
cin >> a;
Q.push(a);
... | insert | 31 | 31 | 31 | 33 | TLE | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
vector<int> data;
vector<pair<int, int>> changes;
long long sum = 0;
cin >> n;
cin >> m;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
data.push_back(t);
}
sort(data.... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
vector<int> data;
vector<pair<int, int>> changes;
long long sum = 0;
cin >> n;
cin >> m;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
data.push_back(t);
}
sort(data.... | insert | 30 | 30 | 30 | 33 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | replace | 45 | 47 | 45 | 48 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef long long ll;
bool debug = false;
string yes = "Yes";
string no = "No";
int main() {
ll n, m;
cin >> n >> m;
priority_queue<ll, vector<ll>, greater<ll>> q;
rep(i, n) {
ll a;
cin >> a;
q.push(a);
}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef long long ll;
bool debug = false;
string yes = "Yes";
string no = "No";
int main() {
ll n, m;
cin >> n >> m;
priority_queue<ll, vector<ll>, greater<ll>> q;
rep(i, n) {
ll a;
cin >> a;
q.push(a);
}... | replace | 28 | 29 | 28 | 29 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define For(i, n) for (long i = 0; i < (n); i++)
int main() {
long n, m, k = 0;
cin >> n >> m;
vector<long> A(n);
vector<pair<long, long>> BC(m);
vector<long> change;
For(i, n) { cin >> A.at(i); }
For(i, m) {
long b, c;
cin >> b >> c;
BC[i] = make... | #include <bits/stdc++.h>
using namespace std;
#define For(i, n) for (long i = 0; i < (n); i++)
int main() {
long n, m, k = 0;
cin >> n >> m;
vector<long> A(n);
vector<pair<long, long>> BC(m);
vector<long> change;
For(i, n) { cin >> A.at(i); }
For(i, m) {
long b, c;
cin >> b >> c;
BC[i] = make... | replace | 31 | 32 | 31 | 32 | 0 | |
p03038 | C++ | Time Limit Exceeded | // #include "bits/stdc++.h"
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <tuple>
#i... | // #include "bits/stdc++.h"
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <tuple>
#i... | replace | 147 | 148 | 147 | 149 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb pushback
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
int main() {
int n, m;
cin >> n >> m;
int a[n];
int b[m];
int c[m];
bool end = false;
vector<pair<long, long>> pairs(m);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb pushback
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
int main() {
int n, m;
cin >> n >> m;
int a[n];
int b[m];
int c[m];
bool end = false;
vector<pair<long, long>> pairs(m);
... | insert | 32 | 32 | 32 | 36 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, m;
int a[100002];
int b, c;
priority_queue<pair<int, int>> pq;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (int i = 0; i < m; i++) {
cin >> b >> c;
pq.push(make_pair(c, b));
}
int cnt = 0;
whil... | #include <bits/stdc++.h>
using namespace std;
int n, m;
int a[100002];
int b, c;
priority_queue<pair<int, int>> pq;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (int i = 0; i < m; i++) {
cin >> b >> c;
pq.push(make_pair(c, b));
}
int cnt = 0;
whil... | replace | 23 | 24 | 23 | 24 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
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) {
a = b;
return 1;
}
return 0;
}
int main() ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
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) {
a = b;
return 1;
}
return 0;
}
int main() ... | replace | 39 | 40 | 39 | 42 | 0 | |
p03038 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iomanip>... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iomanip>... | replace | 39 | 40 | 39 | 40 | 0 | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) \
; ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) \
; ... | insert | 32 | 32 | 32 | 34 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
int main() {
ll N, M;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
int main() {
ll N, M;
cin >> ... | replace | 44 | 45 | 44 | 45 | 0 | |
p03038 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector... | insert | 122 | 122 | 122 | 124 | 0 | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n];
rep(i, n) cin >> a[i];
vector<pair<int, int>> pairs(m);
int b, c;
rep(i,... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n];
rep(i, n) cin >> a[i];
vector<pair<int, int>> pairs(m);
int b, c;
rep(i,... | insert | 34 | 34 | 34 | 36 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, M;
long A;
long B, C;
set<long> s;
vector<pair<long, long>> vec;
map<long, long> m;
long sum = 0;
cin >> N >> M;
for (long i = 0; i < N; i++) {
cin >> A;
m[A]++;
s.insert(A);
}
for (long i = 0; i < M; i++) {
cin... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, M;
long A;
long B, C;
set<long> s;
vector<pair<long, long>> vec;
map<long, long> m;
long sum = 0;
cin >> N >> M;
for (long i = 0; i < N; i++) {
cin >> A;
m[A]++;
s.insert(A);
}
for (long i = 0; i < M; i++) {
cin... | replace | 44 | 45 | 44 | 45 | TLE | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (... | replace | 63 | 64 | 63 | 64 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
#define SE second
#define vi vector<int>
#define pb push_back
#define pi pair<int, int>
#define mp make_pair
#define ll long long
#define LLI long long int
#define REP(i, a, b) for (long long i = a; i < b; i++)
#define PER(i, a, b) for (int i = b - 1; i >= a; i--)
#define YES(i) cout << (i ? "Y... | #include <bits/stdc++.h>
#define SE second
#define vi vector<int>
#define pb push_back
#define pi pair<int, int>
#define mp make_pair
#define ll long long
#define LLI long long int
#define REP(i, a, b) for (long long i = a; i < b; i++)
#define PER(i, a, b) for (int i = b - 1; i >= a; i--)
#define YES(i) cout << (i ? "Y... | replace | 35 | 36 | 35 | 36 | 0 | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define i64 int64_t
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define ffrvs(ii, nn, mm) for (int ii = nn; ii >= mm; ii--)
#def... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define i64 int64_t
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define ffrvs(ii, nn, mm) for (int ii = nn; ii >= mm; ii--)
#def... | insert | 48 | 48 | 48 | 50 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
/**/
#include <random>
using namespace std;
int main() {
long long int N, M;
cin >> N >> M;
vector<long long int> A(N);
priority_queue<long long int, vector<long long int>, greater<long long int>>
que;
for (size_t i = 0; i < N; i++) {
cin >> A[i];
que.push(A[i]);
}
... | #include <bits/stdc++.h>
/**/
#include <random>
using namespace std;
int main() {
long long int N, M;
cin >> N >> M;
vector<long long int> A(N);
priority_queue<long long int, vector<long long int>, greater<long long int>>
que;
for (size_t i = 0; i < N; i++) {
cin >> A[i];
que.push(A[i]);
}
... | insert | 22 | 22 | 22 | 28 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<boo... | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<boo... | replace | 88 | 90 | 88 | 90 | 0 | |
p03038 | C++ | Runtime Error | //==========================Head files==========================
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define LL long long
#define db double
#define mp make_pair
#define pr pair<int, int>
#define f... | //==========================Head files==========================
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define LL long long
#define db double
#define mp make_pair
#define pr pair<int, int>
#define f... | insert | 114 | 114 | 114 | 116 | 0 | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include ... | insert | 68 | 68 | 68 | 76 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
#define mod (ll)(1e9 + 7)
#define inf (ll)(3e18 + 7)
#define pi (double)acos(-1)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#defin... | #include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
#define mod (ll)(1e9 + 7)
#define inf (ll)(3e18 + 7)
#define pi (double)acos(-1)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#defin... | replace | 20 | 21 | 20 | 21 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MAX = 5e5 + 5;
bool a[MAX];
int main() {
LL n, m;
cin >> n >> m;
multiset<LL> s;
for (int i = 0; i < n; i++) {
LL x;
cin >> x;
s.insert(x);
}
while (m--) {
LL b, c;
cin >> b >> c;
while (b--) {
LL x ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MAX = 5e5 + 5;
bool a[MAX];
int main() {
LL n, m;
cin >> n >> m;
multiset<LL> s;
for (int i = 0; i < n; i++) {
LL x;
cin >> x;
s.insert(x);
}
vector<pair<LL, LL>> v;
for (int i = 0; i < m; i++) {
LL x, y;
cin... | replace | 15 | 18 | 15 | 26 | TLE | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define cps CLOCKS_PER_SEC
#define mod (long long)1000000007
#define f first
#define s second
#define debug1(x) cerr << x << "\n"
#define debug2(x, y) cerr << x << " " << y << ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define cps CLOCKS_PER_SEC
#define mod (long long)1000000007
#define f first
#define s second
#define debug1(x) cerr << x << "\n"
#define debug2(x, y) cerr << x << " " << y << ... | replace | 31 | 34 | 31 | 38 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
freopen("D.INP", "r", stdin);
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
priority_queue<int, vector<int>, greater<int>> q;
priority_queue<pair<int, int>> o;
cin >> n >> m;
while (n--) {
int t;
cin >> t;
q.push(t);
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("D.INP","r",stdin);
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
priority_queue<int, vector<int>, greater<int>> q;
priority_queue<pair<int, int>> o;
cin >> n >> m;
while (n--) {
int t;
cin >> t;
q.push(t);
}
... | replace | 5 | 6 | 5 | 6 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03038 | C++ | Runtime Error | // D - Integer Cards
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<pair<int, int>> t(n);
for (int i = 0; i < m; i++)
cin >> t[i].second >> t[i].first;
sort(a.begin(), a.e... | // D - Integer Cards
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<pair<int, int>> t(m);
for (int i = 0; i < m; i++)
cin >> t[i].second >> t[i].first;
sort(a.begin(), a.e... | replace | 11 | 12 | 11 | 12 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define P pair<ll, ll>
typedef vector<int> vec;
typedef vector<vec> mat;
bool f(P x... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define P pair<ll, ll>
typedef vector<int> vec;
typedef vector<vec> mat;
bool f(P x... | replace | 22 | 23 | 22 | 23 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define tl 1'000'000'007
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REREP(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define REFOR(i, n, a) for (ll i = n; i >= a; i--)
struct P ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define tl 1'000'000'007
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REREP(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define REFOR(i, n, a) for (ll i = n; i >= a; i--)
struct P ... | insert | 34 | 34 | 34 | 37 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
const long long int INF = 1e9;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (int... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
const long long int INF = 1e9;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (int... | insert | 138 | 138 | 138 | 140 | TLE | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int arr[100001];
vector<pair<int, int>> v;
int n, m;
bool cmp(const pair<int, int> &a, const pair<int, int> &b) {
if (a.first == b.first)
return a.second > b.second;
return a.first > b.first;
}
int main() {
cin.tie(0);
cout.ti... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int arr[100001];
vector<pair<int, int>> v;
int n, m;
bool cmp(const pair<int, int> &a, const pair<int, int> &b) {
if (a.first == b.first)
return a.second > b.second;
return a.first > b.first;
}
int main() {
cin.tie(0);
cout.ti... | replace | 33 | 34 | 33 | 34 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define FORe(i, k, n) for (int i = (k); i <= (n); i++)
#define FORr(i, k, n) for (int i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for (int i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, n, 0)
#define ... | #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define FORe(i, k, n) for (int i = (k); i <= (n); i++)
#define FORr(i, k, n) for (int i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for (int i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, n, 0)
#define ... | replace | 21 | 22 | 21 | 22 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<long long> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<int> B(M);
vector<long long> C(N);
for (int i = 0; i < M; i++)
cin >> B[i] >> C[i];
sort(A.begin(), A.end());
vector<int> index(M);
iot... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<long long> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<int> B(M);
vector<long long> C(M);
for (int i = 0; i < M; i++)
cin >> B[i] >> C[i];
sort(A.begin(), A.end());
vector<int> index(M);
iot... | replace | 10 | 11 | 10 | 11 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 1000000007
typedef long long int ll;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<ll> a(N), c(M), d(N);
vector<int> b(M);
vector<pair<int, int>> pairs(M);
ll sum = 0;
ll ans = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
... | #include <bits/stdc++.h>
#define MOD 1000000007
typedef long long int ll;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<ll> a(N), c(M), d(N);
vector<int> b(M);
vector<pair<ll, int>> pairs(M);
ll sum = 0;
ll ans = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
}... | replace | 10 | 11 | 10 | 11 | 0 | |
p03038 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef uint64_t ull;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
l... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef uint64_t ull;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
l... | insert | 35 | 35 | 35 | 37 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll N, M;
cin >> N >> M;
vector<ll> vec(N);
for (ll i = 0; i < N; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
vector<pair<int, int>> card(M);
for (ll i = 0; i < M; i++) {
ll b, c;
cin >> b >> c;
ca... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll N, M;
cin >> N >> M;
vector<ll> vec(N);
for (ll i = 0; i < N; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
vector<pair<ll, ll>> card(M);
for (ll i = 0; i < M; i++) {
ll b, c;
cin >> b >> c;
card... | replace | 13 | 14 | 13 | 14 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
ty... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
ty... | replace | 80 | 81 | 80 | 83 | 0 | |
p03038 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sqrt pow
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sqrt pow
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include... | replace | 32 | 33 | 32 | 33 | 0 | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
bool compare_by_second(pa... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
bool compare_by_second(pa... | replace | 59 | 60 | 59 | 60 | 0 | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace ... | insert | 61 | 61 | 61 | 64 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll, ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i, m, n) for (ll(i) = (m), (i_len) = (n); (i) < (i_len); ++(i))
#define FORR(i, v... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll, ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i, m, n) for (ll(i) = (m), (i_len) = (n); (i) < (i_len); ++(i))
#define FORR(i, v... | replace | 32 | 33 | 32 | 33 | 0 | |
p03038 | C++ | Time Limit Exceeded | //
// じょえチャンネル
// 高評価・チャンネル登録よろしくお願いします！
// https://www.youtube.com/watch?v=gPFr7q7eLL8
//
/*------------------------------------
∧＿∧
∧＿∧ （´<_｀ ）
（ ´_ゝ`） / ⌒i
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
-------------------------------------*/
#include <alg... | //
// じょえチャンネル
// 高評価・チャンネル登録よろしくお願いします！
// https://www.youtube.com/watch?v=gPFr7q7eLL8
//
/*------------------------------------
∧＿∧
∧＿∧ （´<_｀ ）
（ ´_ゝ`） / ⌒i
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
-------------------------------------*/
#include <alg... | replace | 286 | 287 | 286 | 288 | TLE | |
p03038 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; ++i)
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; ++i)
... | replace | 31 | 32 | 31 | 32 | TLE | |
p03038 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;... | insert | 40 | 40 | 40 | 42 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<long int> a(n);
vector<pair<long int, long int>> cb(m);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < m; i++) {
long int b_tmp, c_tmp;
cin >> b_tmp >> c_tmp;
cb.at(i) = make_pa... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<long int> a(n);
vector<pair<long int, long int>> cb(m);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < m; i++) {
long int b_tmp, c_tmp;
cin >> b_tmp >> c_tmp;
cb.at(i) = make_pa... | replace | 24 | 33 | 24 | 37 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i ... | #include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i ... | replace | 87 | 88 | 87 | 88 | 0 | |
p03038 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <algorithm> //next_permutation
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace... | #define _GLIBCXX_DEBUG
#include <algorithm> //next_permutation
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace... | replace | 62 | 63 | 62 | 63 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <queue>
#include <stdio.h>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll i, j, n, m, now, ans = 0, t, a;
scanf("%lld%lld", &n, &m);
priority_queue<ll, vector<ll>, greater<ll>> p;
for (i = 0; i < n; ++i)
... | #include <algorithm>
#include <functional>
#include <queue>
#include <stdio.h>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll i, j, n, m, now, ans = 0, t, a;
scanf("%lld%lld", &n, &m);
priority_queue<ll, vector<ll>, greater<ll>> p;
for (i = 0; i < n; ++i)
... | replace | 20 | 21 | 20 | 21 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end()... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end()... | insert | 36 | 36 | 36 | 38 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define FOR(NAME, START, NUM) for (ll NAME = START; NAME < (NUM); NAME++)
#define REP(NAME, NUM) for (ll NAME = 0; NAME < (NUM); NAME++)
#define BREP(NAME, NUM) for (ll NAME = (NUM)-1; NAME >= 0;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define FOR(NAME, START, NUM) for (ll NAME = START; NAME < (NUM); NAME++)
#define REP(NAME, NUM) for (ll NAME = 0; NAME < (NUM); NAME++)
#define BREP(NAME, NUM) for (ll NAME = (NUM)-1; NAME >= 0;... | replace | 17 | 18 | 17 | 18 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
vector<pair<int, int>> p(n);
rep(i, n) cin >> a[i];
rep(i, m) {
int b, c;
cin >> b >> c;
p[i] = make_pair(c, b);
}
sor... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
vector<pair<int, int>> p(m);
rep(i, n) cin >> a[i];
rep(i, m) {
int b, c;
cin >> b >> c;
p[i] = make_pair(c, b);
}
sor... | replace | 10 | 11 | 10 | 11 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
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) {
a = b;
return 1;
}
return 0;
}
int main() ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
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) {
a = b;
return 1;
}
return 0;
}
int main() ... | replace | 39 | 40 | 39 | 40 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1000000000 + 7;
bool debug = 0;
void solve() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<pair<int, int>> bc(m);
for (int i = 0; i < m; i++)
cin >>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1000000000 + 7;
bool debug = 0;
void solve() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<pair<int, int>> bc(m);
for (int i = 0; i < m; i++)
cin >>... | insert | 22 | 22 | 22 | 24 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll count = 0;
ll N, M;
cin >> N >> M;
vector<ll> A(N);
vector<pair<ll, ll>> vec(M, pair<ll, ll>());
for (ll i = 0; i < N; i++)
cin >> A.at(i);
for (ll i = 0; i < M; i++)
cin >> vec.at(i).second >> vec.at(i).fir... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll count = 0;
ll N, M;
cin >> N >> M;
vector<ll> A(N);
vector<pair<ll, ll>> vec(M, pair<ll, ll>());
for (ll i = 0; i < N; i++)
cin >> A.at(i);
for (ll i = 0; i < M; i++)
cin >> vec.at(i).second >> vec.at(i).fir... | replace | 25 | 26 | 25 | 26 | 0 | |
p03038 | C++ | Runtime Error | #include <algorithm> // sort
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <queue>
#include <string>
#include <vector>
#define ABS(x) ((x) > 0 ? (x) : -(x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
using namespace std;
unsigned long long int newton(long long int a, long long... | #include <algorithm> // sort
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <queue>
#include <string>
#include <vector>
#define ABS(x) ((x) > 0 ? (x) : -(x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
using namespace std;
unsigned long long int newton(long long int a, long long... | insert | 83 | 83 | 83 | 87 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.