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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03033 | C++ | Time Limit Exceeded | ////////////////////////////////////////
/// tu3 pro-con template ///
////////////////////////////////////////
#include "bits/stdc++.h"
using namespace std;
// -- typedefs -- //
#define EPS 1e-9
typedef long long llong;
// -- loop macros -- //
#define REP(i, n) for (auto i = decltype(n)(0); i < (n); i++)
... | ////////////////////////////////////////
/// tu3 pro-con template ///
////////////////////////////////////////
#include "bits/stdc++.h"
using namespace std;
// -- typedefs -- //
#define EPS 1e-9
typedef long long llong;
// -- loop macros -- //
#define REP(i, n) for (auto i = decltype(n)(0); i < (n); i++)
... | replace | 222 | 226 | 222 | 242 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class type> class SegmentTree {
public:
int size;
vector<type> tree;
type def;
type (*marge)(type, type);
SegmentTree(int n, type d, type (*m)(type, type)) {
size = 1;
def = d;
marge = m;
n++;
while (size < n) {
size *= 2;
... | #include <bits/stdc++.h>
using namespace std;
template <class type> class SegmentTree {
public:
int size;
vector<type> tree;
type def;
type (*marge)(type, type);
SegmentTree(int n, type d, type (*m)(type, type)) {
size = 1;
def = d;
marge = m;
n++;
while (size < n) {
size *= 2;
... | replace | 127 | 128 | 127 | 128 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
#define MN 201000
std::set<int> st;
struct xxx {
int t, o, w;
xxx() {}
xxx(int a, int b, int c) {
t = a;
o = b;
w = c;
}
} b[MN];
bool cmp(xxx a, xxx b) { return a.t == b.t ? a.o < b.o : a.t < b.t; }
int main() {
int n, ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
#define MN 401000
std::set<int> st;
struct xxx {
int t, o, w;
xxx() {}
xxx(int a, int b, int c) {
t = a;
o = b;
w = c;
}
} b[MN];
bool cmp(xxx a, xxx b) { return a.t == b.t ? a.o < b.o : a.t < b.t; }
int main() {
int n, ... | replace | 4 | 5 | 4 | 5 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <queue>
#include <set>
#include <stdio.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int n, q, s[200010], t[200010], x[200010], d[200010];
set<int> block;
priority_queue<pii, vector<pii>, greater<pii>> st, ed;
int main() {
scanf("%d %d",... | #include <algorithm>
#include <functional>
#include <queue>
#include <set>
#include <stdio.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int n, q, s[200010], t[200010], x[200010], d[200010];
set<int> block;
priority_queue<pii, vector<pii>, greater<pii>> st, ed;
int main() {
scanf("%d %d",... | replace | 28 | 29 | 28 | 29 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#define F... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#define F... | replace | 73 | 77 | 73 | 75 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include ... | replace | 56 | 57 | 56 | 57 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
vector<pair<int, pair<int, int>>> closed;
for (int i = 0; i < n; i++) {
int s, t, x;
cin >> s >> t >> x;
closed.push_back({s - x, {1, x}}); // type : 1
closed.push_back({t - x, {-1, x}}); // type : -1
}
s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
vector<pair<int, pair<int, int>>> closed;
for (int i = 0; i < n; i++) {
int s, t, x;
cin >> s >> t >> x;
closed.push_back({s - x, {1, x}}); // type : 1
closed.push_back({t - x, {-1, x}}); // type : -1
}
s... | replace | 24 | 25 | 24 | 25 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | insert | 57 | 57 | 57 | 59 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(v) v.begin(), v.end()
#define mkp make_pair
#define... | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(v) v.begin(), v.end()
#define mkp make_pair
#define... | replace | 55 | 56 | 55 | 56 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF_LL 1LL << 39
#define INF 100000000
#define MOD 1000000007LL
#define ll long long
#define all(x) x.begin(), x.end()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define prique priority_queue
#define PI acos(-1)
typedef pair<int,... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL 1LL << 39
#define INF 100000000
#define MOD 1000000007LL
#define ll long long
#define all(x) x.begin(), x.end()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define prique priority_queue
#define PI acos(-1)
typedef pair<int,... | replace | 61 | 63 | 61 | 63 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define VECCIN(x) ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define VECCIN(x) ... | replace | 73 | 74 | 73 | 74 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7... | insert | 36 | 36 | 36 | 38 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 200;
const int INF = 1e9;
int main() {
set<int> event_set;
int d[MAXN];
vector<pair<int, int>> stoppers;
int N, Q;
cin >> N >> Q;
for (int i = 0; i < N; i++) {
int S, T, X;
cin >> S >> T >> X;
stoppers.push_back(make_pair(S - X, X... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 200000;
const int INF = 1e9;
int main() {
set<int> event_set;
int d[MAXN];
vector<pair<int, int>> stoppers;
int N, Q;
cin >> N >> Q;
for (int i = 0; i < N; i++) {
int S, T, X;
cin >> S >> T >> X;
stoppers.push_back(make_pair(S - X... | replace | 3 | 4 | 3 | 4 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < n; i++)
struct info {
ll left, right, time;
};
bool comp(const info &a, const info &b) { return a.time <= b.time; }
int main() {
int n, q;
cin >> n >> q;
ll s, t, x;
vector<info> vec(n);
rep(i, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < n; i++)
struct info {
ll left, right, time;
};
bool comp(const info &a, const info &b) { return a.time < b.time; }
int main() {
int n, q;
cin >> n >> q;
ll s, t, x;
vector<info> vec(n);
rep(i, n... | replace | 10 | 11 | 10 | 11 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
const int InF = 0x3f3f3f3f, maxn = 2e5 + 2;
struct node {
int t, x, d;
inline bool operator<(const node &x) const { return t < x.t; }
} event[maxn];
int n, m;
int len;
multiset<int> msi;
int main() {
cin >> n >> m;
int i;
for (i = 1;... | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
const int InF = 0x3f3f3f3f, maxn = 2e6 + 2;
struct node {
int t, x, d;
inline bool operator<(const node &x) const { return t < x.t; }
} event[maxn];
int n, m;
int len;
multiset<int> msi;
int main() {
cin >> n >> m;
int i;
for (i = 1;... | replace | 4 | 5 | 4 | 5 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <algorithm> // minmax, sort, swap
#include <climits> // INT_MIN, LLONG_MIN
#include <cmath> // long, trig, pow
#include <cstdio> // printf, scanf
#include <iomanip> //cout<<setprecision(n)
#include <iostream> // cin, cout, cerr, clog
#include <iterator> //iterators
#inc... | #include <algorithm> // minmax, sort, swap
#include <climits> // INT_MIN, LLONG_MIN
#include <cmath> // long, trig, pow
#include <cstdio> // printf, scanf
#include <iomanip> //cout<<setprecision(n)
#include <iostream> // cin, cout, cerr, clog
#include <iterator> //iterators
#inc... | replace | 54 | 55 | 54 | 55 | TLE | |
p03033 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
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;
}
#define rep(i, n) for (int i = 0; i... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
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;
}
#define rep(i, n) for (int i = 0... | replace | 0 | 1 | 0 | 1 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
const int MAXN = 200005;
const int MOD = 1000000007;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define DEC(i, a, b) for (int i = (a); i >= (b); i--)
#define fst first
#define snd second
#define pb push_back
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
const int MAXN = 200005;
const int MOD = 1000000007;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define DEC(i, a, b) for (int i = (a); i >= (b); i--)
#define fst first
#define snd second
#define pb push_back
#define ... | replace | 21 | 22 | 21 | 22 | -11 | |
p03033 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
int main()... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
int main()... | replace | 43 | 47 | 43 | 45 | TLE | |
p03034 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, in... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, in... | replace | 51 | 52 | 51 | 62 | TLE | |
p03034 | C++ | Runtime Error | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long N;
cin >> N;
vector<long> s(N);
for (auto &i : s)
cin >> i;
long ans{0};
for (unsigned long i = 1; i < N; ++i) {
long tmp{0};
for (unsigned long j = 0, k = N - 1; k > 0 && (k % i != 0 || j < k);
j += i, k -= i)
... | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long N;
cin >> N;
vector<long> s(N);
for (auto &i : s)
cin >> i;
long ans{0};
for (unsigned long i = 1; i < N; ++i) {
long tmp{0};
for (unsigned long j = 0, k = N - 1; k > i && (k % i != 0 || j < k);
j += i, k -= i)
... | replace | 12 | 13 | 12 | 13 | -11 | |
p03034 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include ... | replace | 80 | 81 | 80 | 82 | -6 | double free or corruption (out)
|
p03034 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <... | replace | 40 | 41 | 40 | 41 | TLE | |
p03034 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using i64 = int64_t;
i64 n;
vector<i64> s;
int main() {
cin >> n;... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using i64 = int64_t;
i64 n;
vector<i64> s;
int main() {
cin >> n;... | replace | 39 | 46 | 39 | 40 | TLE | |
p03034 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i, j, k) for (int(i) = (j); (i) < (int)(k); ++(i))
#define rep(i, j) FOR(i, 0, j)
#define each(x, y) for (auto &(x) : (y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << "... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i, j, k) for (int(i) = (j); (i) < (int)(k); ++(i))
#define rep(i, j) FOR(i, 0, j)
#define each(x, y) for (auto &(x) : (y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << "... | replace | 27 | 28 | 27 | 28 | TLE | |
p03034 | C++ | Time Limit Exceeded | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#includ... | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#includ... | replace | 34 | 37 | 34 | 37 | TLE | |
p03034 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long NS = (long long)1e5 + 4;
long long N;
long long arr[NS];
vector<long long> sum1[NS], sum2[NS];
int main() {
scanf("%lld", &N);
for (long long i = 1; i <= N; ++i)
scanf("%lld", arr + i);
for (long long i = 1; i <= N; ++i) {
long long pos = N ... | #include <bits/stdc++.h>
using namespace std;
const long long NS = (long long)1e5 + 4;
long long N;
long long arr[NS];
vector<long long> sum1[NS], sum2[NS];
int main() {
scanf("%lld", &N);
for (long long i = 1; i <= N; ++i)
scanf("%lld", arr + i);
for (long long i = 1; i <= N; ++i) {
long long pos = N ... | replace | 48 | 49 | 48 | 49 | -8 | |
p03035 | C++ | Time Limit Exceeded | // written by NewbieChd
#include <cctype>
#include <cstdio>
using namespace std;
const int BUF = 1000000;
char buf[BUF], *p1, *p2;
inline char getChar() {
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, BUF, stdin), p1 == p2)
? EOF
: *p1++;
}
inline int read() {
register int f = 0;
... | // written by NewbieChd
#include <cctype>
#include <cstdio>
using namespace std;
const int BUF = 1000000;
char buf[BUF], *p1, *p2;
inline char getChar() {
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, BUF, stdin), p1 == p2)
? EOF
: *p1++;
}
inline int read() {
register int f = 0;
... | delete | 26 | 30 | 26 | 26 | TLE | |
p03035 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define el "\n"
#define ld long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, n) for (int i = n; i >= 0; i--)
#define rep_a(i, a, n) for (int i = a; i < n; i++)
#define tr(ds, it) for (auto it = ds.begin(); it !=... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define el "\n"
#define ld long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, n) for (int i = n; i >= 0; i--)
#define rep_a(i, a, n) for (int i = a; i < n; i++)
#define tr(ds, it) for (auto it = ds.begin(); it !=... | replace | 37 | 41 | 37 | 38 | 0 | |
p03035 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define endl "\n"
const int MAX = 100005;
const long long mod = 1.0e9 + 7;
int main() {
ios_base::sync_with_stdio(fa... | #include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define endl "\n"
const int MAX = 100005;
const long long mod = 1.0e9 + 7;
int main() {
ios_base::sync_with_stdio(fa... | delete | 14 | 18 | 14 | 14 | 0 | |
p03035 | Python | Runtime Error | def main():
a, b = map(int, input())
if a >= 13:
print(b)
elif 6 <= a <= 12:
print(b // 2)
else:
print(0)
if __name__ == "__main__":
main()
| def main():
a, b = map(int, input().split())
if a >= 13:
print(b)
elif 6 <= a <= 12:
print(b // 2)
else:
print(0)
if __name__ == "__main__":
main()
| replace | 1 | 2 | 1 | 2 | ValueError: invalid literal for int() with base 10: ' ' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03035/Python/s703074375.py", line 13, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03035/Python/s703074375.py", line 3, in main
a, b = map(int, input())
ValueErr... |
p03035 | Python | Runtime Error | A, B = map(int, input())
if A >= 13:
print(B)
elif A >= 6:
print(B // 2)
else:
print(0)
| A, B = map(int, input().split())
if A >= 13:
print(B)
elif A >= 6:
print(B // 2)
else:
print(0)
| replace | 0 | 1 | 0 | 1 | ValueError: invalid literal for int() with base 10: ' ' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03035/Python/s602871516.py", line 1, in <module>
A, B = map(int, input())
ValueError: invalid literal for int() with base 10: ' '
|
p03035 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | replace | 35 | 40 | 35 | 40 | 0 | |
p03035 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | delete | 40 | 44 | 40 | 40 | 0 |
Time elapsed: 32ms
|
p03035 | C++ | Runtime Error | #include <cstdio>
#include <cstdlib>
int main(int argc, char **argv) {
int age = atoi(argv[1]);
int price = atoi(argv[2]);
if (age >= 13) {
printf("%d\n", price);
return 0;
}
if (age >= 6) {
printf("%d\n", price / 2);
return 0;
}
printf("%d\n", 0);
return 0;
}
| #include <cstdio>
#include <cstdlib>
int main() {
int age, price;
scanf("%d %d", &age, &price);
if (age >= 13) {
printf("%d\n", price);
return 0;
}
if (age >= 6) {
printf("%d\n", price / 2);
return 0;
}
printf("%d\n", 0);
return 0;
}
| replace | 3 | 6 | 3 | 6 | -11 | |
p03035 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A;
cin >> B;
if (A >= 13) {
cout << B << endl;
;
} else if (A >= 6) {
cout << (int)(B / 2) << endl;
;
} else {
cout << 0 << endl;
;
}
return 1;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A;
cin >> B;
if (A >= 13) {
cout << B << endl;
;
} else if (A >= 6) {
cout << (int)(B / 2) << endl;
;
} else {
cout << 0 << endl;
;
}
return 0;
} | replace | 17 | 18 | 17 | 18 | 1 | |
p03036 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D, x;
cin >> r >> D >> x;
int i = 0; // カウンタ変数
while (i < 10) {
x = r * x - D;
cout << x << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D, x;
cin >> r >> D >> x;
int i = 0; // カウンタ変数
while (i < 10) {
x = r * x - D;
cout << x << endl;
i++;
}
} | insert | 10 | 10 | 10 | 11 | TLE | |
p03036 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D, x;
cin >> r >> D >> x;
vector<int> X(11);
X.at(0) = x;
for (int i = 0; i < 11; i++) {
X.at(i + 1) = r * X.at(i) - D;
}
for (int i = 1; i < 11; i++) {
cout << X.at(i) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D, x;
cin >> r >> D >> x;
vector<int> X(11);
X.at(0) = x;
for (int i = 0; i < 10; i++) {
X.at(i + 1) = r * X.at(i) - D;
}
for (int i = 1; i < 11; i++) {
cout << X.at(i) << endl;
}
} | replace | 7 | 8 | 7 | 8 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 11) >= this->size() (which is 11)
|
p03036 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int r, D, x[11];
cin >> r >> D >> x[0];
for (int i = 1; i < 11; i) {
x[i] = r * x[i - 1] - D;
cout << x[i] << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int r, D, x[11];
cin >> r >> D >> x[0];
for (int i = 1; i < 11; i++) {
x[i] = r * x[i - 1] - D;
cout << x[i] << endl;
}
return 0;
}
| replace | 7 | 8 | 7 | 8 | TLE | |
p03036 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, d;
vector<int> x(10);
cin >> r >> d >> x[0];
for (int i; i < 10; i++) {
x[i + 1] = r * x[i] - d;
cout << x[i + 1] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, d;
vector<int> x(11);
cin >> r >> d >> x[0];
for (int i; i < 10; i++) {
x[i + 1] = r * x[i] - d;
cout << x[i + 1] << endl;
}
} | replace | 5 | 6 | 5 | 6 | 0 | |
p03036 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
int D;
int x;
int count = 0;
cin >> r >> D >> x;
while (count < 10) {
x = x * r - D;
cout << x << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
int D;
int x;
int count = 0;
cin >> r >> D >> x;
while (count < 10) {
x = x * r - D;
cout << x << endl;
++count;
}
}
| insert | 15 | 15 | 15 | 16 | TLE | |
p03036 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec(11);
int r, D;
cin >> r >> D >> vec.at(0);
for (int i = 0; i < vec.size(); i++) {
vec.at(i + 1) = vec.at(i) * r - D;
cout << vec.at(i + 1) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec(11);
int r, D;
cin >> r >> D >> vec.at(0);
for (int i = 0; i < vec.size() - 1; i++) {
vec.at(i + 1) = vec.at(i) * r - D;
cout << vec.at(i + 1) << endl;
}
}
| replace | 7 | 8 | 7 | 8 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 11) >= this->size() (which is 11)
|
p03036 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D, x0;
cin >> r >> D >> x0;
vector<int> x(10, 0);
x[0] = x0;
for (int i = 0; i < 10 + 1; ++i) {
x[i + 1] = r * x[i] - D;
}
for (int i = 1; i < 10 + 1; ++i) {
cout << x[i] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D, x0;
cin >> r >> D >> x0;
vector<int> x(11, 0);
x[0] = x0;
for (int i = 0; i < 10 + 1; ++i) {
x[i + 1] = r * x[i] - D;
}
for (int i = 1; i < 10 + 1; ++i) {
cout << x[i] << endl;
}
}
| replace | 7 | 8 | 7 | 8 | -6 | malloc(): corrupted top size
|
p03036 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, d;
vector<int> x(10);
cin >> r >> d >> x[0];
for (int i = 1; i < 11; i++) {
x[i] = r * x[i - 1] - d;
cout << x[i] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long r, d;
vector<long long> x(10);
cin >> r >> d >> x[0];
for (int i = 1; i < 11; i++) {
x[i] = r * x[i - 1] - d;
cout << x[i] << endl;
}
} | replace | 3 | 5 | 3 | 5 | 0 | |
p03036 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int r, d;
vector<int> xi(10);
cin >> r >> d >> xi[0];
for (int i = 1; i < 11; i++) {
xi[i] = r * xi[i - 1] - d;
cout << xi[i] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int r, d;
vector<ll> xi(10);
cin >> r >> d >> xi[0];
for (int i = 1; i < 11; i++) {
xi[i] = r * xi[i - 1] - d;
cout << xi[i] << endl;
}
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p03036 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int r, d, X;
int arr[10];
cin >> r >> d >> X;
arr[0] = X;
for (int i = 0; i < 10; i++) {
arr[i + 1] = (r * arr[i]) - d;
}
for (int i = 0; i < 10; i++) {
cout << arr[i + 1] << endl;
}
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int r, d, X;
int arr[11];
cin >> r >> d >> X;
arr[0] = X;
for (int i = 0; i < 10; i++) {
arr[i + 1] = (r * arr[i]) - d;
}
for (int i = 0; i < 10; i++) {
cout << arr[i + 1] << endl;
}
}
| replace | 5 | 6 | 5 | 6 | -6 | *** stack smashing detected ***: terminated
|
p03036 | C++ | Runtime Error | #include "iostream"
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
int xx[11] = {0};
xx[0] = x;
for (int i = 0; i < 11; i++) {
xx[i + 1] = r * xx[i] - d;
cout << xx[i] << endl;
}
} | #include "iostream"
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
int xx[11] = {0};
xx[0] = x;
for (int i = 1; i < 11; i++) {
xx[i] = r * xx[i - 1] - d;
cout << xx[i] << endl;
}
} | replace | 9 | 11 | 9 | 11 | 0 | |
p03036 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int r, d, x[11];
cin >> r >> d >> x[0];
for (int i = 0; i < 11; i++) {
x[i + 1] = r * x[i] - d;
cout << x[i + 1] << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int r, d, x[11];
cin >> r >> d >> x[0];
for (int i = 0; i < 10; i++) {
x[i + 1] = r * x[i] - d;
cout << x[i + 1] << endl;
}
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p03036 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define N 100010
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
vector<int> n(10, 0);
n[0] = x;
for (int i = 1; i <= 10; i++) {
n[i] = r * n[i - 1] - d;
cout << n[i] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define N 100010
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
vector<ll> n(10);
n[0] = x;
for (int i = 1; i <= 10; i++) {
n[i] = r * n[i - 1] - d;
cout << n[i] << endl;
}
return 0;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p03036 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(ll r, ll D, ll x) {
vector<ll> X(11, 0);
X[0] = x;
for (int i = 0; i < X.size(); ++i) {
X[i + 1] = r * X[i] - D;
}
for (int i = 1; i < X.size(); ++i)
cout << X[i] << endl;
}
int main() {
ll r, D, x;
cin >> r >> D >> x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(ll r, ll D, ll x) {
vector<ll> X(11, 0);
X[0] = x;
for (int i = 0; i < X.size() - 1; ++i) {
X[i + 1] = r * X[i] - D;
}
for (int i = 1; i < X.size(); ++i)
cout << X[i] << endl;
}
int main() {
ll r, D, x;
cin >> r >> D ... | replace | 7 | 8 | 7 | 8 | 0 | |
p03036 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int ans[b + 1];
ans[0] = c;
for (int i = 0; i < 10; i++) {
ans[i + 1] = a * ans[i] - b;
cout << ans[i + 1] << endl;
}
return 0;
} | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int ans[11];
ans[0] = c;
for (int i = 0; i < 10; i++) {
ans[i + 1] = a * ans[i] - b;
cout << ans[i + 1] << endl;
}
return 0;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p03036 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vc vector<char>
#define vt vector<string>
#define si set<int>
#define sc set<char>
#define st set<string>
#define pii pair<int, int>
#define fi first
#define se second
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
... | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vc vector<char>
#define vt vector<string>
#define si set<int>
#define sc set<char>
#define st set<string>
#define pii pair<int, int>
#define fi first
#define se second
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
... | replace | 17 | 18 | 17 | 18 | -6 | *** stack smashing detected ***: terminated
|
p03036 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
int main() {
long long int r, d, x[10];
std::cin >> r >> d >> x[0];
for (int i = 1; i <= 10; ++i) {
x[i] = x[i - 1] * r - d;
std::cout << x[i] << std::endl;
}
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
int main() {
long long r, d, x[11];
std::cin >> r >> d >> x[0];
for (int i = 1; i <= 10; ++i) {
x[i] = x[i - 1] * r - d;
std::cout << x[i] << std::endl;
}
} | replace | 8 | 9 | 8 | 9 | 0 | |
p03036 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int r, d, x;
cin >> r >> d >> x;
vector<int> xx(10, x);
for (int i = 0; i < 10; i++) {
xx[i + 1] = r * xx[i] - d;
cout << xx[i + 1] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int r, d, x;
cin >> r >> d >> x;
vector<int> xx(11, x);
for (int i = 0; i < 10; i++) {
xx[i + 1] = r * xx[i] - d;
cout << xx[i + 1] << endl;
}
} | replace | 8 | 9 | 8 | 9 | 0 | |
p03036 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
// ユーティリティ
#define INF 1e9
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
// ユーティリティ
#define INF 1e9
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)... | replace | 191 | 192 | 191 | 192 | TLE | |
p03036 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D, x2000;
cin >> r >> D >> x2000;
vector<int> vec(10);
vec[0] = x2000;
for (int i = 0; i < 10; i++) {
vec[i + 1] = vec[i] * r - D;
cout << vec[i + 1] << endl;
;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D, x2000;
cin >> r >> D >> x2000;
vector<int> vec(12);
vec[0] = x2000;
for (int i = 0; i < 10; i++) {
vec[i + 1] = vec[i] * r - D;
cout << vec[i + 1] << endl;
;
}
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p03036 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int r, d, x;
cin >> r >> d >> x;
V<ll> ans(11);
ans[0] = x;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int r, d, x;
cin >> r >> d >> x;
V<ll> ans(11);
ans[0] = x;
for (int i =... | replace | 18 | 19 | 18 | 19 | 0 | |
p03036 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D;
cin >> r >> D;
vector<int> X;
cin >> X.at(0);
for (int i = 0; i < 10; i++) {
X.at(i + 1) = r * X.at(i) - D;
cout << X.at(i + 1) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D;
cin >> r >> D;
vector<int> X(11);
cin >> X.at(0);
for (int i = 0; i < 10; i++) {
X.at(i + 1) = r * X.at(i) - D;
cout << X.at(i + 1) << endl;
}
return 0;
}
| replace | 5 | 6 | 5 | 6 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03036 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D, x0;
cin >> r >> D >> x0;
vector<int> x(11);
x.at(0) = x0;
for (int i = 0; i <= 10; i++) {
x.at(i + 1) = r * x.at(i) - D;
cout << x.at(i + 1) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D, x0;
cin >> r >> D >> x0;
vector<int> x(11);
x.at(0) = x0;
for (int i = 0; i < 10; i++) {
x.at(i + 1) = r * x.at(i) - D;
cout << x.at(i + 1) << endl;
}
} | replace | 10 | 11 | 10 | 11 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 11) >= this->size() (which is 11)
|
p03036 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | replace | 98 | 99 | 98 | 99 | 0 | |
p03036 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define lli long long int
#include <algorithm>
#include <vector>
int main() {
lli r, d, x, i;
cin >> r >> d >> x;
vector<int> v(10);
v[0] = x;
// cout<<x<<"\n";
for (i = 1; i <= 10; i++) {
v[i] = (r * v[i - 1]) - d;
cout << v[i] << "\n";
}
return 0;
} | #include <iostream>
using namespace std;
#define lli long long int
#include <algorithm>
#include <vector>
int main() {
lli r, d, x, i;
cin >> r >> d >> x;
vector<int> v(11);
v[0] = x;
// cout<<x<<"\n";
for (i = 1; i <= 10; i++) {
v[i] = (r * v[i - 1]) - d;
cout << v[i] << "\n";
}
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p03036 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int r, d, x, arr[2010];
int main() {
cin >> r >> d >> x;
arr[2000] = x;
for (int i = 2001; i <= 2010; i++) {
arr[i] = r * arr[i - 1] - d;
cout << arr[i] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int r, d, x, arr[2011];
int main() {
cin >> r >> d >> x;
arr[2000] = x;
for (int i = 2001; i <= 2010; i++) {
arr[i] = r * arr[i - 1] - d;
cout << arr[i] << endl;
}
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p03037 | C++ | Time Limit Exceeded | #pragma once
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#ifdef _MSC_FULL_VER // デバッグ出力
#define dout cout
#define debug() if (true)
#define check(x) std::co... | #pragma once
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#ifdef _MSC_FULL_VER // デバッグ出力
#define dout cout
#define debug() if (true)
#define check(x) std::co... | replace | 36 | 39 | 36 | 43 | TLE | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define COUT(x) cout << #... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define COUT(x) cout << #... | replace | 33 | 34 | 33 | 34 | 0 | |
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);
for (int i = 0; i < m; i++)
cin >> l.at(i) >> r.at(i);
sort(l.begin(), l.end());
sort(r.begin(), r.end());
int c;
c = l.at(m - 1) - r.at(1) + 1;
if (c < 0)
c = 0;
cout << c << endl... | #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);
sort(l.begin(), l.end());
sort(r.begin(), r.end());
int c;
c = r.at(0) - l.at(m - 1) + 1;
if (c < 0)
c = 0;
cout << c << endl... | replace | 14 | 15 | 14 | 15 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L_max = 1, R_min = N;
int ANS;
vector<int> L;
vector<int> R;
for (int i = 0; i < M; i++) {
cin >> L.at(i) >> R.at(i);
if (L.at(i) > L_max) {
L_max = L.at(i);
}
if (R.at(i) < R_min) {
R_min... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L_max = 1, R_min = N;
int ANS;
vector<int> L(M);
vector<int> R(M);
for (int i = 0; i < M; i++) {
cin >> L.at(i) >> R.at(i);
if (L.at(i) > L_max) {
L_max = L.at(i);
}
if (R.at(i) < R_min) {
... | replace | 8 | 10 | 8 | 10 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> card(N + 1);
for (int i = 0; i < M; i++) {
int L, R;
cin >> L >> R;
card[L]++;
card[R + 1]--;
}
for (int i = 1; i <= N; i++) {
card[i] = card[i] + card[i - 1];
}
int answer = 0;
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> card(N + 1);
for (int i = 0; i < M; i++) {
int L, R;
cin >> L >> R;
card[L]++;
if (R != N) {
card[R + 1]--;
}
}
for (int i = 1; i <= N; i++) {
card[i] = card[i] + card[i - 1];
... | replace | 13 | 14 | 13 | 16 | 0 | |
p03037 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string.h>
#include <string>
using namespace std;
#define MAX_INT 10000
int array_max(int *arr, int M) {
int max = 0;
for (int i = 0; i < M; i++) {
// printf("%d ",arr[i]);
if (max < arr[i]) {
max = arr[i];
}
}
// printf("m... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string.h>
#include <string>
using namespace std;
#define MAX_INT 100000
int array_max(int *arr, int M) {
int max = 0;
for (int i = 0; i < M; i++) {
// printf("%d ",arr[i]);
if (max < arr[i]) {
max = arr[i];
}
}
// printf("... | replace | 8 | 9 | 8 | 9 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int arr[100010];
int main() {
int N, M;
cin >> N >> M;
int l[M], r[M];
for (int i = 0; i < M; i++)
cin >> l[i] >> r[i];
for (int i = 0; i < M; i++) {
arr[l[i]]++;
arr[r[i] + 1]--;
}
for (int i = 1; i < 100010; i++)
arr[i] += arr[i - 1];
... | #include <bits/stdc++.h>
using namespace std;
int arr[100010];
int main() {
int N, M;
cin >> N >> M;
int l[M], r[M];
for (int i = 0; i < M; i++)
cin >> l[i] >> r[i];
for (int i = 0; i < M; i++) {
arr[l[i]]++;
arr[r[i] + 1]--;
}
for (int i = 1; i < 100010; i++)
arr[i] += arr[i - 1];
... | replace | 21 | 22 | 21 | 22 | -11 | |
p03037 | 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> ls, rs;
rep(i, m) cin >> ls[i] >> rs[i];
int l = *max_element(ls.begin(), ls.end());
int r = *min_element(rs.begin(), rs.end());
if (... | #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> ls(m), rs(m);
rep(i, m) cin >> ls[i] >> rs[i];
int l = *max_element(ls.begin(), ls.end());
int r = *min_element(rs.begin(), rs.end());
... | replace | 9 | 10 | 9 | 10 | -11 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, l, r;
cin >> n >> m;
vector<int> imos(n + 1, 0);
for (int i = 0; i < m; ++i) {
cin >> l >> r;
imos[l]++;
imos[r + 1]--;
}
int ans = 0;
for (int i = 1; i < n + 1; ++i) {
imos[... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, l, r;
cin >> n >> m;
vector<int> imos(n + 2, 0);
for (int i = 0; i < m; ++i) {
cin >> l >> r;
imos[l]++;
imos[r + 1]--;
}
int ans = 0;
for (int i = 1; i < n + 1; ++i) {
imos[... | replace | 9 | 10 | 9 | 10 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> v(n + 1);
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
v[l]++;
v[r + 1]--;
}
for (int i = 0; i < n; i++)
v[i + 1] += v[i];
int ans = 0;
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> v(n + 2);
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
v[l]++;
v[r + 1]--;
}
for (int i = 0; i < n; i++)
v[i + 1] += v[i];
int ans = 0;
for (int i = 0; i <... | replace | 7 | 8 | 7 | 8 | 0 | |
p03037 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// 上記が使用不可な環境において
/*
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sin, cos, tan
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#... | #include <bits/stdc++.h>
// 上記が使用不可な環境において
/*
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sin, cos, tan
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#... | replace | 556 | 582 | 556 | 559 | TLE | |
p03037 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> l(m);
vector<ll> r(m);
vector<ll> a(n + 1);
rep(i, m) cin >> l[i] >> r[i];
rep(i, n) a[i] = 0;
rep(i, m) {
for (int j = l[i]; j <= r[i]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> l(m);
vector<ll> r(m);
vector<ll> a(n + 1);
rep(i, m) cin >> l[i] >> r[i];
sort(l.begin(), l.end());
sort(r.begin(), r.end());
if (r[0] <... | replace | 12 | 24 | 12 | 18 | TLE | |
p03037 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using P = pair<int, int>;
typedef long long int ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main()... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using P = pair<int, int>;
typedef long long int ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main()... | replace | 20 | 23 | 20 | 23 | -11 | |
p03037 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M, 0), R(M, 0);
int maxL = 0, minR = 10000001;
for (int i = 0; i < M; i++) {
cin >> L.at(i);
cin >> R.at(i);
maxL = max(maxL, L.at(i));
minR = min(minR, R.at(i));
}
int an... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M, 0), R(M, 0);
int maxL = 0, minR = 10000001;
for (int i = 0; i < M; i++) {
cin >> L.at(i);
cin >> R.at(i);
maxL = max(maxL, L.at(i));
minR = min(minR, R.at(i));
}
int an... | replace | 16 | 26 | 16 | 19 | TLE | |
p03037 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int N, M;
void dump(int max_, int min_) {
cout << "max:" << max_ << " min:" << min_ << endl;
}
int main(int argc, char **argv) {
int i;
cin >> N >> M;
int L[N], R[N];
int min_ = 0, max_ = N;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
if (min... | #include "bits/stdc++.h"
using namespace std;
int N, M;
void dump(int max_, int min_) {
cout << "max:" << max_ << " min:" << min_ << endl;
}
int main(int argc, char **argv) {
int i;
cin >> N >> M;
int L[M], R[M];
int min_ = 0, max_ = N;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
if (min... | replace | 13 | 14 | 13 | 14 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fst first
#define snd second
#define rep(n) for (lint I = 0; (I) < (lint)(n); ++(I))
#define repeat(i, n) for (lint i = 0; (i) < (lint)(n); ++(i))
#define repeat_to(i, n) for (lint i = 0; (i) <= (lint)(n); ++(i))
#define repeat_from(i, m, n) for (lint i = (m); (i) < (lint)(n); ++(i))
#d... | #include <bits/stdc++.h>
#define fst first
#define snd second
#define rep(n) for (lint I = 0; (I) < (lint)(n); ++(I))
#define repeat(i, n) for (lint i = 0; (i) < (lint)(n); ++(i))
#define repeat_to(i, n) for (lint i = 0; (i) <= (lint)(n); ++(i))
#define repeat_from(i, m, n) for (lint i = (m); (i) < (lint)(n); ++(i))
#d... | replace | 32 | 33 | 32 | 33 | 0 | |
p03037 | C++ | Runtime Error | #include "bits/stdc++.h"
// Begin Header {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) x.begin(), x.end()
#define rep(i, n) for (intmax_t i = 0, i##_limit = (n); i < i##_limit; ++i)
#define reps(i, b, e) \
for (intmax_t i = (... | #include "bits/stdc++.h"
// Begin Header {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) x.begin(), x.end()
#define rep(i, n) for (intmax_t i = 0, i##_limit = (n); i < i##_limit; ++i)
#define reps(i, b, e) \
for (intmax_t i = (... | replace | 111 | 112 | 111 | 112 | 0 | |
p03037 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int a, b, c[10000], d[10000], e;
e = 0;
cin >> a >> b;
for (int i = 0; i < b; i++) {
cin >> c[i] >> d[i];
}
sort(c, c + b, greater<int>());
sort(d, d + b);
for (int i = 0; i < 1000000; i++) {
if (c[0... | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int a, b, c[100000], d[100000], e;
e = 0;
cin >> a >> b;
for (int i = 0; i < b; i++) {
cin >> c[i] >> d[i];
}
sort(c, c + b, greater<int>());
sort(d, d + b);
for (int i = 0; i < 1000000; i++) {
if (c... | replace | 5 | 6 | 5 | 6 | 0 | |
p03037 | C++ | Runtime Error | #include <iostream>
#include <math.h>
using namespace std;
int N;
int M;
int L[10020];
int R[10020];
int lmax, rmin;
int ans;
int main() {
cin >> N >> M;
lmax = 0;
rmin = N;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
if (lmax < L[i])
lmax = L[i];
if (rmin > R[i])
rmin = R[i];
... | #include <iostream>
#include <math.h>
using namespace std;
int N;
int M;
int L[100020];
int R[100020];
int lmax, rmin;
int ans;
int main() {
cin >> N >> M;
lmax = 0;
rmin = N;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
if (lmax < L[i])
lmax = L[i];
if (rmin > R[i])
rmin = R[i];
... | replace | 5 | 7 | 5 | 7 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPR(i, a, n) for (int i = a; i > n; --i)
#define RUP(a, b) ((a + b - 1) / (b))
#define SORTG(v) sort(v.begin(), v.end(), greater<>())
#define SORT(v) sort(v.begin(), v.end())
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPR(i, a, n) for (int i = a; i > n; --i)
#define RUP(a, b) ((a + b - 1) / (b))
#define SORTG(v) sort(v.begin(), v.end(), greater<>())
#define SORT(v) sort(v.begin(), v.end())
... | replace | 54 | 55 | 54 | 56 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define MAX 50005
int tree[4 * MAX], arr[MAX], print[MAX];
map<int, int> cnt;
void bld(int n, int b, int e) {
if (b == e) {
// cout << arr[b] << " = " << tree[n] << endl;
cnt[arr[b]] += tree[n];
return;
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define MAX 100005
int tree[4 * MAX], arr[MAX], print[MAX];
map<int, int> cnt;
void bld(int n, int b, int e) {
if (b == e) {
// cout << arr[b] << " = " << tree[n] << endl;
cnt[arr[b]] += tree[n];
return;
}
... | replace | 5 | 6 | 5 | 6 | 0 | |
p03037 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c = 0, N = 0;
cin >> a >> b;
vector<int> L(b), R(b);
for (int i = 0; i < b; i++)
cin >> L[i] >> R[i];
for (int i = L[b - 1]; i < R[0] + 1; i++) {
for (int j = 0; j < b; j++) {
if (L[j] <= i && i <= R[j])
c++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c = 0, N = 0;
cin >> a >> b;
vector<int> L(b), R(b);
for (int i = 0; i < b; i++)
cin >> L[i] >> R[i];
sort(L.begin(), L.end());
sort(R.begin(), R.end());
N = R[0] - L[b - 1] + 1;
if (0 > N)
N = 0;
cout << N << endl;
}
| replace | 8 | 17 | 8 | 13 | TLE | |
p03037 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
const long long INF = 1e9 +... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
const long long INF = 1e9 +... | replace | 25 | 39 | 25 | 32 | TLE | |
p03037 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
/*struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x% mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint& operator+=(const min... | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
/*struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x% mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint& operator+=(const min... | replace | 42 | 44 | 42 | 44 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | replace | 42 | 43 | 42 | 43 | 0 | |
p03037 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define INF INT_MAX
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L[N], R[N];
for (int i ... | #include <algorithm>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define INF INT_MAX
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L[N], R[N];
for (int i ... | replace | 19 | 20 | 19 | 22 | 0 | |
p03037 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long n, m;
cin >> n >> m;
long l[m];
long r[m];
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
long sei = 0;
for (long i = 1; i <= n; i++) {
int aho = 1;
... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long n, m;
cin >> n >> m;
long l[m];
long r[m];
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
sort(l, l + m);
sort(r, r + m);
int hidari = l[m - 1];
int migi... | replace | 16 | 31 | 16 | 25 | TLE | |
p03037 | Python | Time Limit Exceeded | #!/usr/bin/env python3
import sys
N, M = map(int, input().rstrip().split())
L = []
R = []
for _ in range(M):
l, r = map(int, input().rstrip().split())
L.append(l)
R.append(r)
Ans = set(range(L[0], R[0] + 1))
for i in range(1, len(L)):
Ans = set(range(L[i], R[i] + 1)) & Ans
if not Ans:
pri... | #!/usr/bin/env python3
import sys
N, M = map(int, input().rstrip().split())
L = []
R = []
for _ in range(M):
l, r = map(int, input().rstrip().split())
L.append(l)
R.append(r)
Ans = min(R) - max(L) + 1
if Ans < 0:
Ans = 0
print(Ans)
| replace | 12 | 20 | 12 | 16 | TLE | |
p03037 | Python | Time Limit Exceeded | n, m = map(int, input().split())
ans = set(range(1, n + 1))
for _ in range(m):
l, r = map(int, input().split())
st = set(range(l, r + 1))
ans &= st
print(len(ans))
| def solve2():
n, m = map(int, input().split())
L = 1
R = n
for _ in range(m):
l, r = map(int, input().split())
L = max(L, l)
R = min(R, r)
if L <= R:
print(R - L + 1)
else:
print(0)
solve2()
| replace | 0 | 7 | 0 | 15 | TLE | |
p03037 | Python | Time Limit Exceeded | N, M = map(int, input().split())
L = [0] * M
R = [0] * M
count = 0
for i in range(M):
L[i], R[i] = map(int, input().split())
for i in range(N):
clear = 0
for j in range(M):
if L[j] <= i + 1 <= R[j]:
clear += 1
else:
break
if clear == M:
count += 1
print(co... | N, M = map(int, input().split())
L = [0] * M
R = [0] * M
count = 0
for i in range(M):
L[i], R[i] = map(int, input().split())
Lmax = max(L)
Rmin = min(R)
if Lmax <= Rmin:
print(Rmin - Lmax + 1)
else:
print(0)
| replace | 6 | 16 | 6 | 12 | TLE | |
p03037 | Python | Time Limit Exceeded | n, m = map(int, input().split())
lr = [list(map(int, input().split())) for _ in range(m)]
ans = []
for i in range(m):
res = []
for j in range(lr[i][0], lr[i][1] + 1):
res.append(j)
if i == 0:
ans = set(res)
else:
ans = set(ans) & set(res)
print(len(ans))
| n, m = map(int, input().split())
mi, ma = 1, n
for _ in range(m):
l, r = map(int, input().split())
mi = max(l, mi)
ma = min(r, ma)
print(max(0, ma - mi + 1))
| replace | 1 | 12 | 1 | 7 | TLE | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> l(n), r(n);
int maxl = 0, minr = n + 1;
rep(i, m) cin >> l.at(i) >> r.at(i);
rep(i, m) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
int maxl = 1, minr = n + 1;
rep(i, m) cin >> l.at(i) >> r.at(i);
rep(i, m) {
... | replace | 11 | 13 | 11 | 13 | 0 | |
p03037 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (b); --i)
#define ALL(obj) (obj).begin, (obj).end(... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (b); --i)
#define ALL(obj) (obj).begin, (obj).end(... | replace | 19 | 20 | 19 | 20 | 0 | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int> vint;
typedef vector<ll> vll;
template <typename T> istream &operator>>(istream &is, ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int> vint;
typedef vector<ll> vll;
template <typename T> istream &operator>>(istream &is, ... | replace | 18 | 20 | 18 | 20 | 0 | |
p03037 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define r... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define r... | replace | 24 | 31 | 24 | 30 | TLE | |
p03037 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
signed main() {
int n, m;
cin >> n >> m;
vector<int> l(n), r(n);
rep(i, m) cin >> l[i] >> r[i];
int mnr = n, mxl = 1;
rep(i, m) {
mxl = max(mxl, l[i]);
mnr = min(mnr, r[i]);
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
signed main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
int mnr = n, mxl = 1;
rep(i, m) {
mxl = max(mxl, l[i]);
mnr = min(mnr, r[i]);
}... | replace | 8 | 9 | 8 | 9 | 0 | |
p03037 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m);
vector<int> r(m);
rep(i, m) cin >> l[i] >> r[i];
int cnt = 0;
rep(i, n + 1) {
bool ok = true;
rep(j, m) {
if (!(i >= l[j] && i <= r[j]))
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m);
vector<int> r(m);
rep(i, m) cin >> l[i] >> r[i];
int L = *max_element(l.begin(), l.end());
int R = *min_element(r.begin(), r.end());
int ans = R - L + 1;... | replace | 9 | 20 | 9 | 17 | TLE | |
p03037 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdlib.h>
#include <string>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> v(n + 1, 0);
for (size_t i = 0; i < m; i++) {
int a, b;
std::cin >> a >> b;
v[a]++;
v[b + 1]--;
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdlib.h>
#include <string>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> v(n + 1, 0);
for (size_t i = 0; i < m; i++) {
int a, b;
std::cin >> a >> b;
a--;
b--;
v[a]+... | insert | 20 | 20 | 20 | 23 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.