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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03221 | Python | Runtime Error | from collections import defaultdict
N, M = map(int, input().split())
P, Y = [], []
ylist = defaultdict(list)
pset = set()
for i in range(M):
p, y = map(int, input().split())
P.append(p)
Y.append(y)
ylist[p].append(y)
pset.add(p)
cdict = defaultdict(dict)
for p in pset:
syear = sorted(ylist[p])... | from collections import defaultdict
N, M = map(int, input().split())
P, Y = [], []
ylist = defaultdict(list)
pset = set()
for i in range(M):
p, y = map(int, input().split())
P.append(p)
Y.append(y)
ylist[p].append(y)
pset.add(p)
cdict = defaultdict(dict)
for p in pset:
syear = sorted(ylist[p])... | replace | 23 | 24 | 23 | 24 | 0 | |
p03221 | Python | Runtime Error | N, M = [int(i) for i in input().split(" ")]
p = list()
y = list()
yd = {}
for i in range(0, M):
pi, yi = [int(i) for i in input().split(" ")]
p.append(pi)
y.append(yi)
if pi in yd.keys():
yd[pi].append(yi)
else:
yd[pi] = [yi]
ydid = {}
for i in yd.keys():
num = 1
for j in so... | N, M = [int(i) for i in input().split(" ")]
p = list()
y = list()
yd = {}
for i in range(0, M):
pi, yi = [int(i) for i in input().split(" ")]
p.append(pi)
y.append(yi)
if pi in yd.keys():
yd[pi].append(yi)
else:
yd[pi] = [yi]
ydid = {}
for i in yd.keys():
num = 1
for j in so... | replace | 16 | 17 | 16 | 17 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int64_t INF = 1'000'000'000'000'000;
int64_t N, ans;
int main() {
int N, M;
cin >> N >> M;
vector<int64_t> P(M), Y(M);
for (int i = 0; i < M; i++)
cin >> P[i] >> Y[i];
vector<vector<int64_t>> sorted(N, v... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int64_t INF = 1'000'000'000'000'000;
int64_t N, ans;
int main() {
int N, M;
cin >> N >> M;
vector<int64_t> P(M), Y(M);
for (int i = 0; i < M; i++)
cin >> P[i] >> Y[i];
vector<vector<int64_t>> sorted(N, v... | replace | 21 | 22 | 21 | 24 | TLE | |
p03221 | C++ | Runtime Error | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); ... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); ... | replace | 97 | 98 | 97 | 98 | 0 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = 1 << 29;
typedef long long int ll;
struct fuck {
int... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = 1 << 29;
typedef long long int ll;
struct fuck {
int... | replace | 24 | 26 | 24 | 26 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, m;
cin >> n;
cin >> m;
vector<int> p(m);
vector<int> y(m);
// cout << m << endl;
for (int i = ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, m;
cin >> n;
cin >> m;
vector<int> p(m);
vector<int> y(m);
// cout << m << endl;
for (int i = ... | replace | 45 | 46 | 45 | 47 | TLE | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <... | replace | 31 | 32 | 31 | 32 | 0 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
... | replace | 18 | 19 | 18 | 19 | 0 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> P(M);
vector<int> Y(M);
for (int i = 0; i < N; i++) {
cin >> P[i] >> Y[i];
P[i]--;
}
vector<vector<int>> val(N);
for (int i = ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> P(M);
vector<int> Y(M);
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
P[i]--;
}
vector<vector<int>> val(N);
for (int i = ... | replace | 13 | 14 | 13 | 14 | 0 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> p(m), y(m), l(m), num(n);
vector<pair<int, int>> post(m);
vector<pair<int, int>> city(m);
for (int i = 0; i < m; i++) {
cin >> p[i] >> y... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> p(m), y(m), l(m), num(n);
vector<pair<int, int>> post(m);
vector<pair<int, int>> city(m);
for (int i = 0; i < m; i++) {
cin >> p[i] >> y... | replace | 18 | 19 | 18 | 19 | 0 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
#define cinf(n, x, y) \
for (int i = 0; i < (n); i++) \
cin >> x[i] >> y[i];
typedef long long int ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> p(m)... | #include <bits/stdc++.h>
#define cinf(n, x, y) \
for (int i = 0; i < (n); i++) \
cin >> x[i] >> y[i];
typedef long long int ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> p(m)... | replace | 25 | 26 | 25 | 27 | -11 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> v(n);
vector<vector<int>> c(100000, vector<int>());
for (int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
p--;
v[i] = make_pair(p, y);
c[p].push_ba... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> v(m);
vector<vector<int>> c(100000, vector<int>());
for (int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
p--;
v[i] = make_pair(p, y);
c[p].push_ba... | replace | 8 | 9 | 8 | 9 | 0 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#i... | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#i... | replace | 88 | 89 | 88 | 89 | 0 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
std::vector<int> P(M), Y(M);
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
P[i]--;
}
std::vector<map<int, int>> m(N);
for (int i = 0; i < M; i++)
m[P[i]][Y[i]] = 0;
for (int i = 0; i < N; i++) {
int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
std::vector<int> P(M), Y(M);
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
P[i]--;
}
std::vector<map<int, int>> m(N);
for (int i = 0; i < M; i++)
m[P[i]][Y[i]] = 0;
for (int i = 0; i < N; i++) {
int... | replace | 16 | 17 | 16 | 17 | 0 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
in... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
in... | replace | 43 | 44 | 43 | 44 | 0 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | replace | 41 | 42 | 41 | 42 | 0 | |
p03221 | C++ | Runtime Error | // long time no ac
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vll vector<ll>
#define vi vector<int>
#define rep(i, n) for (i = 0; i < n; i++)
#define repe(i, I1, I2) for (i = I1; i < I2; i++)
#define pb push_back
#define mp make_pair
#define endl '\n'
#define mod 1000000007
ll cd(l... | // long time no ac
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vll vector<ll>
#define vi vector<int>
#define rep(i, n) for (i = 0; i < n; i++)
#define repe(i, I1, I2) for (i = I1; i < I2; i++)
#define pb push_back
#define mp make_pair
#define endl '\n'
#define mod 1000000007
ll cd(l... | replace | 33 | 35 | 33 | 35 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, p[100000 + 1], y[100000 + 1];
vector<int> num_list[100000];
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d%d", &p[i], &y[i]);
num_list[p[i] - 1].push_back(y[i]);
}
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, p[100000 + 1], y[100000 + 1];
vector<int> num_list[100000];
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d%d", &p[i], &y[i]);
num_list[p[i] - 1].push_back(y[i]);
}
... | replace | 18 | 22 | 18 | 23 | TLE | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 100005
#define NIL -1
#define rep(i, n) for (int i = 0; i < n; i++)
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
int n, m;
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 100005
#define NIL -1
#define rep(i, n) for (int i = 0; i < n; i++)
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
int n, m;
i... | replace | 14 | 15 | 14 | 15 | 0 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
int main() {
int N, M;
scanf("%d", &N);
scanf("%d", &M);
std::vector<int> to(M + 5);
std::vector<int> order(M + 5);
int P,... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
int main() {
int N, M;
scanf("%d", &N);
scanf("%d", &M);
std::vector<int> to(M + 5);
std::vector<int> order(M + 5);
int P,... | replace | 18 | 19 | 18 | 19 | 0 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct node {
int x;
int y;
int z;
};
int cmp(node a, node b) {
if (a.x == b.x) {
return a.y < b.y;
} else {
return a.x < b.x;
}
}
int main() {
int n, m;
node r[1000];
bool vis[10000] = {0};
int book[10000] = {0};
node a[1000], b[1000];
cin >... | #include <bits/stdc++.h>
using namespace std;
struct node {
int x;
int y;
int z;
};
int cmp(node a, node b) {
if (a.x == b.x) {
return a.y < b.y;
} else {
return a.x < b.x;
}
}
int main() {
int n, m;
node r[100008];
int book[100008] = {0};
node a[100008], b[100008];
cin >> n >> m;
for (... | replace | 16 | 20 | 16 | 20 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define NMAX 110000
struct info {
int p;
int y;
int x;
};
int main(void) {
int n, m;
cin >> n >> m;
info py[NMAX];
for (int i = 0; i < m; i++) {
cin >> py[i].p >> py[i].y;
}
vector<int> mp[NMAX];
for (int i = 0; i < m; i++) {
... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define NMAX 110000
struct info {
int p;
int y;
int x;
};
int main(void) {
int n, m;
cin >> n >> m;
info py[NMAX];
for (int i = 0; i < m; i++) {
cin >> py[i].p >> py[i].y;
}
vector<int> mp[NMAX];
for (int i = 0; i < m; i++) {
... | replace | 27 | 29 | 27 | 29 | TLE | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define all(x) (x).begin(), (x).end()
using namespace std;
using P = pair<int, int>;
int main() {
int N, M;
cin >> N >> M;
vector<int> City[N + 1];
int P[M], Y[M];
for (int i = 0; i < M; i++) {
int p, y;
cin ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define all(x) (x).begin(), (x).end()
using namespace std;
using P = pair<int, int>;
int main() {
int N, M;
cin >> N >> M;
vector<int> City[N + 1];
int P[M], Y[M];
for (int i = 0; i < M; i++) {
int p, y;
cin ... | replace | 22 | 23 | 22 | 23 | 0 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define repi(i, a, b) for (int i = a; i <= (b); ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define repi(i, a, b) for (int i = a; i <= (b); ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()... | replace | 36 | 37 | 36 | 37 | -11 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb... | replace | 43 | 44 | 43 | 44 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> P(M), Y(M);
vector<vector<int>> PN(N);
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
PN[P[i] - 1].push_back(Y[i]);
}
for (auto &pn : PN)
sort(pn.begin(), pn... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> P(M), Y(M);
vector<vector<int>> PN(N);
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
PN[P[i] - 1].push_back(Y[i]);
}
for (auto &pn : PN)
sort(pn.begin(), pn... | replace | 19 | 27 | 19 | 22 | TLE | |
p03221 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> p(m), y(m);
std::vector<std::vector<int>> vec(n + 1);
for (int i ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> p(m), y(m);
std::vector<std::vector<int>> vec(n + 1);
for (int i ... | replace | 25 | 32 | 25 | 29 | TLE | |
p03221 | C++ | Runtime Error | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <array>
#include <cmath>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
int gcd(int x, int y) {
x = std::abs(x);
y = std::abs(y);
int a = std::max(x, y), b = s... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <array>
#include <cmath>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
int gcd(int x, int y) {
x = std::abs(x);
y = std::abs(y);
int a = std::max(x, y), b = s... | replace | 51 | 52 | 51 | 52 | 0 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
struct Edge {
long long to;
long long cost;
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, ll>;
const long long INF = 1LL << 60;
long ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
struct Edge {
long long to;
long long cost;
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, ll>;
const long long INF = 1LL << 60;
long ... | replace | 228 | 229 | 228 | 229 | 0 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
const int M = 1000;
int n, m, p[M], y[M];
vector<int> num[M];
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> p[i] >> y[i];
num[p... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
const int M = 100000;
int n, m, p[M], y[M];
vector<int> num[M];
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> p[i] >> y[i];
num... | replace | 10 | 11 | 10 | 11 | 0 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
auto ys = vector<pair<int, pair<int, int>>>(m);
auto ps = vector<int>(n);
for (int i = 0; i < m; ++i) {
int p, y;
cin >> p >> y;
ys[i] = make_pair(y, make_pair(... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
auto ys = vector<pair<int, pair<int, int>>>(m);
auto ps = vector<int>(m);
for (int i = 0; i < m; ++i) {
int p, y;
cin >> p >> y;
ys[i] = make_pair(y, make_pair(... | replace | 11 | 12 | 11 | 12 | 0 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T &... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T &... | replace | 34 | 35 | 34 | 35 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define ... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define ... | replace | 27 | 30 | 27 | 28 | TLE | |
p03221 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
const int INF = 2000000000;
int n, m;
int main() {
cin >> n >> m;
vector<vector<int>> v(n);
int ans_1[100000];
int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
const int INF = 2000000000;
int n, m;
int main() {
cin >> n >> m;
vector<vector<int>> v(n);
int ans_1[100000];
int... | replace | 25 | 28 | 25 | 28 | TLE | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int length(int n) {
int i = 1;
while (n != 0) {
n = n / 10;
++i;
}
return i;
}
int main() {
int n, m, i, j, k = 1;
cin >> n >> m;
vector<int> p(m), y(m), ans1(n, 1), ans2(n, 0);
map<int, pair<int, int>> mp;
for (i = 0; i < m; ++i) {
cin >> p[... | #include <bits/stdc++.h>
using namespace std;
int length(int n) {
int i = 1;
while (n != 0) {
n = n / 10;
++i;
}
return i;
}
int main() {
int n, m, i, j, k = 1;
cin >> n >> m;
vector<int> p(m), y(m), ans1(n, 1), ans2(m, 0);
map<int, pair<int, int>> mp;
for (i = 0; i < m; ++i) {
cin >> p[... | replace | 15 | 16 | 15 | 16 | 0 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) sort((a).rbegin(), (a).rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(a) a.begin(), a.end()
using namespace std;
int main() {
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) sort((a).rbegin(), (a).rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(a) a.begin(), a.end()
using namespace std;
int main() {
... | replace | 19 | 21 | 19 | 21 | 0 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template <class T> inline bool chmax(T &a, T ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template <class T> inline bool chmax(T &a, T ... | insert | 37 | 37 | 37 | 38 | -11 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef long long LL;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int mxsz = 1e5;
int n, m;
map<pii, int> mp;
vi pi[mxsz];
pii req[mxsz];
int main() {
// ios_base::sync_with_stdio(false);
// cin.tie... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef long long LL;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int mxsz = 1e5 + 5;
int n, m;
map<pii, int> mp;
vi pi[mxsz];
pii req[mxsz];
int main() {
// ios_base::sync_with_stdio(false);
// cin... | replace | 9 | 10 | 9 | 10 | 0 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> A;
#define int long long
int N, M;
pair<int, int> K[100001];
signed main() {
cin >> N >> M;
vector<A> vec[100001];
for (int i = 0; i < M; i++) {
int P, Y;
cin >> P >> Y;
vec[P].push_back(A(Y, i));
}
for (int i = 1; i <= N; i++) {... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> A;
#define int long long
int N, M;
pair<int, int> K[100001];
signed main() {
cin >> N >> M;
vector<A> vec[100001];
for (int i = 0; i < M; i++) {
int P, Y;
cin >> P >> Y;
vec[P].push_back(A(Y, i));
}
for (int i = 1; i <= N; i++) {... | replace | 16 | 18 | 16 | 20 | 0 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
ll p[m], y[m];
vector<ll> py[m];
for (int i = 0; i < m; i++)
cin >> p[i] >> y[i];
for (int i = 0; i < m; i++)
py[p[i]].push_back(y[i]);
for (int i = 0; i < n; i++)
sort(py[i + 1].begin(), ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
ll p[m], y[m];
vector<ll> py[100001];
for (int i = 0; i < m; i++)
cin >> p[i] >> y[i];
for (int i = 0; i < m; i++)
py[p[i]].push_back(y[i]);
for (int i = 0; i < n; i++)
sort(py[i + 1].begi... | replace | 7 | 8 | 7 | 8 | 0 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<map<int, int>> py(m + 1);
vector<vector<int>> numm(m + 1, vector<int>(2));
int tmp1, tmp2;
for (int i = 1; i <= m; i++) {
cin >> tmp1 >> tmp2;
py[tmp1][tmp2] = 0;
numm[i][0] = tmp1;
numm[i][1] = tm... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<map<int, int>> py(n + 1);
vector<vector<int>> numm(m + 1, vector<int>(2));
int tmp1, tmp2;
for (int i = 1; i <= m; i++) {
cin >> tmp1 >> tmp2;
py[tmp1][tmp2] = 0;
numm[i][0] = tmp1;
numm[i][1] = tm... | replace | 9 | 10 | 9 | 10 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using psi = pair<string, int>;
using pii = pair<int, int>;
using vlai = valarray<int>;
#define rep(i, n) for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using psi = pair<string, int>;
using pii = pair<int, int>;
using vlai = valarray<int>;
#define rep(i, n) for (int i = 0;... | replace | 46 | 51 | 46 | 49 | TLE | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int n, m;
int ph1[11000];
int ph2[11000];
int pm[11000];
struct xxx {
int x;
int y;
int id;
} a[1001001];
bool cmp(xxx a, xxx b) {
if (a.x == b.x)
return a.y < b.y;
else
return a.x < b.... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int n, m;
int ph1[110000];
int ph2[110000];
int pm[110000];
struct xxx {
int x;
int y;
int id;
} a[1001001];
bool cmp(xxx a, xxx b) {
if (a.x == b.x)
return a.y < b.y;
else
return a.x <... | replace | 7 | 10 | 7 | 10 | 0 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <iomanip> // std::setw(int), std::setfill(char)
#include <ios> // std::left, std::right
using namespace std;
t... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <iomanip> // std::setw(int), std::setfill(char)
#include <ios> // std::left, std::right
using namespace std;
t... | replace | 41 | 42 | 41 | 42 | 0 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize(3)
namespace ZDY {
#define res register
#define ri res int
#define ll long long
#define db double
#define sht short
#define il inline
#define MB template <class T>
#define Fur(i, x, y) for (ri i = x; i <= y; i++)
#define fur(i, x, y) for (i = x; i <= y; i++)
#define Fdr(i, ... | #include <bits/stdc++.h>
#pragma GCC optimize(3)
namespace ZDY {
#define res register
#define ri res int
#define ll long long
#define db double
#define sht short
#define il inline
#define MB template <class T>
#define Fur(i, x, y) for (ri i = x; i <= y; i++)
#define fur(i, x, y) for (i = x; i <= y; i++)
#define Fdr(i, ... | replace | 28 | 29 | 28 | 29 | 0 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, limit) for (int i = 0; i < limit; ++i)
#define LINT long long
int main() {
int N, M;
cin >> N >> M;
pair<int, int> p[M], pp[M];
int look[1000000001];
REP(i, M) {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, limit) for (int i = 0; i < limit; ++i)
#define LINT long long
int main() {
int N, M;
cin >> N >> M;
pair<int, int> p[M], pp[M];
map<int, int> look;
REP(i, M) {
... | replace | 14 | 15 | 14 | 15 | -11 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct pr {
int p, y;
};
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<int>> a(m + 1);
vector<pr> b(m);
for (int i = 0; i < m; ++i) {
int p, y;
cin >> p >> y;
a.at(p).emplace_back(y);
b.at(i).p = ... | #include <bits/stdc++.h>
using namespace std;
struct pr {
int p, y;
};
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<int>> a(n + 1);
vector<pr> b(m);
for (int i = 0; i < m; ++i) {
int p, y;
cin >> p >> y;
a.at(p).emplace_back(y);
b.at(i).p = ... | replace | 10 | 11 | 10 | 11 | 0 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> P(N), Y(N), ord[100010];
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
ord[P[i]].push_back(Y[i]);
}
for (int i = 1; i <= N; i++)
sort(ord[i].begin(), ord[i].end... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> P(M), Y(M), ord[100010];
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
ord[P[i]].push_back(Y[i]);
}
for (int i = 1; i <= N; i++)
sort(ord[i].begin(), ord[i].end... | replace | 8 | 9 | 8 | 9 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int l... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int l... | replace | 38 | 49 | 38 | 47 | TLE | |
p03221 | 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 pb push_back
#define mp make_pair
#define F first
#define S second
using ll = long long;
using itn = int;
using namespace std;
using Graph = vector<vector<int>>;
int GCD(int a, ... | #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 pb push_back
#define mp make_pair
#define F first
#define S second
using ll = long long;
using itn = int;
using namespace std;
using Graph = vector<vector<int>>;
int GCD(int a, ... | replace | 25 | 26 | 25 | 26 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, e) for (int i = (s); i < (e); i++)
#define FOR64(i, s, e) for (ll i = (s); i < (e); i++)
#define ALL(x) (x).begin(), (x).end()
#define SORT(b, e) sort((b), (e))
#define REV(b, e) reverse((b), (e))
#define VSORT(v) sort((v).begin(), (v).end())
#define VREV... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, e) for (int i = (s); i < (e); i++)
#define FOR64(i, s, e) for (ll i = (s); i < (e); i++)
#define ALL(x) (x).begin(), (x).end()
#define SORT(b, e) sort((b), (e))
#define REV(b, e) reverse((b), (e))
#define VSORT(v) sort((v).begin(), (v).end())
#define VREV... | replace | 34 | 36 | 34 | 37 | TLE | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<P> p, y;
rep(i, m) {
int a, b;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<P> p, y;
rep(i, m) {
int a, b;
... | replace | 20 | 21 | 20 | 21 | 0 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rip(i, n) (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
scanf("%d%d", &n, &m);
vector<pair<int, pair<int, int>>> da(m);
vector<int> p(m), y(m);
for
r... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rip(i, n) (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
scanf("%d%d", &n, &m);
vector<pair<int, pair<int, int>>> da(m);
vector<int> p(m), y(m);
for
r... | replace | 17 | 18 | 17 | 18 | -11 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if
// (a > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if
// (a > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
... | replace | 16 | 17 | 16 | 17 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> P(M), Y(M);
vector<int> V[100001];
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
V[P[i]].push_back(Y[i]);
}
for (int i = 1; i <= N; i++)
sort(V[i].begin(), V[i].end... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> P(M), Y(M);
vector<int> V[100001];
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
V[P[i]].push_back(Y[i]);
}
for (int i = 1; i <= N; i++)
sort(V[i].begin(), V[i].end... | replace | 19 | 22 | 19 | 21 | TLE | |
p03221 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> p(m);
vector<int> y(m);
map<int, vector<int>> city;
for (int i = 0; i < m; i++) {
cin >> p[i] >> y[i];
city[p[i]].push_back(y[i]);
}
for (auto &e : city) {
sort(e.second.begin(), e.second.end(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> p(m);
vector<int> y(m);
map<int, vector<int>> city;
for (int i = 0; i < m; i++) {
cin >> p[i] >> y[i];
city[p[i]].push_back(y[i]);
}
for (auto &e : city) {
sort(e.second.begin(), e.second.end(... | replace | 22 | 23 | 22 | 24 | TLE | |
p03221 | C++ | Time Limit Exceeded | #pragma region header
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define ll long long
#define ld long double
#define vi vector<int>
#define vvi vector<vector<int>>
#define vvvi vector<vector<vector<int>>>
#define vs vector<string>
#define vvs vector<vector<string>>
#define vvvs vector<... | #pragma region header
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define ll long long
#define ld long double
#define vi vector<int>
#define vvi vector<vector<int>>
#define vvvi vector<vector<vector<int>>>
#define vs vector<string>
#define vvs vector<vector<string>>
#define vvvs vector<... | replace | 241 | 253 | 241 | 253 | TLE | |
p03221 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
int main() {
int N, M;
std::cin >> N >> M;
int P[M], Y[M];
std::vector<std::vector<int>> PY(N);
for (int i = 0; i < M; ++i) {
std::cin >> P[i] >> Y[i];
PY[P[i] - 1].push_back(Y[i]);
}
for (int i = 0; i < N; ++i)
std... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
int main() {
int N, M;
std::cin >> N >> M;
int P[M], Y[M];
std::vector<std::vector<int>> PY(N);
for (int i = 0; i < M; ++i) {
std::cin >> P[i] >> Y[i];
PY[P[i] - 1].push_back(Y[i]);
}
for (int i = 0; i < N; ++i)
std... | replace | 18 | 26 | 18 | 24 | TLE | |
p03221 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <unordered_map>
#include <vector>
int main() {
std::array<std::vector<uint64_t>, 100001> prefYears;
std::array<int, 100000> p;
std::array<uint64_t, 100000> y;
int n, m;
std::scanf("%d %d"... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <unordered_map>
#include <vector>
int main() {
std::array<std::vector<uint64_t>, 100001> prefYears;
std::array<int, 100000> p;
std::array<uint64_t, 100000> y;
int n, m;
std::scanf("%d %d"... | replace | 22 | 24 | 22 | 24 | TLE | |
p03221 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// 変数デバッグ
#define DEB(variable) cout << #variable << '=' << variable << endl
// for簡易表記(引数ミス防止)
#defin... | #include <algorithm>
#include <array>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// 変数デバッグ
#define DEB(variable) cout << #variable << '=' << variable << endl
// for簡易表記(引数ミス防止)
#defin... | replace | 42 | 45 | 42 | 45 | TLE | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> P(n + 1);
vector<int> Y(n + 1);
vector<vector<int>> YS(n + 1);
for (int i = 0; i < m; i++) {
cin >> P[i] >> Y[i];
YS[P[i]].push_back(Y[i]);
}
for ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> P(m);
vector<int> Y(m);
vector<vector<int>> YS(n + 1);
for (int i = 0; i < m; i++) {
cin >> P[i] >> Y[i];
YS[P[i]].push_back(Y[i]);
}
for (int i =... | replace | 9 | 11 | 9 | 11 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int P[100000], Y[1000... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int P[100000], Y[1000... | replace | 28 | 35 | 28 | 37 | TLE | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <ios>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1e9 + 7;
#define put(n) cout << (n) << endl
#define rep(i, N) for (int(i) = 0; (i) < (N); ++(i))
#define rrep(i, N) for (int(i) = (N - 1); (i... | #include <algorithm>
#include <iomanip>
#include <ios>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1e9 + 7;
#define put(n) cout << (n) << endl
#define rep(i, N) for (int(i) = 0; (i) < (N); ++(i))
#define rrep(i, N) for (int(i) = (N - 1); (i... | replace | 21 | 22 | 21 | 22 | 0 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | replace | 39 | 40 | 39 | 40 | 0 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v),... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v),... | replace | 36 | 37 | 36 | 37 | 0 | |
p03221 | C++ | Runtime Error | /* 実行時間1s制限の場合10^6 1,000,000 : 余裕をもって間に合う10^7
10,000,000 : おそらく間に合う10^8 100,000,000 : 非常にシンプルな処理
でないと厳しい
*/
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long ... | /* 実行時間1s制限の場合10^6 1,000,000 : 余裕をもって間に合う10^7
10,000,000 : おそらく間に合う10^8 100,000,000 : 非常にシンプルな処理
でないと厳しい
*/
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long ... | replace | 137 | 138 | 137 | 138 | -11 | |
p03221 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
// typedef pair<int, int> P;
#define INF int(1e9)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
// typedef pair<int, int> P;
#define INF int(1e9)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define... | replace | 28 | 29 | 28 | 29 | TLE | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
long long MOD = 1e9 + 7;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> p(m), y(m);
vector<vector<int>> y_sort(n + 1);
rep(i, m) {
cin >> p[i]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
long long MOD = 1e9 + 7;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> p(m), y(m);
vector<vector<int>> y_sort(n + 1);
rep(i, m) {
cin >> p[i]... | replace | 18 | 19 | 18 | 19 | 0 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> pa;
vector<vector<int>> c(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
pa.push_back({a, b});
c[a].push_back(b);
}
for (int i = 0; i < c.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> pa;
vector<vector<int>> c(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
pa.push_back({a, b});
c[a].push_back(b);
}
for (int i = 0; i < c.... | replace | 22 | 23 | 22 | 24 | -11 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> pa;
vector<vector<pair<int, int>>> c(n);
for (int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
p--;
y--;
pa.emplace_back(p, y);
c[p].emplace_back(y, i);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> pa;
vector<vector<pair<int, int>>> c(n);
for (int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
p--;
y--;
pa.emplace_back(p, y);
c[p].emplace_back(y, i);
... | replace | 18 | 19 | 18 | 19 | -11 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
#define ok1 printf("ok1\n");
#define... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
#define ok1 printf("ok1\n");
#define... | replace | 59 | 60 | 59 | 60 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("input.txt", "r", stdin);
int n, m;
scanf("%d %d", &n, &m);
vector<int> p(m), y(m);
for (int i = 0; i < m; ++i) {
scanf("%d %d", &p[i], &y[i]);
}
vector<vector<int>> a(n, vector<int>(0));
for (int i = 0; i < m; ++i) {
a[p[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("input.txt", "r", stdin);
int n, m;
scanf("%d %d", &n, &m);
vector<int> p(m), y(m);
for (int i = 0; i < m; ++i) {
scanf("%d %d", &p[i], &y[i]);
}
vector<vector<int>> a(n, vector<int>(0));
for (int i = 0; i < m; ++i) {
a[p[i... | replace | 23 | 26 | 23 | 25 | TLE | |
p03221 | C++ | Runtime Error | #include <iomanip>
#include <ios>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct city {
long long year;
long long num;
long long pref;
long long order;
};
bool operator<(const struct city &a, const struct city &b) {
return a.year > b.year;
}
priority_queue<struct city> q... | #include <iomanip>
#include <ios>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct city {
long long year;
long long num;
long long pref;
long long order;
};
bool operator<(const struct city &a, const struct city &b) {
return a.year > b.year;
}
priority_queue<struct city> q... | replace | 18 | 19 | 18 | 19 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
using ll = long long;
using l... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
using ll = long long;
using l... | replace | 31 | 33 | 31 | 33 | TLE | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <climits>
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define srep(i, begin, end) for (__typeof(e... | #include <bits/stdc++.h>
#include <climits>
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define srep(i, begin, end) for (__typeof(e... | replace | 66 | 67 | 66 | 67 | 0 | |
p03221 | C++ | Runtime Error | #include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <sstream>
#include <string>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
map<int, list<pair<int, int>>> town;
town.clear();
int ken = 0, val = 0;
string ans[10000] = {""};
for (int i = 0; i < m;... | #include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <sstream>
#include <string>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
map<int, list<pair<int, int>>> town;
town.clear();
int ken = 0, val = 0;
string ans[100000] = {""};
for (int i = 0; i < m... | replace | 15 | 16 | 15 | 16 | 0 | |
p03221 | Python | Runtime Error | import sys
from collections import defaultdict
from copy import deepcopy
input = sys.stdin.readline
N, M = list(map(int, input().split()))
PY = []
for _ in range(M):
PY.append(list(map(int, input().split())))
sorted_PY = deepcopy(PY)
sorted_PY.sort(key=lambda x: x[1])
p_count_dict = defaultdict(lambda: 0)
y_dic... | import sys
from collections import defaultdict
from copy import deepcopy
input = sys.stdin.readline
N, M = list(map(int, input().split()))
PY = []
for _ in range(M):
PY.append(list(map(int, input().split())))
sorted_PY = deepcopy(PY)
sorted_PY.sort(key=lambda x: x[1])
p_count_dict = defaultdict(lambda: 0)
y_dic... | replace | 22 | 23 | 22 | 24 | 0 | |
p03221 | Python | Runtime Error | N, M = map(int, input().split())
X = [list(map(int, input().split())) for _ in range(M)]
res = [""] * M
ctr = [0] * (M + 1)
for i, (p, y) in sorted(enumerate(X), key=lambda x: (x[1][0], x[1][1])):
ctr[p] += 1
res[i] = "{:0>6}{:0>6}".format(p, ctr[p])
print(*res, sep="\n")
| N, M = map(int, input().split())
X = [list(map(int, input().split())) for _ in range(M)]
res = [""] * M
ctr = [0] * (N + 1)
for i, (p, y) in sorted(enumerate(X), key=lambda x: (x[1][0], x[1][1])):
ctr[p] += 1
res[i] = "{:0>6}{:0>6}".format(p, ctr[p])
print(*res, sep="\n")
| replace | 4 | 5 | 4 | 5 | 0 | |
p03221 | Python | Runtime Error | N, M = map(int, input().split())
timeline = []
for i in range(M):
P, Y = map(int, input().split())
timeline.append((Y, P, i))
timeline.sort()
count = [0] * (N + 1)
number = [(0, 0)] * M
for y, p, i in timeline:
count[p] += 1
number[i] = (p, count[p])
for i in range(M):
print(f"{number[i][0]:06}{numb... | N, M = map(int, input().split())
timeline = []
for i in range(M):
P, Y = map(int, input().split())
timeline.append((Y, P, i))
timeline.sort()
count = [0] * (N + 1)
number = [(0, 0)] * M
for y, p, i in timeline:
count[p] += 1
number[i] = (p, count[p])
for i in range(M):
print("{:06}{:06}".format(numb... | replace | 12 | 13 | 12 | 13 | 0 | |
p03221 | C++ | Runtime Error | #include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
struct City {
int prefecture;
int year;
int x;
};
int main() {
int N, M;
cin >> N >> M;
vector<City> city(M);
map<int, map<int, int>> years;
for (int i = 1; i <= M; i++) {
int Pi, Yi;
ci... | #include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
struct City {
int prefecture;
int year;
int x;
};
int main() {
int N, M;
cin >> N >> M;
vector<City> city(M + 1);
map<int, map<int, int>> years;
for (int i = 1; i <= M; i++) {
int Pi, Yi;
... | replace | 16 | 17 | 16 | 17 | -11 | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<int>> vvi;
const int MOD = 1e9 + 7;
const int INF = 2e9;
#define pb push_back
#define mp make_pair
#define mt make_tuple
template <class T> bool chmax(T... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<int>> vvi;
const int MOD = 1e9 + 7;
const int INF = 2e9;
#define pb push_back
#define mp make_pair
#define mt make_tuple
template <class T> bool chmax(T... | replace | 31 | 32 | 31 | 32 | 0 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> PP;
int main() {
int N, M;
cin >> N >> M;
vector<PP> C(M);
for (int i = 0; i < M; i++) {
int p, y;
cin >> p >> y;
C[i] = PP(P(p, y), i);
}
sort(C.begin(), C.end());
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> PP;
int main() {
int N, M;
cin >> N >> M;
vector<PP> C(M);
for (int i = 0; i < M; i++) {
int p, y;
cin >> p >> y;
C[i] = PP(P(p, y), i);
}
sort(C.begin(), C.end());
... | replace | 19 | 20 | 19 | 20 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main() {
int n, m;
cin >> n >> m;
vector<vector<in... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main() {
int n, m;
cin >> n >> m;
vector<vector<in... | replace | 28 | 38 | 28 | 33 | TLE | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define sum(a) accumulate(a.begin(), a.end(), 0LL)
#define put(i) cout << fixed << i << endl
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> p(m), y(m);
rep(i, m) cin >> p[i] >> y[i];
map... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define sum(a) accumulate(a.begin(), a.end(), 0LL)
#define put(i) cout << fixed << i << endl
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> p(m), y(m);
rep(i, m) cin >> p[i] >> y[i];
map... | replace | 18 | 19 | 18 | 19 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, long long M, std::vector<long long> P,
std::vector<long long> Y) {
map<ll, vector<ll>> PYmap;
for (ll i = 0; i < M; ++i) {
PYmap[P[i]].push_back(Y[i]);
}
for (auto &&m : PYmap) {
sort(begin(m.second),... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, long long M, std::vector<long long> P,
std::vector<long long> Y) {
map<ll, vector<ll>> PYmap;
for (ll i = 0; i < M; ++i) {
PYmap[P[i]].push_back(Y[i]);
}
for (auto &&m : PYmap) {
sort(begin(m.second),... | replace | 15 | 16 | 15 | 16 | TLE | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> p(n), y(n);
vector<vector<int>> data(
n); // (prefecture, year), be careful with the initialization...
for (int i = 0; i < m; i++) {
cin >> p[i] >> y[i];
data[p[i] - 1].push_back(y[i]);
}
for (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<long long int> p(m), y(m);
vector<vector<long long int>> data(
n); // (prefecture, year), be careful with the initialization...
for (int i = 0; i < m; i++) {
cin >> p[i] >> y[i];
data[p[i] - 1].push_back... | replace | 7 | 9 | 7 | 9 | 0 | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> p(n + 1);
vector<int> y(m + 1);
vector<int> id[n + 1];
for (int i = 0; i < m; i++) {
cin >> p[i] >> y[i];
id[p[i]].push_back(y[i]);
}
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> p(m + 1);
vector<int> y(m + 1);
vector<int> id[n + 1];
for (int i = 0; i < m; i++) {
cin >> p[i] >> y[i];
id[p[i]].push_back(y[i]);
}
for (int i = 0; i < n; i++) {
... | replace | 8 | 9 | 8 | 9 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE> void print_vec(const vector<TYPE> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE> void print_vec2(const vector<vector<TYPE>> &v) {
cout << endl;
cout <<... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE> void print_vec(const vector<TYPE> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE> void print_vec2(const vector<vector<TYPE>> &v) {
cout << endl;
cout <<... | replace | 56 | 59 | 56 | 57 | TLE | |
p03221 | C++ | Runtime Error | #include <iostream>
// #include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <utility>
#include <vector>
#pragma warning(disable : 4... | #include <iostream>
// #include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <utility>
#include <vector>
#pragma warning(disable : 4... | replace | 19 | 20 | 19 | 20 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> p(M, 0);
vector<int> yp(M, 0);
vector<vector<int>> y(N, vector<int>(0, 0));
for (int i = 0; i < M; ++i) {
int tmp_p, tmp_y;
cin >> tmp_p >> tmp_y;
--tmp_p;
p[i] = tmp_p;
yp[i] = tmp_y;
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> p(M, 0);
vector<int> yp(M, 0);
vector<vector<int>> y(N, vector<int>(0, 0));
for (int i = 0; i < M; ++i) {
int tmp_p, tmp_y;
cin >> tmp_p >> tmp_y;
--tmp_p;
p[i] = tmp_p;
yp[i] = tmp_y;
... | replace | 25 | 29 | 25 | 29 | TLE | |
p03221 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (int i = j; i < n; i++)
#define out(ans) cout << ans << endl;
const long long mod = 1e9 + 7;
typedef pair<int, int> P;
int main() {
int n, m;
cin >> n >> m;
int p[m + 10], y[m + 10];
P num[m + 10];
rep(i, 0, m) {
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (int i = j; i < n; i++)
#define out(ans) cout << ans << endl;
const long long mod = 1e9 + 7;
typedef pair<int, int> P;
int main() {
int n, m;
cin >> n >> m;
int p[m + 10], y[m + 10];
P num[m + 10];
rep(i, 0, m) {
... | replace | 32 | 37 | 32 | 35 | TLE | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7... | replace | 24 | 25 | 24 | 25 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(i, b,... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(i, b,... | replace | 36 | 37 | 36 | 37 | TLE | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
bool city(pair<P, int> a, pair<P, int> b) { return a.second < b.second; }
int main() {
int n... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
bool city(pair<P, int> a, pair<P, int> b) { return a.second < b.second; }
int main() {
int n... | replace | 18 | 19 | 18 | 19 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <random>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
const int MOD = 1000000007;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <random>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
const int MOD = 1000000007;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >... | replace | 31 | 32 | 31 | 32 | TLE | |
p03221 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
map<int, int> mp[n + 1];
int p[n + 1], y[n + 1];
REP(i, m) {
cin >> p[i] >> ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
map<int, int> mp[n + 1];
int p[m + 1], y[m + 1];
REP(i, m) {
cin >> p[i] >> ... | replace | 11 | 12 | 11 | 12 | 0 | |
p03221 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, x, n) for (int i = x; i < n; i++)
#define all(L) L.begin(), L.end()
using ll = long long;
#define RO 1
#define SI 2
#define PA 3
int N, M;
int P[100000]... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, x, n) for (int i = x; i < n; i++)
#define all(L) L.begin(), L.end()
using ll = long long;
#define RO 1
#define SI 2
#define PA 3
int N, M;
int P[100000]... | replace | 35 | 36 | 35 | 36 | TLE | |
p03221 | C++ | Time Limit Exceeded | /*
_ooOoo_
o8888888o
88" . "88 AC!AC!
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
... | /*
_ooOoo_
o8888888o
88" . "88 AC!AC!
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
... | replace | 78 | 80 | 78 | 80 | TLE | |
p03221 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
int main() {
int N, M;
cin >> N >> M;
vector<int> P(M), Y(M);
vector<vector<int>> A(N + 1, vector<int>());
rep(i, 0, M) {
cin >> P[i] >> Y[i];
A[P[i]].push_back(Y[i]);
}
rep(i, 0, M) sort(A[P[i]].begin(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
int main() {
int N, M;
cin >> N >> M;
vector<int> P(M), Y(M);
vector<vector<int>> A(N + 1, vector<int>());
rep(i, 0, M) {
cin >> P[i] >> Y[i];
A[P[i]].push_back(Y[i]);
}
rep(i, 1, N + 1) sort(A[i].begin... | replace | 13 | 14 | 13 | 14 | TLE | |
p03221 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <str... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <str... | replace | 91 | 92 | 91 | 96 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.