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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> job(m);
rep(i, n) {
int a, b;
cin >> a >> b;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> job(m);
rep(i, n) {
int a, b;
cin >> a >> b;
... | insert | 15 | 15 | 15 | 17 | 0 | |
p02948 | C++ | Time Limit Exceeded | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数&関数 ===========... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数&関数 ===========... | insert | 443 | 443 | 443 | 445 | TLE | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> W(M);
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
W[M - A].push_back(B);
}
int ans = 0;
priority_queue<int> pq;
for (int i = M - 1; i >= 0; i--) {
for (int j : W[i]) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> W(M);
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
if (M - A >= 0) {
W[M - A].push_back(B);
}
}
int ans = 0;
priority_queue<int> pq;
for (int i = M - 1; i >= 0; i--) {
... | replace | 9 | 10 | 9 | 12 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
int N, M;
cin >> N >> M;
using P = pair<int, int>;
priority_queue<P> Q;
vector<int> v[100000];
for (int i = 0; i < N; i++) {
int a, b... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
int N, M;
cin >> N >> M;
using P = pair<int, int>;
priority_queue<P> Q;
vector<int> v[100010];
for (int i = 0; i < N; i++) {
int a, b... | replace | 15 | 16 | 15 | 16 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int M = 100005;
int n, m;
struct node {
int yc, val;
} A[M];
bool comp(node a, node b) { return a.val > b.val; }
bool mark[M];
set<int> s;
set<int>::iterator it;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d%d", &A[i].yc, &A[i].v... | #include <bits/stdc++.h>
using namespace std;
const int M = 100005;
int n, m;
struct node {
int yc, val;
} A[M];
bool comp(node a, node b) { return a.val > b.val; }
bool mark[M];
set<int> s;
set<int>::iterator it;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d%d", &A[i].yc, &A[i].v... | replace | 27 | 28 | 27 | 28 | 0 | |
p02948 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define MP make_pair // pairのコンストラクタ
... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define MP make_pair // pairのコンストラクタ
... | replace | 47 | 48 | 47 | 50 | TLE | |
p02948 | C++ | Time Limit Exceeded | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> jobs(m);
// 二次元配列に詰め込む
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (a > m)
continue;
jobs[m - a].push_back(b);
}
... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> jobs(m);
// 二次元配列に詰め込む
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (a > m)
continue;
jobs[m - a].push_back(b);
}
... | replace | 24 | 25 | 24 | 26 | TLE | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, N) for (ll i = 0; i < (N); ++i)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000007
#define PB push_back
#define MP make_pair
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
//++時計回り --反時計回り
// int dx[4] = {1, 0, -1, 0};
/... | #include <bits/stdc++.h>
#define REP(i, N) for (ll i = 0; i < (N); ++i)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000007
#define PB push_back
#define MP make_pair
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
//++時計回り --反時計回り
// int dx[4] = {1, 0, -1, 0};
/... | replace | 17 | 18 | 17 | 18 | 0 | |
p02948 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, m, a, b, ans = 0;
cin >> n >> m;
priority_queue<int> que;
vector<int> v[100000];
for (int i = 0; i < n; i++) {
cin >> a >> b;
v[a].push_back(b);
}
for (int i = 1; i <... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, m, a, b, ans = 0;
cin >> n >> m;
priority_queue<int> que;
vector<int> v[100005];
for (int i = 0; i < n; i++) {
cin >> a >> b;
v[a].push_back(b);
}
for (int i = 1; i <... | replace | 10 | 11 | 10 | 11 | 0 | |
p02948 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <utility>
using namespace std;
int n, m, a, b;
pair<int, int> p[100000];
priority_queue<int> que;
int ans;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a >> b, p[i] = make_pair(a, b);
sort(p, p + n);
int x = 0;
for (int i... | #include <algorithm>
#include <iostream>
#include <queue>
#include <utility>
using namespace std;
int n, m, a, b;
pair<int, int> p[100000];
priority_queue<int> que;
int ans;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a >> b, p[i] = make_pair(a, b);
sort(p, p + n);
int x = 0;
for (int i... | replace | 16 | 17 | 16 | 17 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
const int maxn = (int)1e6 + 6;
using namespace std;
signed main() {
priority_queue<int> pq;
int n, m, sum = 0;
cin >> n >> m;
vector<int> vec[n];
for (int i = 0; i < n; i++) {
int days, score;
cin >> days >> score;
vec[days].push_back(score);
}
fo... | #include <bits/stdc++.h>
#define int long long
const int maxn = (int)1e6 + 6;
using namespace std;
signed main() {
priority_queue<int> pq;
int n, m, sum = 0;
cin >> n >> m;
vector<int> vec[maxn];
for (int i = 0; i < n; i++) {
int days, score;
cin >> days >> score;
vec[days].push_back(score);
}
... | replace | 8 | 9 | 8 | 9 | -11 | |
p02948 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
typedef long long ll;
int main() {
int N, M;
std::cin >> N >> M;
int A, B;
std::vector<std::vector<int>> AB(M);
for (int i = 0; i < N; ++i) {
std::cin >> A >> B;
AB[M - A].push_back(B);
}
ll ans = 0;
std::priority_que... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
typedef long long ll;
int main() {
int N, M;
std::cin >> N >> M;
int A, B;
std::vector<std::vector<int>> AB(M);
for (int i = 0; i < N; ++i) {
std::cin >> A >> B;
if (A > M)
continue;
AB[M - A].push_back(B);
}
... | insert | 14 | 14 | 14 | 16 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, x, y, p = 0, i, k, j;
cin >> n >> m;
vector<int> v[m];
for (i = 0; i < n; i++) {
cin >> x >> y;
if (x <= m) {
v[x].push_back(y);
}
}
priority_queue<int> pq;
for (i = 1; i <= m; i++) {
for (j = 0; j < v[i].size(); ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, x, y, p = 0, i, k, j;
cin >> n >> m;
vector<int> v[m + 1];
for (i = 0; i < n; i++) {
cin >> x >> y;
if (x <= m) {
v[x].push_back(y);
}
}
priority_queue<int> pq;
for (i = 1; i <= m; i++) {
for (j = 0; j < v[i].size... | replace | 6 | 7 | 6 | 7 | -11 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, x, y, p = 0, i, k, j;
cin >> n >> m;
vector<int> v[n + 1];
for (i = 0; i < n; i++) {
cin >> x >> y;
if (x <= m) {
v[x].push_back(y);
}
}
priority_queue<int> pq;
for (i = 1; i <= m; i++) {
for (j = 0; j < v[i].size... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, x, y, p = 0, i, k, j;
cin >> n >> m;
vector<int> v[m + 1];
for (i = 0; i < n; i++) {
cin >> x >> y;
if (x <= m) {
v[x].push_back(y);
}
}
priority_queue<int> pq;
for (i = 1; i <= m; i++) {
for (j = 0; j < v[i].size... | replace | 6 | 7 | 6 | 7 | -11 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, M;
cin >> N >> M;
Graph G(M);
rep(i, N) {
int A, B;
cin >> A >> B;
A--;
G[A].push_back(B);
}
ll sum = 0;
priority_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, M;
cin >> N >> M;
Graph G(M);
rep(i, N) {
int A, B;
cin >> A >> B;
if (A <= M) {
A--;
G[A].push_back(B);
}
... | replace | 13 | 15 | 13 | 17 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ID... | #include <bits/stdc++.h>
using namespace std;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ID... | replace | 34 | 35 | 34 | 35 | 0 | |
p02948 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0... | replace | 58 | 59 | 58 | 60 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
#define u_b upper_bound
#define l_b lower_bound
int N, M;
pii AB[100100];
signed main() {
cin >> N >> M;
rep(i, N) { cin >> AB[i].first >> AB[i... | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
#define u_b upper_bound
#define l_b lower_bound
int N, M;
pii AB[100100];
signed main() {
cin >> N >> M;
rep(i, N) { cin >> AB[i].first >> AB[i... | replace | 22 | 23 | 22 | 23 | -11 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, m, a, b;
vector<pair<int, int>> p;
priority_queue<int> q;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a >> b;
p.push_back(make_pair(a, b));
}
sort(p.begin(), p.end());
auto itr = p.begin();
ll ans ... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, m, a, b;
vector<pair<int, int>> p;
priority_queue<int> q;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a >> b;
p.push_back(make_pair(a, b));
}
sort(p.begin(), p.end());
auto itr = p.begin();
ll ans ... | replace | 17 | 18 | 17 | 18 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 510;
typedef long long ll;
typedef pair<int, int> P;
P a[maxn];
priority_queue<int> q;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
ll ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
typedef long long ll;
typedef pair<int, int> P;
P a[maxn];
priority_queue<int> q;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
ll ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a... | replace | 4 | 5 | 4 | 5 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> jobs(m);
rep(i, n) {
int a, b;
cin >> a >> b;
jobs[m - a].push_b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> jobs(m);
rep(i, n) {
int a, b;
cin >> a >> b;
if (a > m)
c... | insert | 14 | 14 | 14 | 16 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<int> work[m + 1];
rep(i, n) {
int a, b;
cin >> a >> b;
if (m + 1 < a)
continue;
work[a].push_back(b);
}
priority_queue<int> ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<int> work[m + 2];
rep(i, n) {
int a, b;
cin >> a >> b;
if (m + 1 < a)
continue;
work[a].push_back(b);
}
priority_queue<int> ... | replace | 8 | 9 | 8 | 9 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> jobs(m + 1);
int a, b;
rep(i, n) {
cin >> a >> b;
jobs[m - a].push_back(b);
}
ll ans = 0;
pri... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> jobs(m + 1);
int a, b;
rep(i, n) {
cin >> a >> b;
if (a > m)
continue;
jobs[m - a].push_b... | insert | 13 | 13 | 13 | 15 | 0 | |
p02948 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | insert | 78 | 78 | 78 | 80 | 0 | |
p02948 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#def... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#def... | insert | 64 | 64 | 64 | 66 | 0 | |
p02948 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string.h>
using namespace std;
using pii = pair<int, int>;
const int N = 1e5 + 1;
pii arr[N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i)
scanf("%d%d", &(arr[i].first), &(arr[i].second));
so... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string.h>
using namespace std;
using pii = pair<int, int>;
const int N = 1e5 + 1;
pii arr[N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i)
scanf("%d%d", &(arr[i].first), &(arr[i].second));
so... | replace | 21 | 23 | 21 | 25 | -11 | |
p02948 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>()... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>()... | replace | 45 | 49 | 45 | 49 | TLE | |
p02948 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, m, a, b;
cin >> n >> m;
vector<int> v[m + 9];
int mx[m + 9];
for (int i = 0; i < n; i++) {
cin >> a >> b;
v[a].push_back(b);
}
long long cnt = 0;
priority_queue<long long> Q;
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, m, a, b;
cin >> n >> m;
vector<int> v[100009];
for (int i = 0; i < n; i++) {
cin >> a >> b;
v[a].push_back(b);
}
long long cnt = 0;
priority_queue<long long> Q;
for (int i = 1; ... | replace | 10 | 12 | 10 | 11 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> job(m + 1);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
job[a].push_back(b);
}
int ans = 0;
priority_queue<int, vector<int>, less<int>> work;
for (int i = 1; i <= m; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> job(100001);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
job[a].push_back(b);
}
int ans = 0;
priority_queue<int, vector<int>, less<int>> work;
for (int i = 1; i <= m; i++) {
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace ::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream &operator>>(istream &I, vector<T> &v) {
for (T &e : v)
I >> e;
return I;
}
template <class T> ostream &operator<<(ostream &... | #include <bits/stdc++.h>
using namespace ::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream &operator>>(istream &I, vector<T> &v) {
for (T &e : v)
I >> e;
return I;
}
template <class T> ostream &operator<<(ostream &... | replace | 30 | 31 | 30 | 32 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
#define REP(i, a, b) for (int i = int(a); i < int(b); ++i)
#define INF 10000000
using ll = long long;
using itn = int;
using namespace std;
using Graph = vector<vector<int>>;
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int main() {
... | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
#define REP(i, a, b) for (int i = int(a); i < int(b); ++i)
#define INF 10000000
using ll = long long;
using itn = int;
using namespace std;
using Graph = vector<vector<int>>;
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int main() {
... | replace | 12 | 13 | 12 | 13 | 0 | |
p02948 | C++ | Runtime Error | /***"In the name of Allah(swt), the most gracious, most merciful. Allah(swt)
* blesses with knowledge whom he wants."***/
/*Header file starts here*/
// #include<bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cs... | /***"In the name of Allah(swt), the most gracious, most merciful. Allah(swt)
* blesses with knowledge whom he wants."***/
/*Header file starts here*/
// #include<bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cs... | insert | 147 | 147 | 147 | 149 | 0 | |
p02948 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001;
... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001;
... | replace | 35 | 36 | 35 | 37 | 0 | |
p02948 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <queue>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define FORL(i, x) for (int i = head[x]; i; i = nxt[i])
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) int((a).size())
#define EA... | #include <bits/stdc++.h>
#include <queue>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define FORL(i, x) for (int i = head[x]; i; i = nxt[i])
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) int((a).size())
#define EA... | replace | 55 | 56 | 55 | 56 | TLE | |
p02948 | C++ | Runtime Error | #include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define dre... | #include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define dre... | replace | 32 | 33 | 32 | 33 | 0 | |
p02948 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <set>
using namespace std;
struct jb {
int a, b;
friend bool operator<(jb x, jb y) { return x.a > y.a; };
} g[100010];
int n, m, k, l, ans = 0, f[100010];
set<int> s;
_Rb_tree_const_iterator<int> p;
int mx(int x, int y) { return x > y ? x : y; }
int... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <set>
using namespace std;
struct jb {
int a, b;
friend bool operator<(jb x, jb y) { return x.a > y.a; };
} g[100010];
int n, m, k, l, ans = 0, f[100010];
set<int> s;
_Rb_tree_const_iterator<int> p;
int mx(int x, int y) { return x > y ? x : y; }
int... | replace | 37 | 38 | 37 | 38 | TLE | |
p02948 | C++ | Runtime Error | #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<pair<int, int>> A(N);
rep(i, N) {
cin >> A[i].first;
cin >> A[i].second;
}
sort(A.begin(), A.end());
long long ans = 0;
int j = 0;
priority_queue<int> B;
... | #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<pair<int, int>> A(N);
rep(i, N) {
cin >> A[i].first;
cin >> A[i].second;
}
sort(A.begin(), A.end());
long long ans = 0;
int j = 0;
priority_queue<int> B;
... | replace | 23 | 24 | 23 | 24 | -6 | double free or corruption (out)
|
p02948 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define REP(i, a) for (int i = 0; i < (a); i++)
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using Graph = vector<vector<int>>;
/*第二引数で第一引数を割ったときの切り上げの計算*/
long long int maxtime(long long... | #include "bits/stdc++.h"
using namespace std;
#define REP(i, a) for (int i = 0; i < (a); i++)
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using Graph = vector<vector<int>>;
/*第二引数で第一引数を割ったときの切り上げの計算*/
long long int maxtime(long long... | replace | 40 | 41 | 40 | 41 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> w(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
w.at(i) = make_pair(a, b);
}
sort(w.begin(), w.end());
int index = 0;
priority_queue<int> q;
int ans = 0;
for (int i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> w(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
w.at(i) = make_pair(a, b);
}
sort(w.begin(), w.end());
int index = 0;
priority_queue<int> q;
int ans = 0;
for (int i ... | insert | 22 | 22 | 22 | 24 | -11 | |
p02948 | C++ | Runtime Error | /**Bismillahir Rahmanir Rahim.**/
#include <bits/stdc++.h>
using namespace std;
#define ln '\n'
#define pf printf
#define sf scanf
#define inp(x) scanf("%lld", &x)
#define D(x) cout << #x " = " << x << endl
#define dbg(x) cerr << #x << " = " << x << endl;
#define dbg2(x, y) cerr << #x << " = " << x << ", " << #y << " =... | /**Bismillahir Rahmanir Rahim.**/
#include <bits/stdc++.h>
using namespace std;
#define ln '\n'
#define pf printf
#define sf scanf
#define inp(x) scanf("%lld", &x)
#define D(x) cout << #x " = " << x << endl
#define dbg(x) cerr << #x << " = " << x << endl;
#define dbg2(x, y) cerr << #x << " = " << x << ", " << #y << " =... | replace | 177 | 178 | 177 | 178 | -11 | |
p02948 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9;
const ll mod = 1e9 + 7;
typedef pair<int, int> P;
typedef pair<pair<int, int>, pair<int, int>> PP;
#define rep(i, N) for (int i = 0; i < N; i++)
int main() {
int n, m;
cin >> n >> m;
int a[n], b[n];
vector<P> p(n);
priori... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9;
const ll mod = 1e9 + 7;
typedef pair<int, int> P;
typedef pair<pair<int, int>, pair<int, int>> PP;
#define rep(i, N) for (int i = 0; i < N; i++)
int main() {
int n, m;
cin >> n >> m;
int a[n], b[n];
vector<P> p(n);
priori... | replace | 26 | 31 | 26 | 31 | TLE | |
p02948 | C++ | Runtime Error | #include <iostream>
#include <queue>
using namespace std;
priority_queue<int> q;
vector<vector<int>> jobs;
int main(void) {
int n, m;
cin >> n >> m;
jobs = vector<vector<int>>(m + 1);
for (int a = 0; a < n; a = a + 1) {
int ai, bi;
cin >> ai >> bi;
jobs[ai].push_back(bi);
}
int ans = 0;
... | #include <iostream>
#include <queue>
using namespace std;
priority_queue<int> q;
vector<vector<int>> jobs;
int main(void) {
int n, m;
cin >> n >> m;
jobs = vector<vector<int>>(100001);
for (int a = 0; a < n; a = a + 1) {
int ai, bi;
cin >> ai >> bi;
jobs[ai].push_back(bi);
}
int ans = 0;
... | replace | 12 | 13 | 12 | 13 | 0 | |
p02948 | C++ | Runtime Error | /*
Warn - Don't change next line else you will get WA verdict. Online Judge is
configured to give WA if next line is not present. "An ideal problem has no
test data." Author - Aryan Choudhary (@aryanc403)
*/
#pragma warning(disable : 4996)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")... | /*
Warn - Don't change next line else you will get WA verdict. Online Judge is
configured to give WA if next line is not present. "An ideal problem has no
test data." Author - Aryan Choudhary (@aryanc403)
*/
#pragma warning(disable : 4996)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")... | insert | 146 | 146 | 146 | 148 | 0 | Time Taken : 0.000136
|
p02948 | C++ | Runtime Error | /*やったぜ。 投稿者：変態糞土方 (8月16日（水）07時14分22秒)
昨日の8月15日にいつもの浮浪者のおっさん（60歳）と先日メールくれた汚れ好きの土方のにいちゃん
（45歳）とわし（53歳）の3人で県北にある川の土手の下で盛りあったぜ。
今日は明日が休みなんでコンビニで酒とつまみを買ってから滅多に人が来ない所なんで、
そこでしこたま酒を飲んでからやりはじめたんや。
3人でちんぽ舐めあいながら地下足袋だけになり持って来たいちぢく浣腸を3本ずつ入れあった。
しばらくしたら、けつの穴がひくひくして来るし、糞が出口を求めて腹の中でぐるぐるしている。
浮浪者のおっさんにけつの穴をなめさせながら、兄ちゃんのけつの穴を舐め... | /*やったぜ。 投稿者：変態糞土方 (8月16日（水）07時14分22秒)
昨日の8月15日にいつもの浮浪者のおっさん（60歳）と先日メールくれた汚れ好きの土方のにいちゃん
（45歳）とわし（53歳）の3人で県北にある川の土手の下で盛りあったぜ。
今日は明日が休みなんでコンビニで酒とつまみを買ってから滅多に人が来ない所なんで、
そこでしこたま酒を飲んでからやりはじめたんや。
3人でちんぽ舐めあいながら地下足袋だけになり持って来たいちぢく浣腸を3本ずつ入れあった。
しばらくしたら、けつの穴がひくひくして来るし、糞が出口を求めて腹の中でぐるぐるしている。
浮浪者のおっさんにけつの穴をなめさせながら、兄ちゃんのけつの穴を舐め... | replace | 172 | 173 | 172 | 173 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// マクロ
// forループ関係
// 引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// マクロ
// forループ関係
// 引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for... | replace | 33 | 34 | 33 | 34 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef int ll;
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define len(v) ((int)v.size())
#define all(v) v.begin(), v.end()
#define os... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef int ll;
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define len(v) ((int)v.size())
#define all(v) v.begin(), v.end()
#define os... | replace | 35 | 36 | 35 | 36 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02948 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
... | replace | 61 | 62 | 61 | 62 | -11 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | replace | 33 | 35 | 33 | 37 | -11 | |
p02948 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>
#define ll long long
#define il inline
#define rgi register int
using namespace std;
const int oo = 0x3f3f3f3f;
const int N = 100000 + 10;
int n, m, ans;
int a[N];
struct GIVE {
int a, b;
} p[N];
struct Seg_Tree {
int lc, rc;
ll add,... | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>
#define ll long long
#define il inline
#define rgi register int
using namespace std;
const int oo = 0x3f3f3f3f;
const int N = 100000 + 10;
int n, m, ans;
int a[N];
struct GIVE {
int a, b;
} p[N];
struct Seg_Tree {
int lc, rc;
ll add,... | insert | 104 | 104 | 104 | 106 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + 10;
int a[N], b[N], v[N];
typedef pair<int, int> pa;
vector<int> dead[N];
int main() {
int n, m;
cin >> n >> m;
multiset<int> st;
m++;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
dead[m - a[i]].push_back(b[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + 10;
int a[N], b[N], v[N];
typedef pair<int, int> pa;
vector<int> dead[N];
int main() {
int n, m;
cin >> n >> m;
multiset<int> st;
m++;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
if (m - a[i] <= 0)
co... | insert | 15 | 15 | 15 | 17 | 0 | |
p02948 | C++ | Runtime Error | // D - Summer Vacation
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> a(m);
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
a[x - 1].push_back(y);
}
priority_que... | // D - Summer Vacation
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> a(m);
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
if (x <= m)
a[x - 1].push_back(y);
... | replace | 15 | 16 | 15 | 17 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 5e5 + 5;
inline int read() {
char c = getchar();
int t = 0, f = 1;
while (!isdigit(c)) {
if (c == '-')
f = -1;
c = getchar();
}
while (isdigit(c)) {
t = (t << 3) + (t << 1) + (c ^ 48);
c = getchar();
}... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 5e5 + 5;
inline int read() {
char c = getchar();
int t = 0, f = 1;
while (!isdigit(c)) {
if (c == '-')
f = -1;
c = getchar();
}
while (isdigit(c)) {
t = (t << 3) + (t << 1) + (c ^ 48);
c = getchar();
}... | insert | 33 | 33 | 33 | 35 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vout(x) rep(i, x.size()) cout << x[i] << " "
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vout(x) rep(i, x.size()) cout << x[i] << " "
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a =... | insert | 38 | 38 | 38 | 40 | 0 | |
p02948 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
const int maxn = 110000;
const int mod = 1000000007;
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
const int maxn = 110000;
const int mod = 1000000007;
using namespac... | replace | 34 | 35 | 34 | 35 | 0 | |
p02948 | C++ | Runtime Error | #include <iostream>
#include <queue>
#include <vector>
int main() {
unsigned int N, M;
std::cin >> N >> M;
std::vector<std::vector<unsigned int>> day_jobs(100000);
for (unsigned int i = 0; i < N; ++i) {
unsigned int a, b;
std::cin >> a >> b;
day_jobs.at(a).push_back(b);
}
std::priority_queue<... | #include <iostream>
#include <queue>
#include <vector>
int main() {
unsigned int N, M;
std::cin >> N >> M;
std::vector<std::vector<unsigned int>> day_jobs(100000 + 5);
for (unsigned int i = 0; i < N; ++i) {
unsigned int a, b;
std::cin >> a >> b;
day_jobs.at(a).push_back(b);
}
std::priority_qu... | replace | 8 | 9 | 8 | 9 | 0 | |
p02948 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
vector<long long> vp[230000];
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "rt", stdin);
freopen("output.txt", "wt", stdout);
#endif
long long n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
long long x, y;
cin >> x >> y;
vp[x].push_back(... | #include <bits/stdc++.h>
using namespace std;
vector<long long> vp[230000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
long long x, y;
cin >> x >> y;
vp[x].push_back(y);
}
long long ans = 0;
pr... | replace | 5 | 9 | 5 | 8 | TLE | |
p02948 | C++ | Runtime Error | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
long long n, m, ans = 0;
cin >> n >> m;
long long a[n], b[n];
vector<long long> v[10005];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
... | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
long long n, m, ans = 0;
cin >> n >> m;
long long a[n], b[n];
vector<long long> v[100005];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];... | replace | 13 | 14 | 13 | 14 | 0 | |
p02948 | C++ | Runtime Error | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, m, i, a, b, ans = 0;
priority_queue<int> q;
cin >> n >> m;
vector<vector<int>> v(m);
for (i = 0; i < n; ++i) {
cin >> a >> b;
--a;
v.at(a).push_back(b);
}
for (i = 0; i < m; ++i) {
for (auto e ... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, m, i, a, b, ans = 0;
priority_queue<int> q;
cin >> n >> m;
vector<vector<int>> v(100000);
for (i = 0; i < n; ++i) {
cin >> a >> b;
--a;
v.at(a).push_back(b);
}
for (i = 0; i < m; ++i) {
for (au... | replace | 9 | 10 | 9 | 10 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct node {
int a, b;
} p[100001];
bool cmp(node a, node b) { return a.a > b.a; }
int f[100001];
int getfa(int x) { return x == f[x] ? f[x] : f[x] = getfa(f[x]); }
int main() {
int n, m;
int ans = 0;
cin >> n >> m;
for (int i = 1; i <= n; i++)
scanf("%d%d", ... | #include <bits/stdc++.h>
using namespace std;
struct node {
int a, b;
} p[100001];
bool cmp(node a, node b) { return a.a > b.a; }
int f[100001];
int getfa(int x) { return x == f[x] ? f[x] : f[x] = getfa(f[x]); }
int main() {
int n, m;
int ans = 0;
cin >> n >> m;
for (int i = 1; i <= n; i++)
scanf("%d%d", ... | insert | 18 | 18 | 18 | 20 | 0 | |
p02948 | C++ | Runtime Error | //============================================================================
// Falling Down is an accident, Staying Down is a Choice.
// Author : Murad
// Online Judge: Codeforces.cpp & Atcoder.cpp
// Description : Problem name
//============================================================================
#inc... | //============================================================================
// Falling Down is an accident, Staying Down is a Choice.
// Author : Murad
// Online Judge: Codeforces.cpp & Atcoder.cpp
// Description : Problem name
//============================================================================
#inc... | replace | 130 | 136 | 130 | 149 | -11 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define sc second
#define ALL(x) x.begin(), x.end()
#define RALL(X) x.begin(), x.end()
#define FOR(i, n, k) for (i = 0; i < n; i += k)
#define FO(i, n, k) for (i = 1; i <= n; i += k)
#define CLEAR(a, b) memset... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define sc second
#define ALL(x) x.begin(), x.end()
#define RALL(X) x.begin(), x.end()
#define FOR(i, n, k) for (i = 0; i < n; i += k)
#define FO(i, n, k) for (i = 1; i <= n; i += k)
#define CLEAR(a, b) memset... | replace | 25 | 26 | 25 | 26 | -6 | malloc(): corrupted top size
|
p02948 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <memory>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define ll long long
using namespace std;
int main(int argc, char const *argv[]) {
ll n, m;
cin >> n >> m;
ve... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <memory>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define ll long long
using namespace std;
int main(int argc, char const *argv[]) {
ll n, m;
cin >> n >> m;
ve... | replace | 19 | 20 | 19 | 20 | 0 | |
p02948 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> v(N);
priority_queue<int> pq;
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
v[i] = make_pair(A, B);
}
int ans = 0;
int j = 0;
sort(v.begin(), v.end())... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> v(N);
priority_queue<int> pq;
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
v[i] = make_pair(A, B);
}
int ans = 0;
int j = 0;
sort(v.begin(), v.end... | replace | 0 | 1 | 0 | 1 | TLE | |
p02948 | C++ | Runtime Error | #pragma GCC optimize "03"
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS \
ios::sync_with_stdio(false); ... | #pragma GCC optimize "03"
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS \
ios::sync_with_stdio(false); ... | replace | 36 | 37 | 36 | 38 | 0 | |
p02948 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX_A = 1e5 + 1;
int N, M;
void solve() {
cin >> N >> M;
vector<P> jobs(N);
for (int i = 0; i < N; ++i) {
int a, b;
cin >> a >> b;
jobs[i] = P(a, b);
}
sort(jobs.begin(), jobs.end());
ll ans ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX_A = 1e5 + 1;
int N, M;
void solve() {
cin >> N >> M;
vector<P> jobs(N);
for (int i = 0; i < N; ++i) {
int a, b;
cin >> a >> b;
jobs[i] = P(a, b);
}
sort(jobs.begin(), jobs.end());
ll ans ... | insert | 25 | 25 | 25 | 28 | TLE | |
p02948 | C++ | Runtime Error | /*******************************
Author:galaxy yr
LANG:C++
Created Time:2019/08/10 20:04:35
*******************************/
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
const int maxn = 1e5 + 10;
int n, m, _time, _end, f[maxn];
long long ans;
struct Node {
int a, b;
bool operator... | /*******************************
Author:galaxy yr
LANG:C++
Created Time:2019/08/10 20:04:35
*******************************/
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
const int maxn = 1e5 + 10;
int n, m, _time, _end, f[maxn];
long long ans;
struct Node {
int a, b;
bool operator... | insert | 32 | 32 | 32 | 34 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> tasks(m + 1, vector<int>(0));
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
tasks.at(a).push_back(b);
}
int answer = 0;
priority_queue<int> q;
for (int i = 1; i < m + 1; i++)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> tasks(m + 1, vector<int>(0));
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (a < m + 1) {
tasks.at(a).push_back(b);
}
}
int answer = 0;
priority_queue<int> q;
f... | replace | 11 | 12 | 11 | 15 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
int main(int argc, char *argv[]) {
ll n, m;
cin >> n >> m;
vector<vector<ll>> v(m + 1);
for (ll i = 0; i < n; ++i) {
ll a, b;
cin >> a >> b;
v[a].push_back(b);
}
priority_queue<ll> pq;
ll an... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
int main(int argc, char *argv[]) {
ll n, m;
cin >> n >> m;
vector<vector<ll>> v(m + 1);
for (ll i = 0; i < n; ++i) {
ll a, b;
cin >> a >> b;
if (a > m)
continue;
v[a].push_back(b);
}
... | insert | 14 | 14 | 14 | 16 | 0 | |
p02948 | C++ | Runtime Error | /*
Author:zeke
pass System Test!
GET AC!!
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include... | /*
Author:zeke
pass System Test!
GET AC!!
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include... | replace | 69 | 70 | 69 | 70 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
c... | insert | 30 | 30 | 30 | 32 | -11 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> jobs(M); // i日目に選択出来る仕事
rep(i, N) {
int a, b;
cin >> a >> b;
jobs[M - a].push_back(b);
}
priority_queue<int> q;
long ans = 0;
for (int ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> jobs(M); // i日目に選択出来る仕事
rep(i, N) {
int a, b;
cin >> a >> b;
if (a > M)
continue;
jobs[M - a].push_back(b);
}
priority_queue<int> ... | insert | 13 | 13 | 13 | 15 | 0 | |
p02948 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
struct node {
int x, y;
} a[100005];
bool cmp(node a, node b) { return a.y > b.y || (a.y == b.y && a.x < b.x); }
int n, m, i, ans, f[100005];
int find(int x) { return f[x] == x ? x : f[x] = find(f[x]); }
int main() {
scanf("%d%d", &n, &m);
m++;
for (i ... | #include <algorithm>
#include <cstdio>
using namespace std;
struct node {
int x, y;
} a[100005];
bool cmp(node a, node b) { return a.y > b.y || (a.y == b.y && a.x < b.x); }
int n, m, i, ans, f[100005];
int find(int x) { return f[x] == x ? x : f[x] = find(f[x]); }
int main() {
scanf("%d%d", &n, &m);
m++;
for (i ... | replace | 18 | 20 | 18 | 20 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> vs[100000];
int main() {
cin >> n >> m;
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
if (m - a < 0)
continue;
vs[m - a].push_back(b);
}
priority_queue<int> q;
long ans = 0;
for (int j = m; j >= 0; --j) {
... | #include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> vs[100001];
int main() {
cin >> n >> m;
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
if (m - a < 0)
continue;
vs[m - a].push_back(b);
}
priority_queue<int> q;
long ans = 0;
for (int j = m; j >= 0; --j) {
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading \
zero str.erase(0, min(str.find_first_not_of('0'), str.size() - 1));
using namespace __gnu_pbds;
using namespace std;
typedef long long... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading \
zero str.erase(0, min(str.find_first_not_of('0'), str.size() - 1));
using namespace __gnu_pbds;
using namespace std;
typedef long long... | replace | 38 | 39 | 38 | 39 | 0 | |
p02948 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using names... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using names... | replace | 34 | 35 | 34 | 35 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int i, j, k;
int a, b;
int ans = 0;
pair<int, int> p[M];
priority_queue<int> q;
for (i = 0; i < N; i++) {
cin >> a >> b;
p[i] = make_pair(a, b);
}
sort(p, p + N);
j = 0;
for (i = 1; i <= M; i++) {
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int i, j, k;
int a, b;
int ans = 0;
pair<int, int> p[N];
priority_queue<int> q;
for (i = 0; i < N; i++) {
cin >> a >> b;
p[i] = make_pair(a, b);
}
sort(p, p + N);
j = 0;
for (i = 1; i <= M; i++) {
if... | replace | 9 | 10 | 9 | 10 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
using namespace std;
#if DEBUG && !ONLINE_JUDGE
#include "debug.h"
#else
#define debug(...)
#endif
typedef long long ll;
typedef ... | #include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
using namespace std;
#if DEBUG && !ONLINE_JUDGE
#include "debug.h"
#else
#define debug(...)
#endif
typedef long long ll;
typedef ... | replace | 110 | 111 | 110 | 111 | 0 | |
p02948 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG // 空コンテナ操作禁止 Clang環境では#define _LIBCPP_DEBUG
// 0
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using Pi... | delete | 0 | 2 | 0 | 0 | TLE | |
p02948 | C++ | Runtime Error |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | replace | 87 | 88 | 87 | 88 | 0 | |
p02948 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
t... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
t... | replace | 25 | 26 | 25 | 26 | 0 | |
p02948 | Python | Time Limit Exceeded | import heapq
N, M = map(int, input().split())
dic = {}
for i in range(N):
A, B = map(int, input().split())
if A not in dic:
dic[A] = [-B]
else:
dic[A].append(-B)
# print(dic, sorted(dic.keys()))
ans = 0
heap = []
for i in range(M):
# print(i)
if i + 1 in dic:
heap.extend(d... | import heapq
N, M = map(int, input().split())
dic = {}
for i in range(N):
A, B = map(int, input().split())
if A not in dic:
dic[A] = [-B]
else:
dic[A].append(-B)
# print(dic, sorted(dic.keys()))
ans = 0
heap = []
for i in range(M):
# print(i)
if i + 1 in dic:
for j in dic[... | replace | 18 | 20 | 18 | 20 | TLE | |
p02948 | Python | Runtime Error | import heapq
n, m = map(int, input().split())
lis = []
for i in range(n + 1):
lis.append([])
for i in range(n):
a, b = map(int, input().split())
if a <= m:
lis[a].append(-b)
cnd = []
heapq.heapify(cnd)
res = 0
for j in range(1, m + 1):
for e in lis[j]:
heapq.heappush(cnd, e)
if c... | import heapq
n, m = map(int, input().split())
lis = []
for i in range(m + 1):
lis.append([])
for i in range(n):
a, b = map(int, input().split())
if a <= m:
lis[a].append(-b)
cnd = []
heapq.heapify(cnd)
res = 0
for j in range(1, m + 1):
for e in lis[j]:
heapq.heappush(cnd, e)
if c... | replace | 4 | 5 | 4 | 5 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02948/Python/s323852775.py", line 11, in <module>
lis[a].append(-b)
IndexError: list index out of range
|
p02948 | Python | Runtime Error | from heapq import heappop, heapify, heappush
def main():
n, m = map(int, input().split())
work = [[] for _ in range(10**4 + 1)]
for _ in range(n):
a, b = map(int, input().split())
work[a].append(b)
ans = 0
q = []
heapify(q)
for i in range(1, m + 1):
for w in work[i]... | from heapq import heappop, heapify, heappush
def main():
n, m = map(int, input().split())
work = [[] for _ in range(10**5 + 1)]
for _ in range(n):
a, b = map(int, input().split())
work[a].append(b)
ans = 0
q = []
heapify(q)
for i in range(1, m + 1):
for w in work[i]... | replace | 5 | 6 | 5 | 6 | 0 | |
p02948 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
const int N = 100005;
int tree[2 * N + 5];
struct record {
int a, b;
};
record arr[N];
void update(int node, int start, int end, int idx, int val) {
if (start == end) {
tree[node] += val;
} else {
int mid = (start + end) / 2;
if (start... | #include <algorithm>
#include <iostream>
using namespace std;
const int N = 100005;
int tree[4 * N + 5];
struct record {
int a, b;
};
record arr[N];
void update(int node, int start, int end, int idx, int val) {
if (start == end) {
tree[node] += val;
} else {
int mid = (start + end) / 2;
if (start... | replace | 6 | 7 | 6 | 7 | 0 | |
p02948 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | replace | 317 | 318 | 317 | 318 | 0 | |
p02948 | 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;
const int mod = 1000000007;
void solve() {
int n, m;
cin >> n >> m;
vector<vector<int>> jobs(n + 1);
rep(i, n) {
int a, b;
cin >> a >> b;
if (a > m)
continue;
jobs[m - a... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
void solve() {
int n, m;
cin >> n >> m;
vector<vector<int>> jobs(m + 1);
rep(i, n) {
int a, b;
cin >> a >> b;
if (a > m)
continue;
jobs[m - a... | replace | 10 | 11 | 10 | 11 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> a[10001];
for (int i = 0; i < n; i++) {
int b, c;
cin >> b >> c;
a[b].push_back(c);
}
int ans = 0;
priority_queue<int> q;
for (int i = 1; i <= m; i++) {
for (int x : a[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> a[100001];
for (int i = 0; i < n; i++) {
int b, c;
cin >> b >> c;
a[b].push_back(c);
}
int ans = 0;
priority_queue<int> q;
for (int i = 1; i <= m; i++) {
for (int x : a[... | replace | 7 | 8 | 7 | 8 | 0 | |
p02948 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
struct node {
int a, b;
bool operator<(const node &T) const {
if (T.a == a)
return b < T.b;
return a < T.a;
}
};
node a[1111] = {0... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
struct node {
int a, b;
bool operator<(const node &T) const {
if (T.a == a)
return b < T.b;
return a < T.a;
}
};
node a[111100] = ... | replace | 17 | 18 | 17 | 18 | 0 | |
p02948 | 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 | 46 | 47 | 46 | 48 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
int main() {
int n, m;
cin >> n >> m;
vector<int> vec[m + 1];
rep(i, n) {
int a, b;
cin >> a >> b;
vec[a].push_back(b);
}
long ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
int main() {
int n, m;
cin >> n >> m;
vector<int> vec[100010];
rep(i, n) {
int a, b;
cin >> a >> b;
vec[a].push_back(b);
}
long ans = 0;
... | replace | 10 | 11 | 10 | 11 | 0 | |
p02948 | C++ | Runtime Error | #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 COUT(x) cout << #x << " = " << (x) << " (L" << __... | #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 COUT(x) cout << #x << " = " << (x) << " (L" << __... | replace | 62 | 63 | 62 | 63 | 0 | |
p02948 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#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;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for (int i... | #include <algorithm>
#include <cmath>
#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;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for (int i... | replace | 26 | 27 | 26 | 27 | 0 | |
p02948 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
using llong = long long;
pair<llong, llong> a[100005];
priority_queue<llong> p_que;
int main() {
llong n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
}
llong ans = 0;
int idx = 0;
so... | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
using llong = long long;
pair<llong, llong> a[100005];
priority_queue<llong> p_que;
int main() {
llong n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
}
llong ans = 0;
int idx = 0;
so... | replace | 21 | 22 | 21 | 22 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int nax = (int)1e5 + 7;
int n, m;
int sol;
vector<int> bs[nax];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++) {
int a, b;
cin >> a >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int nax = (int)1e5 + 7;
int n, m;
int sol;
vector<int> bs[nax];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++) {
int a, b;
cin >> a >>... | replace | 22 | 23 | 22 | 24 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<vector<int>> AB(M);
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
a--;
AB[a].emplace_back(b);
}
priority_queue<int> que;
int res = 0;
for (in... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<vector<int>> AB(M);
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
if (a > M)
continue;
a--;
AB[a].emplace_back(b);
}
priority_queue<int... | insert | 13 | 13 | 13 | 15 | 0 | |
p02948 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef std::pair<int, int> ipair;
bool lessPair(const ipair &l, const ipair &r) { return l... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef std::pair<int, int> ipair;
bool lessPair(const ipair &l, const ipair &r) { return l... | replace | 82 | 83 | 82 | 84 | 0 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> d_to_v(m + 1);
for (int i = 0; i < n; i++) {
int d, v;
cin >> d >> v;
d_to_v[d].push_back(v);
}
priority_queue<int> p... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> d_to_v(m + 1);
for (int i = 0; i < n; i++) {
int d, v;
cin >> d >> v;
if (d > m)
continue;
d_to_v[d].push_back(v... | insert | 16 | 16 | 16 | 18 | 0 | |
p02948 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
typedef pair<ll, ll> p;
typedef unsign... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
typedef pair<ll, ll> p;
typedef unsign... | insert | 43 | 43 | 43 | 45 | -11 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> jobs(m);
rep(i, n) {
int a, b;
cin >> a >> b;
if (a > m)
continue;
jobs[m - a].push_back(b);
}
priority_queue<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> jobs(m);
rep(i, n) {
int a, b;
cin >> a >> b;
if (a > m)
continue;
jobs[m - a].push_back(b);
}
priority_queue<... | replace | 19 | 20 | 19 | 20 | -11 | |
p02948 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define rrep(i, a, b) for (int i = (a); i >= (b); --i)
#define MP make_pair
#define PB push_back
typedef long long LL;
const LL P = 998244353;
const int N = 1e5 + 10;
mt19937 rng(chrono::steady_clock::now().time_since_ep... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define rrep(i, a, b) for (int i = (a); i >= (b); --i)
#define MP make_pair
#define PB push_back
typedef long long LL;
const LL P = 998244353;
const int N = 1e5 + 10;
mt19937 rng(chrono::steady_clock::now().time_since_ep... | insert | 25 | 25 | 25 | 27 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.