problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define forn(i, n) for (ll i = 0; i < n; i++)
#define fore(i, a, b) for (ll i = a; i <= b; i++)
#define ford(i, n) for (ll i = n - 1; i >= 0; i--)
#define fi first
#define se second
#defi... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define forn(i, n) for (ll i = 0; i < n; i++)
#define fore(i, a, b) for (ll i = a; i <= b; i++)
#define ford(i, n) for (ll i = n - 1; i >= 0; i--)
#define fi first
#define se second
#defi... | [] | 749,875 | 749,876 | u576115185 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using P = pair<int, int>;
using PL = pair<ll, ll>;
using vp = vector<P>;
using vpl = vector<PL>;
template <typename T> constexpr auto inf = numeric_limits<T>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using P = pair<int, int>;
using PL = pair<ll, ll>;
using vp = vector<P>;
using vpl = vector<PL>;
template <typename T> constexpr auto inf = numeric_limits<T>... | [
"assignment.change"
] | 749,877 | 749,878 | u502709453 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
// cout << setprecision(12) ;
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
// cout << setprecision(12) ;
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
map<string, ll> mp;
for (ll i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans ... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 749,879 | 749,880 | u676029460 | cpp |
p02947 | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:512000000")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#i... | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:512000000")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#i... | [] | 749,883 | 749,884 | u258032299 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
typedef long long ll;
string s[maxn];
map<string, int> mp;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
mp[s[i]]++;
}
ll ans = 0;
for (auto it = mp.begin(); it != ... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
typedef long long ll;
string s[maxn];
map<string, int> mp;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
mp[s[i]]++;
}
ll ans = 0;
for (auto it = mp.begin(); it != ... | [
"call.arguments.change"
] | 749,885 | 749,886 | u316852065 | cpp |
p02947 | // In the name of God
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5 + 5;
map<string, int> mp;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
ans += mp[s];
... | // In the name of God
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5 + 5;
map<string, long long> mp;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n;
cin >> n;
long long ans = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
an... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,887 | 749,888 | u832023241 | cpp |
p02947 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [] | 749,891 | 749,892 | u380459040 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int t;
string s;
map<string, int> mp;
map<string, int>::iterator it;
ll vis[N];
void init() {
for (int i = 1; i <= 100000; i++)
vis[i] = i * (i - 1) / 2;
}
int main() {
init();
cin >> t;
while (t--) {
cin >> s;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int t;
string s;
map<string, int> mp;
map<string, int>::iterator it;
ll vis[N];
void init() {
for (ll i = 1; i <= 100000; i++)
vis[i] = i * (i - 1) / 2;
}
int main() {
init();
cin >> t;
while (t--) {
cin >> s;
... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 749,893 | 749,894 | u461754222 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int N;
string s;
map<string, int> M;
ll ans;
int main() {
int i, j;
cin >> N;
for (i = 1; i <= N; i++) {
cin >> s;
sort(s.begin(), s.end());
ans += M[s]++;
}
printf("%d", a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int N;
string s;
map<string, int> M;
ll ans;
int main() {
int i, j;
cin >> N;
for (i = 1; i <= N; i++) {
cin >> s;
sort(s.begin(), s.end());
ans += M[s]++;
}
printf("%lld",... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 749,895 | 749,896 | u539847337 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
map<string, int> cnt;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
cnt[s]++;
}
int ans = 0;
for (auto &it : cnt) {
ans +=... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
map<string, int> cnt;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
cnt[s]++;
}
long long ans = 0;
for (auto &it : cnt) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.change"
] | 749,897 | 749,898 | u986669926 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
map<string, int> mmp;
set<string> st;
string s;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s;
sort(s.begin(), s.end());
mmp[s]++;
st.insert(s);
}
long long ans = 0;
for (auto v : st) {
ans += (mmp[v] * (mmp[v] - 1) /... | #include <bits/stdc++.h>
using namespace std;
map<string, long long> mmp;
set<string> st;
string s;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s;
sort(s.begin(), s.end());
mmp[s]++;
st.insert(s);
}
long long ans = 0;
for (auto v : st) {
ans += (mmp[v] * (mmp[v] ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,899 | 749,900 | u206489571 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
long long int INF = 3e18;
double Pi = 3.1415926535897932384626;
vector<ll> G1[500005];
vector<ll> G2[500005];
// vector<P> tree[500010];
priority_queue<ll> pql;
priority_queue<P> pqp;
// big priority queue
priority_queue<ll,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
long long int INF = 3e18;
double Pi = 3.1415926535897932384626;
vector<ll> G1[500005];
vector<ll> G2[500005];
// vector<P> tree[500010];
priority_queue<ll> pql;
priority_queue<P> pqp;
// big priority queue
priority_queue<ll,... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 749,901 | 749,902 | u399527088 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
map<string, int> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(begin(s), end(s));
m[s]++;
}
ll r = 0;
for (auto e : m)
r += e.second * (e.second - 1) / 2;
cout << r << endl;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
map<string, ll> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(begin(s), end(s));
m[s]++;
}
ll r = 0;
for (auto e : m)
r += e.second * (e.second - 1) / 2;
cout << r << endl;
... | [] | 749,903 | 749,904 | u848737670 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using mint = map<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ch... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using mint = map<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ch... | [
"variable_declaration.type.change"
] | 749,905 | 749,906 | u306142032 | cpp |
p02947 | #include <bits/stdc++.h>
#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 fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(fals... | #include <bits/stdc++.h>
#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 fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(fals... | [] | 749,907 | 749,908 | u532065884 | cpp |
p02947 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using LL = long long;
const LL LINF = 1e18;
const double EPS = 1e-10;
using namespace std;
class Edge {
public:
int from, to, value;
Edge(LL a, LL b, LL c) {
from = a;
to = b;
value = c;
}
Edge(LL a, LL b) {
from = a;
to ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using LL = long long;
const LL LINF = 1e18;
const double EPS = 1e-10;
using namespace std;
class Edge {
public:
int from, to, value;
Edge(LL a, LL b, LL c) {
from = a;
to = b;
value = c;
}
Edge(LL a, LL b) {
from = a;
to ... | [] | 749,911 | 749,912 | u580402951 | cpp |
p02947 | #include <bits/stdc++.h>
#define Ms(a, b) memset(a, b, sizeof a)
#define db(x) cout << #x << "=" << x << endl;
#define db2(x, y) cout << #x << "=" << x << " " << #y << "=" << y << endl;
#define db3(x, y, z) \
cout << #x << "=" << x << " " << #y << "=" << y << ... | #include <bits/stdc++.h>
#define Ms(a, b) memset(a, b, sizeof a)
#define db(x) cout << #x << "=" << x << endl;
#define db2(x, y) cout << #x << "=" << x << " " << #y << "=" << y << endl;
#define db3(x, y, z) \
cout << #x << "=" << x << " " << #y << "=" << y << ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 749,915 | 749,916 | u928673524 | cpp |
p02947 | #include <bits/stdc++.h>
#define LL long long
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define PER(i, n) for (int i = n - 1; i >= 0; --i)
#define REPA(i, n) for (int i = 1; i < (n); ++i)
#define foreach(i, n) for (auto &i : (n))
#define PII pair<int, int>
#define PLI pair<long long, int>
#define PLL pair<long lo... | #include <bits/stdc++.h>
#define LL long long
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define PER(i, n) for (int i = n - 1; i >= 0; --i)
#define REPA(i, n) for (int i = 1; i < (n); ++i)
#define foreach(i, n) for (auto &i : (n))
#define PII pair<int, int>
#define PLI pair<long long, int>
#define PLL pair<long lo... | [
"variable_declaration.type.change"
] | 749,917 | 749,918 | u493610446 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define pi 3.141592653589793
using namespace std;
int main() {
// cout << setprecision(10);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
map<string, ... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define pi 3.141592653589793
using namespace std;
int main() {
// cout << setprecision(10);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
map<string, l... | [
"variable_declaration.type.change"
] | 749,919 | 749,920 | u188208110 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define N 1000000
int main() {
ll n;
cin >> n;
string s;
map<string, ll> m;
int ans = 0;
for (int i = 0; i < n; i++) {... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define N 1000000
int main() {
ll n;
cin >> n;
string s;
map<string, ll> m;
ll ans = 0;
for (ll i = 0; i < n; i++) {
... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 749,923 | 749,924 | u131797876 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using lpair = pair<llong, llong>;
#define ALL(x) x.begin(), x.end()
const llong inf = 1100100100100100ll;
const llong mod = 1e9 + 7;
int main() {
llong N;
vector<string> s;
cin >> N;
s.resize(N);
for (int i =... | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using lpair = pair<llong, llong>;
#define ALL(x) x.begin(), x.end()
const llong inf = 1100100100100100ll;
const llong mod = 1e9 + 7;
int main() {
llong N;
vector<string> s;
cin >> N;
s.resize(N);
for (int i =... | [] | 749,925 | 749,926 | u341957179 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
map<string, int> mp;
string s;
int ans = 0;
int main() {
int n;
cin >> n;
while (n--) {
cin >> s;
sort(s.begin(), s.end());
ans += mp[s];
mp[s]++;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
map<string, int> mp;
string s;
long long ans = 0;
int main() {
int n;
cin >> n;
while (n--) {
cin >> s;
sort(s.begin(), s.end());
ans += mp[s];
mp[s]++;
}
cout << ans;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,927 | 749,928 | u902105722 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define DEBUG 0
#define fi first
#define se second
#define pb push_back
#define INF 1... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define DEBUG 0
#define fi first
#define se second
#define pb push_back
#define INF 1... | [] | 749,929 | 749,930 | u334141868 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, e) for (int i = a; i < e; ++i)
using LL = long long;
int main() {
int N;
cin >> N;
vector<string> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
auto b = a;
FOR(i, 0, N) { sort(b[i].begin(), b[i].end()); }
map<string, int> m;
FO... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, e) for (int i = a; i < e; ++i)
using LL = long long;
int main() {
int N;
cin >> N;
vector<string> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
auto b = a;
FOR(i, 0, N) { sort(b[i].begin(), b[i].end()); }
map<string, LL> m;
FOR... | [] | 749,931 | 749,932 | u110336585 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, typename K> using ump = uno... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, typename K> using ump = uno... | [] | 749,933 | 749,934 | u136378781 | cpp |
p02948 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define cst first
#define dur second
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
const int N = 1e5 + 5, M = 2 * N + 5;
int n, m;
vector<int> idx[N];
int main() {
scanf("%d%d", &n, &m);
for (int i = ... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define cst first
#define dur second
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
const int N = 1e5 + 5, M = 2 * N + 5;
int n, m;
vector<int> idx[N];
int main() {
scanf("%d%d", &n, &m);
for (int i = ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 749,939 | 749,940 | u863370423 | cpp |
p02948 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(pos, mp) for (ll pos = mp.begin(); pos != mp.end(); pos - ++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int I... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(pos, mp) for (ll pos = mp.begin(); pos != mp.end(); pos - ++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int I... | [] | 749,959 | 749,960 | u969116807 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
int N, M, a, b, ans;
int main() {
cin >> N >> M;
vector<vector<int>> v(1 << 17);
for (int i = 0; i < M; i++) {
cin >> a >> b;
v[a].push_back(b);
}
priority_queue<int> q;
for (int i = 1; i <= M; i++) {
for (auto e : v[i])
q.push(e);
if (q.si... | #include <bits/stdc++.h>
using namespace std;
int N, M, a, b, ans;
int main() {
cin >> N >> M;
vector<vector<int>> v(1 << 17);
for (int i = 0; i < N; i++) {
cin >> a >> b;
v[a].push_back(b);
}
priority_queue<int> q;
for (int i = 1; i <= M; i++) {
for (auto e : v[i])
q.push(e);
if (q.si... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 749,986 | 749,987 | u743561048 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
int N, M, a, b, ans;
int main() {
cin >> N >> M;
vector<vector<int>> v(1 << 17);
for (int i = 0; i < M; i++) {
cin >> a >> b;
v[a].push_back(b);
}
priority_queue<int> q;
for (int i = 1; i <= M; i++) {
for (auto e : v[i])
q.push(e);
if (q.si... | #include <bits/stdc++.h>
using namespace std;
int N, M, a, b, ans;
int main() {
cin >> N >> M;
vector<vector<int>> v(1 << 17);
for (int i = 0; i < N; i++) {
cin >> a >> b;
v[a].push_back(b);
}
priority_queue<int> q;
for (int i = 1; i <= M; i++) {
for (auto e : v[i])
q.push(e);
if (q.si... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"io.output.newline.add"
] | 749,988 | 749,987 | u743561048 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
int N, M, a, b, ans;
int main() {
cin >> N >> M;
vector<vector<int>> v(1 << 17);
for (int i = 0; i < M; i++) {
cin >> a >> b;
v[a].push_back(b);
}
priority_queue<int> q;
for (int i = 1; i <= M; i++) {
for (auto e : v[i])
q.push(e);
if (q.si... | #include <bits/stdc++.h>
using namespace std;
long N, M, a, b, ans;
int main() {
cin >> N >> M;
vector<vector<long>> v(1 << 17);
for (int i = 0; i < N; i++) {
cin >> a >> b;
v[a].push_back(b);
}
priority_queue<long> q;
for (int i = 1; i <= M; i++) {
for (auto e : v[i])
q.push(e);
if (q... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 749,986 | 749,989 | u743561048 | cpp |
p02948 | #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... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 750,008 | 750,009 | u809967037 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const long long mod = 1000000007LL;
int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const long long mod = 1000000007LL;
int ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 750,012 | 750,013 | u615662061 | cpp |
p02948 | #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... | [
"literal.number.change",
"call.arguments.change"
] | 750,020 | 750,019 | u024383312 | cpp |
p02948 | #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++) {
... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 750,037 | 750,038 | u107406081 | cpp |
p02948 | #include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define ALL(s) s.begin(), s.end()
#define fill(a, c) memset(&a, c, sizeof(a))
#define fore(i, x, y) for (ll i = x; i < y; i++)
#define SZ(x) ((int)(x).size())
#define PI 3.1415926535897932384626433832795
#define FIN ... | #include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define ALL(s) s.begin(), s.end()
#define fill(a, c) memset(&a, c, sizeof(a))
#define fore(i, x, y) for (ll i = x; i < y; i++)
#define SZ(x) ((int)(x).size())
#define PI 3.1415926535897932384626433832795
#define FIN ... | [
"call.arguments.change"
] | 750,047 | 750,048 | u510872737 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i, n) for (int i = 0; i < n; ++i)
#define loop(i, a, b) for (int i = a; i < ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i, n) for (int i = 0; i < n; ++i)
#define loop(i, a, b) for (int i = a; i < ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 750,063 | 750,064 | u858929490 | cpp |
p02948 | #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... | [
"expression.operation.binary.add"
] | 750,073 | 750,074 | u722640678 | cpp |
p02948 | #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... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 750,077 | 750,078 | u476488060 | cpp |
p02948 | #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... | [] | 750,081 | 750,082 | u714732628 | cpp |
p02948 | ///////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
#include <sys/time.h>
#include <time.h>
#include <unistd.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V ve... | ///////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
#include <sys/time.h>
#include <time.h>
#include <unistd.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V ve... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 750,089 | 750,090 | u167931717 | cpp |
p02948 | ///////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
#include <sys/time.h>
#include <time.h>
#include <unistd.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V ve... | ///////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
#include <sys/time.h>
#include <time.h>
#include <unistd.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V ve... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 750,091 | 750,090 | u167931717 | cpp |
p02948 | #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... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 750,092 | 750,093 | u989611568 | cpp |
p02948 | #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... | [] | 750,098 | 750,099 | u860546679 | cpp |
p02948 | #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;
... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 750,138 | 750,139 | u518042385 | cpp |
p02948 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> p[m + 1];
rep(i, n) {
int a, b;
cin >> a >> b;
p[a].push_back(b);
}
// rep(i,n) cout << p[i].second << ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> p[100005];
rep(i, n) {
int a, b;
cin >> a >> b;
p[a].push_back(b);
}
// rep(i,n) cout << p[i].second <<... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 750,191 | 750,192 | u243407720 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MAX = 5100000;
ll gcd(ll a, ll b) { return (b == 0) ? a : gcd(b, a % b); }
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MAX = 5100000;
ll gcd(ll a, ll b) { return (b == 0) ? a : gcd(b, a % b); }
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMin... | [] | 750,217 | 750,218 | u598710706 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MAX = 5100000;
ll gcd(ll a, ll b) { return (b == 0) ? a : gcd(b, a % b); }
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MAX = 5100000;
ll gcd(ll a, ll b) { return (b == 0) ? a : gcd(b, a % b); }
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMin... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 750,219 | 750,220 | u598710706 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef pair<int, int> pii;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define all(x) (x).begin(), (x).end()
#define s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef pair<int, int> pii;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define all(x) (x).begin(), (x).end()
#define s... | [
"variable_declaration.type.change"
] | 750,252 | 750,253 | u035566695 | cpp |
p02948 | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1e9 + 7;
int main(void) {
int N, M;
cin >> N >> M;
vector<vector<int>> vec(N);
for (int i = 0; i < N; ++i) {
int A, B;
cin >> A >> B;
vec[A - 1].push_back(B);
}
int ans = 0;
priority_queu... | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1e9 + 7;
int main(void) {
int N, M;
cin >> N >> M;
vector<vector<int>> vec(1e5);
for (int i = 0; i < N; ++i) {
int A, B;
cin >> A >> B;
vec[A - 1].push_back(B);
}
int ans = 0;
priority_qu... | [] | 750,292 | 750,293 | u635358463 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<pair<int, int>> a;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
if (x <= m) {
a.push_back(make_pair(x, y));
}
}
ll ans... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<pair<int, int>> a;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
if (x <= m) {
a.push_back(make_pair(x, y));
}
}
ll ans... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 750,302 | 750,303 | u657667703 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll maxn = 1e5;
bool srts(const pair<ll, ll> &a, const pair<ll, ll> &b) {
// if(a.second==b.second)return a.first>b.first;
if (a.first == b.first)
return a.second > b.second;
return (a.fir... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll maxn = 1e5;
bool srts(const pair<ll, ll> &a, const pair<ll, ll> &b) {
// if(a.second==b.second)return a.first>b.first;
if (a.first == b.first)
return a.second > b.second;
return (a.fir... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 750,304 | 750,305 | u086395150 | cpp |
p02948 | #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};
/... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 750,328 | 750,329 | u408053343 | cpp |
p02948 | #include <bits/stdc++.h>
#define REP(i, N) for (int 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};
/... | [
"preprocessor.define.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.type.change"
] | 750,330 | 750,329 | u408053343 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long i = 0; i < n; i++)
/*
バイトがn件あり、m日後までに受け取れる報酬の総和を最大化する。
例：m=4、(4,3),(4,1),(2,2)
ペア(a,b)について、
ペアをaの値でソートし、頭から順に実行していく。
ただし、残りi日のタイミングでiより大きいaを持つペアは消す。
forループ。i=0からスタートし、i=m-1の間で、ペアの配列を順番に走査。
配列のaがm-i<aであれば、配列の頭を削除し、続ける。... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long i = 0; i < n; i++)
/*
バイトがn件あり、m日後までに受け取れる報酬の総和を最大化する。
例：m=4、(4,3),(4,1),(2,2)
ペア(a,b)について、
ペアをaの値でソートし、頭から順に実行していく。
ただし、残りi日のタイミングでiより大きいaを持つペアは消す。
forループ。i=0からスタートし、i=m-1の間で、ペアの配列を順番に走査。
配列のaがm-i<aであれば、配列の頭を削除し、続ける。... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 750,372 | 750,373 | u272496669 | cpp |
p02948 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
void *wmem;
template <class T> inline void walloc1d(T **arr, int x, void **mem = &wmem) {
static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
(*mem) = (void *)(((char *)(*mem)) + skip[((unsigned long long)(*mem)) &... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
void *wmem;
template <class T> inline void walloc1d(T **arr, int x, void **mem = &wmem) {
static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
(*mem) = (void *)(((char *)(*mem)) + skip[((unsigned long long)(*mem)) &... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 750,393 | 750,394 | u066369439 | cpp |
p02948 | // review
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAXN = 1e5 + 10;
int n, m;
int a[MAXN], b[MAXN];
void solve() {
vector<P> v;
for (int i = 0; i < n; i++) {
if (m >= a[i]) {
v.push_back(P(... | // review
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAXN = 1e5 + 10;
int n, m;
int a[MAXN], b[MAXN];
void solve() {
vector<P> v;
for (int i = 0; i < n; i++) {
if (m >= a[i]) {
v.push_back(P(... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 750,397 | 750,398 | u550178285 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define ll long long
typedef pair<ll, ll> pll;
typedef vector<ll> vi;
#define out(x) return cout << x, 0;
#define precision(x, d) cout << fixed << setprecision... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define ll long long
typedef pair<ll, ll> pll;
typedef vector<ll> vi;
#define out(x) return cout << x, 0;
#define precision(x, d) cout << fixed << setprecision... | [
"identifier.change"
] | 750,410 | 750,411 | u415518175 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { ce... | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { ce... | [] | 750,420 | 750,421 | u773638671 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { ce... | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { ce... | [] | 750,422 | 750,421 | u773638671 | cpp |
p02948 | #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... | [] | 750,423 | 750,424 | u724515098 | cpp |
p02948 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll BIG = 1e15;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> d;
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
d.push_back(make_pair(A, B));
}
sort(d.... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll BIG = 1e15;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> d;
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
d.push_back(make_pair(A, B));
}
sort(d.... | [
"expression.unary.arithmetic.add",
"call.arguments.change"
] | 750,520 | 750,521 | u951952491 | cpp |
p02948 | /* Dsingh_24 */
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (ll int ... | /* Dsingh_24 */
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (ll int ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 750,531 | 750,532 | u535413433 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, ans = 0;
cin >> N >> M;
vector<pair<int, int>> AB;
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
AB.push_back(make_pair(A, B));
}
sort(AB.begin(), AB.end());
reverse(AB.begin(), AB.end());
priority_queue<int, vec... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, ans = 0;
cin >> N >> M;
vector<pair<int, int>> AB;
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
AB.push_back(make_pair(A, B));
}
sort(AB.begin(), AB.end());
reverse(AB.begin(), AB.end());
priority_queue<int, vec... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 750,535 | 750,536 | u573082373 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
set<pair<long long, long long>> s; //{date,get}
set<pair<long long, long long>> u; //{get,date}
for (long long i = 0; i < n; i++) {
long long a, b;
cin >> a >> b;
s.insert({a, b});
}
for (auto p = s.rbeg... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
multiset<pair<long long, long long>> s; //{date,get}
multiset<pair<long long, long long>> u; //{get,date}
for (long long i = 0; i < n; i++) {
long long a, b;
cin >> a >> b;
s.insert({a, b});
}
for (auto ... | [
"variable_declaration.type.change"
] | 750,543 | 750,544 | u729337236 | cpp |
p02948 | #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... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 750,545 | 750,546 | u775224245 | cpp |
p02948 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"variable_declaration.type.change"
] | 750,565 | 750,566 | u236433947 | cpp |
p02948 | // This is getting accepted!
#include <bits/stdc++.h>
#define ll long long
#define oo 1000000009
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define INARR(a, n) \
for (int i = 1; i <= (n); ++i) \
cin... | // This is getting accepted!
#include <bits/stdc++.h>
#define ll long long
#define oo 1000000009
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define INARR(a, n) \
for (int i = 1; i <= (n); ++i) \
cin... | [
"variable_declaration.type.change"
] | 750,569 | 750,570 | u050328876 | cpp |
p02948 | #include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
using namespace std;
using ll = long long;
constexpr int mo = 1e9 + 7;
constexpr int mod = mo;
constexpr ll inf = 1ll << 50;
constexpr int infi = 1 << 30;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> c(m + 1);
for (int i = 0; i < n; ++... | #include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
using namespace std;
using ll = long long;
constexpr int mo = 1e9 + 7;
constexpr int mod = mo;
constexpr ll inf = 1ll << 50;
constexpr int infi = 1 << 30;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> c(100050);
for (int i = 0; i < n; +... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 750,580 | 750,581 | u699193595 | cpp |
p02948 | //
// main.cpp
// temp
//
// Created by tolemy on 2019/08/04.
// Copyright © 2019 tolemy. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
const int MAX_WORKS_COUNT = 100000 + 1;
//方針
// 0〜M-1日... | //
// main.cpp
// temp
//
// Created by tolemy on 2019/08/04.
// Copyright © 2019 tolemy. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
const int MAX_WORKS_COUNT = 100000 + 1;
//方針
// 0〜M-1日... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 750,584 | 750,583 | u889915625 | cpp |
p02948 | //
// main.cpp
// temp
//
// Created by tolemy on 2019/08/04.
// Copyright © 2019 tolemy. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
const int MAX_WORKS_COUNT = 100000 + 1;
//方針
// 0〜M-1日... | //
// main.cpp
// temp
//
// Created by tolemy on 2019/08/04.
// Copyright © 2019 tolemy. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
const int MAX_WORKS_COUNT = 100000 + 1;
//方針
// 0〜M-1日... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one"
] | 750,585 | 750,583 | u889915625 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
long N, M;
cin >> N >> M;
vector<vector<long>> v(M + 2);
priority_queue<long> q;
long A;
int B;
for (long i = 0; i < N; i++) {
cin >> A >> B;
v[A].push_back(B);
}
long long t = 0;
... | #include <bits/stdc++.h>
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
long N, M;
cin >> N >> M;
vector<vector<long>> v(100010);
priority_queue<long> q;
long A;
int B;
for (long i = 0; i < N; i++) {
cin >> A >> B;
v[A].push_back(B);
}
long long t = 0;
... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 750,593 | 750,594 | u128513271 | cpp |
p02948 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using pll = pair<ll, ll>;
using i3 = pair<int, ii>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<ii>;
using vi3 = vector<i3>;
const int N = 2e5 + 5;
const ll INF = 1e12;
const double eps = 1e-9, PI = a... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using pll = pair<ll, ll>;
using i3 = pair<int, ii>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<ii>;
using vi3 = vector<i3>;
const int N = 2e5 + 5;
const ll INF = 1e12;
const double eps = 1e-9, PI = a... | [
"expression.operation.binary.remove"
] | 750,601 | 750,602 | u284539389 | cpp |
p02948 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#pragma GCC optimize("Ofast", "inline", "-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
using namespace std;
typedef long long ll;
const ll inf = 0x3f3f3f3f3f3f3f... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#pragma GCC optimize("Ofast", "inline", "-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
using namespace std;
typedef long long ll;
const ll inf = 0x3f3f3f3f3f3f3f... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 750,610 | 750,611 | u682748256 | cpp |
p02948 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#pragma GCC optimize("Ofast", "inline", "-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
using namespace std;
typedef long long ll;
const ll inf = 0x3f3f3f3f3f3f3f... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#pragma GCC optimize("Ofast", "inline", "-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
using namespace std;
typedef long long ll;
const ll inf = 0x3f3f3f3f3f3f3f... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 750,610 | 750,612 | u682748256 | cpp |
p02948 |
// 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>
... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 750,624 | 750,625 | u874996917 | cpp |
p02948 |
// 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>
... | [
"variable_declaration.type.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 750,626 | 750,625 | u874996917 | cpp |
p02948 |
// 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>
... | [
"variable_declaration.type.change"
] | 750,627 | 750,625 | u874996917 | cpp |
p02948 | /*
This Submission is to determine how many 120/240 min const. delivery point there
are.
*/
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#... | /*
This Submission is to determine how many 120/240 min const. delivery point there
are.
*/
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 750,645 | 750,646 | u545022164 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
//入力
template <typename T> istream &operator>>(istream &is, vector<T> &a) {
for (int i = 0; i < a.size(); i++)
is >> a[i];
return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
... | #include <bits/stdc++.h>
using namespace std;
//入力
template <typename T> istream &operator>>(istream &is, vector<T> &a) {
for (int i = 0; i < a.size(); i++)
is >> a[i];
return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
... | [
"call.add",
"call.arguments.add"
] | 750,647 | 750,648 | u190580703 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n); (i)++)
#define SORT(i) sort((i).begin(), (i).end())
#define rSORT(i, a) sort((i).begin(), (i).end(), (a))
constexpr a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n); (i)++)
#define SORT(i) sort((i).begin(), (i).end())
#define rSORT(i, a) sort((i).begin(), (i).end(), (a))
constexpr a... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 750,651 | 750,652 | u863044225 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n); (i)++)
#define SORT(i) sort((i).begin(), (i).end())
#define rSORT(i, a) sort((i).begin(), (i).end(), (a))
constexpr a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n); (i)++)
#define SORT(i) sort((i).begin(), (i).end())
#define rSORT(i, a) sort((i).begin(), (i).end(), (a))
constexpr a... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.unary.add"
] | 750,653 | 750,652 | u863044225 | cpp |
p02949 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#d... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#d... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 750,654 | 750,655 | u863044225 | cpp |
p02949 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#d... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#d... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 750,656 | 750,657 | u863044225 | cpp |
p02949 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#d... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#d... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 750,656 | 750,659 | u863044225 | cpp |
p02949 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <u... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <u... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 750,661 | 750,662 | u236127431 | cpp |
p02949 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <u... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <u... | [
"expression.operation.binary.remove",
"expression.operation.unary.add",
"call.arguments.change"
] | 750,663 | 750,664 | u236127431 | cpp |
p02949 | #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>;
const int INF = 1001001001;
vector<int> to[2505];
vector<int> rto[2505];
bool rf1[2505];
bool rtn[2505];
bool ok[2505];
void dfs(int v) {
if (rf1[v])
return;
rf1[v] = ... | #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>;
const int INF = 1001001001;
vector<int> to[2505];
vector<int> rto[2505];
bool rf1[2505];
bool rtn[2505];
bool ok[2505];
void dfs(int v) {
if (rf1[v])
return;
rf1[v] = ... | [
"identifier.change"
] | 750,667 | 750,668 | u422506696 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vstr = vector<string>;
using vvstr = vector<vector<string>>;
using vch = vector<char>;
using vvch = vector<vector<ch... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vstr = vector<string>;
using vvstr = vector<vector<string>>;
using vch = vector<char>;
using vvch = vector<vector<ch... | [
"expression.operation.unary.arithmetic.remove"
] | 750,669 | 750,670 | u919867411 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vstr = vector<string>;
using vvstr = vector<vector<string>>;
using vch = vector<char>;
using vvch = vector<vector<ch... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vstr = vector<string>;
using vvstr = vector<vector<string>>;
using vch = vector<char>;
using vvch = vector<vector<ch... | [
"expression.operation.unary.arithmetic.remove"
] | 750,671 | 750,670 | u919867411 | cpp |
p02949 | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, a) repi(i, 0, ... | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, a) repi(i, 0, ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 750,674 | 750,675 | u265250376 | cpp |
p02949 | #include <bits/stdc++.h>
#define rep(i, x) for (ll i = 0; i < x; i++)
#define all(a) (a).begin(), (a).end()
using ll = long long;
using ld = long double;
using namespace std;
const ll INF = 1000000000000000000;
const ll mod = 1000000007;
const ld pi = 3.141592653589793238;
bool used1[1 << 18], used2[1 << 18];
//頂点from... | #include <bits/stdc++.h>
#define rep(i, x) for (ll i = 0; i < x; i++)
#define all(a) (a).begin(), (a).end()
using ll = long long;
using ld = long double;
using namespace std;
const ll INF = 1000000000000000000;
const ll mod = 1000000007;
const ld pi = 3.141592653589793238;
bool used1[1 << 18], used2[1 << 18];
//頂点from... | [] | 750,676 | 750,677 | u986568278 | cpp |
p02949 | #include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int INF = 1000000000;
int main() {
int N, M, P;
cin >> N >> M >> P;
vector<vector<pair<int, int>>> E(N);
vector<vector<int>> E2(N);
for (int i = 0; i < M; i++) {
int A, B, C;
cin >> A >> B >> C;
A--;
... | #include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int INF = 1000000000;
int main() {
int N, M, P;
cin >> N >> M >> P;
vector<vector<pair<int, int>>> E(N);
vector<vector<int>> E2(N);
for (int i = 0; i < M; i++) {
int A, B, C;
cin >> A >> B >> C;
A--;
... | [
"call.add",
"call.arguments.add"
] | 750,680 | 750,681 | u424374375 | cpp |
p02949 | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define debug_print(var) cerr << #var << "=" << var <<... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define debug_print(var) cerr << #var << "=" << var <<... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 750,706 | 750,707 | u225053756 | cpp |
p02949 | /*
* atcoder/abc137/e.cpp
*/
// C++ 14
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring> // memset
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (int __x = __start; __x < __end; __x++)
template <class T... | /*
* atcoder/abc137/e.cpp
*/
// C++ 14
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring> // memset
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (int __x = __start; __x < __end; __x++)
template <class T... | [
"call.add",
"call.arguments.change"
] | 750,708 | 750,709 | u823862638 | cpp |
p02949 | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (i... | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (i... | [
"identifier.change",
"call.arguments.change"
] | 750,714 | 750,715 | u704625420 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define r... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 750,716 | 750,717 | u277556971 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
const ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
const ... | [
"call.add",
"call.arguments.change"
] | 750,718 | 750,719 | u277556971 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (long long i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n, 1)
#define int long... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (long long i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n, 1)
#define int long... | [
"call.arguments.change"
] | 750,729 | 750,730 | u342075214 | cpp |
p02949 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 750,731 | 750,732 | u756088996 | cpp |
p02949 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | [
"control_flow.loop.for.condition.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 750,731 | 750,733 | u756088996 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.