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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02682 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <ctype.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define ll long long int
#define rea... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <ctype.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define ll long long int
#define rea... | replace | 78 | 89 | 78 | 87 | TLE | |
p02682 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, C, K;
cin >> A >> B >> C >> K;
long long sum = 0;
for (int i = 0; i < K; ++i) {
if (A > 0) {
sum++;
A--;
} else if (B > 0) {
B--;
} else if (C > 0) {
sum--;
C--;
}
}
cout << sum << endl... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, C, K;
cin >> A >> B >> C >> K;
long long sum = 0;
if ((A + B) >= K && A < K) {
sum = A;
} else if (A >= K) {
sum = K;
} else {
sum = A - (K - A - B);
}
cout << sum << endl;
}
| replace | 7 | 18 | 7 | 13 | TLE | |
p02682 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b, c, k;
cin >> a >> b >> c >> k;
int count = 0;
rep(i, a + b + c) {
rep(j, a) {
if (k == 0) {
break;
}
count++;
k--;
}
rep(j, b) {
if (k == 0)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b, c, k;
cin >> a >> b >> c >> k;
int count = 0;
rep(i, k) {
rep(j, a) {
if (k == 0) {
break;
}
count++;
k--;
}
rep(j, b) {
if (k == 0) {
... | replace | 7 | 8 | 7 | 8 | TLE | |
p02682 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int ap, a0, am, k;
cin >> ap >> a0 >> am >> k;
long long ans = 0;
for (int i = 0; i < k; i++) {
if (ap > 0) {
ap--;
ans++;
} else if (a0 > 0) {
a0--;
} else {
am--;
ans--;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int ap, a0, am, k;
cin >> ap >> a0 >> am >> k;
if (a0 == 0 && am == 0) {
cout << k << endl;
return 0;
}
long long ans = 0;
for (int i = 0; i < k; i++) {
if (ap > 0) {
ap--;
ans++;
} else if (a0 > 0) {
a0--;
} e... | insert | 6 | 6 | 6 | 10 | TLE | |
p02683 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int a[12][12];
const int INF = 1001001001;
int main() {
int n, m, x;
cin >> n >> m >> x;
vector<int> c(n);
rep(i, n) {
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int a[12][12];
const int INF = 1001001001;
int main() {
int n, m, x;
cin >> n >> m >> x;
vector<int> c(n);
rep(i, ... | replace | 5 | 6 | 5 | 6 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const long long INF = 1e18;
int n, m;
long ... | #include <bits/stdc++.h>
using namespace std;
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;
}
const long long INF = 1e18;
int n, m;
long ... | replace | 35 | 36 | 35 | 36 | 0 | |
p02683 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define dunk(n) cout << n << endl
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
int n, m, x;
cin >> n >> m >> x;
vector<vector<int>> a(n, vector<int>(m));
vector<int>... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define dunk(n) cout << n << endl
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
int n, m, x;
cin >> n >> m >> x;
vector<vector<int>> a(n, vector<int>(m));
vector<int>... | replace | 12 | 13 | 12 | 13 | 0 | |
p02683 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main... | replace | 22 | 23 | 22 | 23 | 0 | |
p02683 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, x, a, c, ans;
cin >> n >> m >> x;
vector<int> C;
vector<vector<int>> A;
for (int i = 0; i < n; i++) {
cin >> c;
C.push_back(c);
for (int j = 0; j < m; j++) {
cin >> a;
A[i][j] = a;
}
}
ans = 10000... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, x, a, c, ans;
cin >> n >> m >> x;
vector<int> C;
vector<vector<int>> A(n, vector<int>(m));
for (int i = 0; i < n; i++) {
cin >> c;
C.push_back(c);
for (int j = 0; j < m; j++) {
cin >> a;
A[i][j] = a;
... | replace | 7 | 8 | 7 | 8 | -11 | |
p02683 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int a[12][12];
const int INF = 1001001001;
int main() {
int n, m, x;
cin >> n >> m >> x;
vector<int> c(n);
for (int i = 0; i < n; i++) {
cin >> c[i];
for (int j = 0; j < m; j++)
cin >> a[i][j];
}
int ans = INF;
// 全ビット探索
for (in... | #include <iostream>
#include <vector>
using namespace std;
int a[12][12];
const int INF = 1001001001;
int main() {
int n, m, x;
cin >> n >> m >> x;
vector<int> c(n);
for (int i = 0; i < n; i++) {
cin >> c[i];
for (int j = 0; j < m; j++)
cin >> a[i][j];
}
int ans = INF;
// 全ビット探索
for (in... | replace | 19 | 20 | 19 | 20 | TLE | |
p02683 | Python | Runtime Error | n, m, x = map(int, input().split())
c = [0] * n
a = [0] * n
for i in range(n):
xs = list(map(int, input().split()))
c[i] = xs[0]
a[i] = xs[1:]
ans = 10**9
for i in range(2**n):
csum = 0
asum = [0] * n
for j in range(n):
if (i >> j) & 1:
csum += c[j]
for k in range... | n, m, x = map(int, input().split())
c = [0] * n
a = [0] * n
for i in range(n):
xs = list(map(int, input().split()))
c[i] = xs[0]
a[i] = xs[1:]
ans = 10**9
for i in range(2**n):
csum = 0
asum = [0] * m
for j in range(n):
if (i >> j) & 1:
csum += c[j]
for k in range... | replace | 10 | 11 | 10 | 11 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int n, m, x;
cin >> n >> m >> x;
int a[n][n];
vector<int> c(n);
rep(i, n) {
cin >> c[i];
rep(j, m) cin >> a[i][j];
... | #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;
int main() {
int n, m, x;
cin >> n >> m >> x;
int a[n][m];
vector<int> c(n);
rep(i, n) {
cin >> c[i];
rep(j, m) cin >> a[i][j];
... | replace | 11 | 12 | 11 | 12 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
#define repr(i, from, to) for (int(i) = (from); (i) < (to); (i)++)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
// const bool debug=true;
const bool debug = false;
#define DEBUG if (debug == true)
#define all(x) begin((x)), end((x))
#define vprint(x) ... | #include <bits/stdc++.h>
#define repr(i, from, to) for (int(i) = (from); (i) < (to); (i)++)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
// const bool debug=true;
const bool debug = false;
#define DEBUG if (debug == true)
#define all(x) begin((x)), end((x))
#define vprint(x) ... | replace | 34 | 35 | 34 | 35 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int optimal = INT_MAX;
void call(vector<vector<int>> &v, int n, int m, int temp, int k, vector<int> tt,
int var, int cost[]) {
if (n == temp) {
int flag = 1;
for (int i = 0; i < m; i++) {
if (tt[i] < k) {
flag = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int optimal = INT_MAX;
void call(vector<vector<int>> &v, int n, int m, int temp, int k, vector<int> tt,
int var, int cost[]) {
if (n == temp) {
int flag = 1;
for (int i = 0; i < m; i++) {
if (tt[i] < k) {
flag = 0;
... | replace | 34 | 35 | 34 | 35 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
int main() {
int n, m, x;
cin >> n >> m >> x;
vi c(n);
vvi a(n, vi(m));
bitset<12> bb;
for (int ix = 0; ix < n; ix++) {
cin >> c.at(ix);
for (int ix2 = 0; ix2 < m; ix2++) {
cin >> a.at(ix).a... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
int main() {
int n, m, x;
cin >> n >> m >> x;
vi c(n);
vvi a(n, vi(m));
bitset<12> bb;
for (int ix = 0; ix < n; ix++) {
cin >> c.at(ix);
for (int ix2 = 0; ix2 < m; ix2++) {
cin >> a.at(ix).a... | replace | 22 | 23 | 22 | 23 | 0 | |
p02683 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int n, m, x;
int c[15];
int res = 1e9;
int a[15][15];
vector<int> ans;
void f(int i) {
// cout << i << endl;
if (i == n) {
vector<int> A(n, 0);
int sum = 0;
for (int j = 0; j < ans.size(); j++) {
sum += c[ans[j]];
for (int k = 0;... | #include <iostream>
#include <vector>
using namespace std;
int n, m, x;
int c[15];
int res = 1e9;
int a[15][15];
vector<int> ans;
void f(int i) {
// cout << i << endl;
if (i == n) {
vector<int> A(m, 0);
int sum = 0;
for (int j = 0; j < ans.size(); j++) {
sum += c[ans[j]];
for (int k = 0;... | replace | 14 | 15 | 14 | 15 | 0 | |
p02683 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int INF = 1000000007;
int main() {
int n, m, x;
cin >> n >> m >> x;
vector<int> c(n);
vector<vector<int>> a(n, vector<int>(m, 0));
for (int i = 0; i < n; i++) {
cin >> c[i];
for (int j = 0; j < m; j++)
cin >> a[i][j];
}... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int INF = 1000000007;
int main() {
int n, m, x;
cin >> n >> m >> x;
vector<int> c(n);
vector<vector<int>> a(n, vector<int>(m, 0));
for (int i = 0; i < n; i++) {
cin >> c[i];
for (int j = 0; j < m; j++)
cin >> a[i][j];
}... | replace | 17 | 18 | 17 | 18 | TLE | |
p02683 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int c[13], a[13][13];
int main() {
ios::sync_with_stdio(false);
int n, m, x, maxx = 10000000, k, sf = 0;
cin >> n >> m >> x;
for (int i = 1; i <= n; i++) {
cin >> c[i];
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
}
}
int book[n + 1], unders... | #include <bits/stdc++.h>
using namespace std;
int c[13], a[13][13];
int main() {
ios::sync_with_stdio(false);
int n, m, x, maxx = 10000000, k, sf = 0;
cin >> n >> m >> x;
for (int i = 1; i <= n; i++) {
cin >> c[i];
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
}
}
int book[n + 1], unders... | replace | 47 | 48 | 47 | 48 | TLE | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define F first
#define S second
using namespace std;
ll MOD = 1000000007;
int ans = INT_MAX;
int fd = -1;
int n, m, x;
void back(int cost, int ind, vector<vector<int>> &mp, vector<int> &c,
vector<int> vals) {
int f = 1;
for (int i = ... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define F first
#define S second
using namespace std;
ll MOD = 1000000007;
int ans = INT_MAX;
int fd = -1;
int n, m, x;
void back(int cost, int ind, vector<vector<int>> &mp, vector<int> &c,
vector<int> vals) {
int f = 1;
for (int i = ... | replace | 51 | 52 | 51 | 52 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
... | replace | 44 | 45 | 44 | 50 | 0 | |
p02683 | C++ | Runtime Error | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#in... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#in... | replace | 191 | 192 | 191 | 192 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
// #define ll long long
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
// #define ll long long
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1... | replace | 60 | 61 | 60 | 61 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m, x;
cin >> n >> m >> x;
vector<int> C(12);
vector<vector<int>> pa(n, vector<int>(m));
rep(i, n) {
cin >> C.at(i);
rep(j, m) { cin >> pa.at... | #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>;
int main() {
int n, m, x;
cin >> n >> m >> x;
vector<int> C(12);
vector<vector<int>> pa(n, vector<int>(m));
rep(i, n) {
cin >> C.at(i);
rep(j, m) { cin >> pa.at... | replace | 21 | 22 | 21 | 22 | 0 | |
p02683 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, x;
cin >> n >> m >> x;
vector<int> c(n);
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < n; ++i) {
cin >> c.at(i);
for (int j = 0; j < m; ++j) {
cin >> a.at(i).at(j);
}
}
int ans = 10000000... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, x;
cin >> n >> m >> x;
vector<int> c(n);
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < n; ++i) {
cin >> c.at(i);
for (int j = 0; j < m; ++j) {
cin >> a.at(i).at(j);
}
}
int ans = 10000000... | replace | 20 | 21 | 20 | 21 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m, x;
cin >> n >> m >> x;
vector<vector<ll>> a(n);
vector<ll> c(n);
ll ans = (1 << 29);
for (int i = 0; i < n; i++) {
cin >> c.at(i);
a.at(i).resize(m);
for (int j = 0; j < m; j++) {
cin >> a.at(i).at(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m, x;
cin >> n >> m >> x;
vector<vector<ll>> a(n);
vector<ll> c(n);
ll ans = (1 << 29);
for (int i = 0; i < n; i++) {
cin >> c.at(i);
a.at(i).resize(m);
for (int j = 0; j < m; j++) {
cin >> a.at(i).at(... | replace | 20 | 21 | 20 | 21 | 0 | |
p02683 | C++ | Time Limit Exceeded | /*
Mbak Sana Dong
Mbak Chaeyoung Dong
*/
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
vector<int> vi[105];
int cost[105];
int main() {
int n, i, j, k, x, y, ans, curr, temp, m;
int tc;
cin >> n >> m >> x;
for (i = 1; i <= n; i++) {
cin >> cost[i];
for (j = 1; j <= m; j+... | /*
Mbak Sana Dong
Mbak Chaeyoung Dong
*/
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
vector<int> vi[105];
int cost[105];
int main() {
int n, i, j, k, x, y, ans, curr, temp, m;
int tc;
cin >> n >> m >> x;
for (i = 1; i <= n; i++) {
cin >> cost[i];
for (j = 1; j <= m; j+... | replace | 24 | 25 | 24 | 25 | TLE | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, t, a, b, c, m, x, mi, aux;
cin >> n >> m >> x;
deque<long> A[n];
long R[n];
long au[n];
for (int i = 0; i < n; i++) {
cin >> R[i];
for (int l = 0; l < m; l++) {
cin >> a;
A[i].push_back(a);
}
}
mi = 10000000;
f... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, t, a, b, c, m, x, mi, aux;
cin >> n >> m >> x;
deque<long> A[n];
long R[n];
long au[m];
for (int i = 0; i < n; i++) {
cin >> R[i];
for (int l = 0; l < m; l++) {
cin >> a;
A[i].push_back(a);
}
}
mi = 10000000;
f... | replace | 8 | 9 | 8 | 9 | 0 | |
p02683 | C++ | Runtime Error | /**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int32_t, int32_t>;
int32_t N, M, X;
int32_t book_cost[12];
int32_t A[12][12];
int32_t minimum_cost;
int32_t look_up[1 << 11];
int32_t Decode(const int32_t tried_book, vector<bool> bo... | /**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int32_t, int32_t>;
int32_t N, M, X;
int32_t book_cost[12];
int32_t A[12][12];
int32_t minimum_cost;
int32_t look_up[1 << 13];
int32_t Decode(const int32_t tried_book, vector<bool> bo... | replace | 15 | 16 | 15 | 16 | 0 | |
p02683 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | replace | 74 | 75 | 74 | 75 | 0 | |
p02683 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, m, x;
cin >> n >> m >> x;
vector<int> C(n);
vector<vector<ll>> A(n, vector<ll>(m));
for (int i = 0; i < n; i++) {
cin >> C[i];
for (i... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, m, x;
cin >> n >> m >> x;
vector<int> C(n);
vector<vector<ll>> A(n, vector<ll>(m));
for (int i = 0; i < n; i++) {
cin >> C[i];
for (i... | replace | 22 | 28 | 22 | 28 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, X; // N冊の参考書、M個のアルゴリズム、理解度X
cin >> N >> M >> X;
vector<vector<int>> A(N, vector<int>(M));
vector<int> kingaku(N);
for (int i = 0; i < N; i++) {
cin >> kingaku[i];
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, X; // N冊の参考書、M個のアルゴリズム、理解度X
cin >> N >> M >> X;
vector<vector<int>> A(N, vector<int>(M));
vector<int> kingaku(N);
for (int i = 0; i < N; i++) {
cin >> kingaku[i];
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
... | replace | 19 | 21 | 19 | 20 | 0 | |
p02683 | C++ | Runtime Error | // God put a smile upon your face <3
#include <bits/stdc++.h>`
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair<long long, long long>
#define fastio \
ios_base::sync_with_stdio(fal... | // God put a smile upon your face <3
#include <bits/stdc++.h>`
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair<long long, long long>
#define fastio \
ios_base::sync_with_stdio(fal... | replace | 60 | 61 | 60 | 61 | 0 | |
p02683 | C++ | Runtime Error | // SPDX-License-Identifier: Apache-2.0
// Copyright (C) 2020 Bjarni Dagur Thor Karason
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (__typeof(a) i = (a); i < (b); i++)
#define MP make_pair
#define PB push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef ... | // SPDX-License-Identifier: Apache-2.0
// Copyright (C) 2020 Bjarni Dagur Thor Karason
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (__typeof(a) i = (a); i < (b); i++)
#define MP make_pair
#define PB push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef ... | replace | 49 | 50 | 49 | 50 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
#define lint long long
using namespace std;
int main() {
lint N, M, X;
cin >> N >> M >> X;
vector<lint> C(N);
vector<vector<lint>> A(N, vector<lint>(M));
vector<vector<lint>> rikai(pow(2, N), vector<lint>(M));
vector<lint> price(pow(2, N));
vector<bool> able(pow(2, N), false);
... | #include <bits/stdc++.h>
#define lint long long
using namespace std;
int main() {
lint N, M, X;
cin >> N >> M >> X;
vector<lint> C(N);
vector<vector<lint>> A(N, vector<lint>(M));
vector<vector<lint>> rikai(pow(2, N), vector<lint>(M));
vector<lint> price(pow(2, N));
vector<bool> able(pow(2, N), false);
... | replace | 52 | 57 | 52 | 57 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VI vector<int>
#define VL vector<ll>
#define PII pair<int, int>
#define VII vector<PII>
#define mp make_pair
#define pb push_back
#define vt vector
#define PI acos(-1)
#define ld long double
#define endl "\n"
#define all(c) (c).begin(), (c).end... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VI vector<int>
#define VL vector<ll>
#define PII pair<int, int>
#define VII vector<PII>
#define mp make_pair
#define pb push_back
#define vt vector
#define PI acos(-1)
#define ld long double
#define endl "\n"
#define all(c) (c).begin(), (c).end... | replace | 34 | 35 | 34 | 35 | 0 | |
p02683 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
int n, m, x;
vector<vector<int>> vec;
ll smallest = 1000000000000;
void dfs(vector<int> v, vector<bool> flag, int length) {
if (v.size() =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
int n, m, x;
vector<vector<int>> vec;
ll smallest = 1000000000000;
void dfs(vector<int> v, vector<bool> flag, int length) {
if (v.size() =... | replace | 33 | 34 | 33 | 34 | TLE | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename type> type BaseChange(type num, type base, type digit) {
for (type i = 0; i < digit; i++) {
num /= base;
}
return num % base;
}
int main() {
// 基本データ入力
long long n, m, x;
cin >> n >> m >> x;
// コストとデータ入力
vector<long long> c(n);
v... | #include <bits/stdc++.h>
using namespace std;
template <typename type> type BaseChange(type num, type base, type digit) {
for (type i = 0; i < digit; i++) {
num /= base;
}
return num % base;
}
int main() {
// 基本データ入力
long long n, m, x;
cin >> n >> m >> x;
// コストとデータ入力
vector<long long> c(n);
v... | replace | 18 | 19 | 18 | 19 | 0 | |
p02683 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
std::vector<int> res;
int n, m, x;
std::vector<std::vector<int>> vec;
std::vector<int> book_prices;
int main() {
std::cin >> n >> m >> x;
book_prices.assign(n, 0);
vec.assign(n, std::vector<int>(m, 0));
for (int i = 0; i < n; i++) {
std::cin >> b... | #include <algorithm>
#include <iostream>
#include <vector>
std::vector<int> res;
int n, m, x;
std::vector<std::vector<int>> vec;
std::vector<int> book_prices;
int main() {
std::cin >> n >> m >> x;
book_prices.assign(n, 0);
vec.assign(n, std::vector<int>(m, 0));
for (int i = 0; i < n; i++) {
std::cin >> b... | replace | 21 | 22 | 21 | 22 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
const long long int INF = 1LL << 60;
const long long int mod = 1e9 + 7;
int main() {
int N, M, X;
cin >> N >> M >> X;
vector<int> C(N + 1);
vector<vector<int>> A(N + 1, vector<int>(N + 1, 0));
vector<long long> sum_a(M + 1, 0);
for (int i ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
const long long int INF = 1LL << 60;
const long long int mod = 1e9 + 7;
int main() {
int N, M, X;
cin >> N >> M >> X;
vector<int> C(N + 1);
vector<vector<int>> A(N + 1, vector<int>(M + 1, 0));
vector<long long> sum_a(M + 1, 0);
for (int i ... | replace | 12 | 13 | 12 | 13 | 0 | |
p02683 | C++ | Runtime Error | // Template //
#include <bits/stdc++.h>
using namespace std;
// マクロ //
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define req(i, f, N) for (int i = f; i < (int)(N); i++)
#define all(x) x.begin(), x.end()
#define sort(x) sort(all(x))
#define uniq(x) x.erase(unique(all(x)), x.end())
#define vsum(x) accumulate(... | // Template //
#include <bits/stdc++.h>
using namespace std;
// マクロ //
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define req(i, f, N) for (int i = f; i < (int)(N); i++)
#define all(x) x.begin(), x.end()
#define sort(x) sort(all(x))
#define uniq(x) x.erase(unique(all(x)), x.end())
#define vsum(x) accumulate(... | replace | 139 | 141 | 139 | 141 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N, M, X;
cin >> N >> M >> X;
vector<int> C(N);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
cin >> C[i];
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int sum0 = 1200000;... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N, M, X;
cin >> N >> M >> X;
vector<int> C(N);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
cin >> C[i];
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int sum0 = 1200000;... | replace | 19 | 21 | 19 | 23 | 0 | |
p02683 | Python | Runtime Error | n, m, x = map(int, input().split())
prace = []
know = []
for i in range(n):
acc = list(map(int, input().split()))
prace.append(acc[0])
know.append(acc[1:])
ans = 10**10
for i in range(2**n):
und = [0 for i in range(m)]
f = "{:b}".format(i)
s = f.zfill(m)
mm = 0
for j in range(len(s)):
... | n, m, x = map(int, input().split())
prace = []
know = []
for i in range(n):
acc = list(map(int, input().split()))
prace.append(acc[0])
know.append(acc[1:])
ans = 10**10
for i in range(2**n):
und = [0 for i in range(m)]
f = "{:b}".format(i)
s = f.zfill(n)
mm = 0
for j in range(len(s)):
... | replace | 12 | 13 | 12 | 13 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
typedef long long ll;
typedef pair<int, int> pii;
const int inf = 1010001000;
const ll INF = 1001000100010001000;
const int mod = (int)1e9 + 7;
int main() {
int n, m, x;
cin >> n >> m >... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
typedef long long ll;
typedef pair<int, int> pii;
const int inf = 1010001000;
const ll INF = 1001000100010001000;
const int mod = (int)1e9 + 7;
int main() {
int n, m, x;
cin >> n >> m >... | replace | 22 | 23 | 22 | 23 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, X;
cin >> N >> M >> X;
vector<int> price(12, 0);
vector<vector<int>> add(N, vector<int>(M));
for (int i = 0; i < N; i++) {
cin >> price.at(i);
for (int j = 0; j < M; j++) {
cin >> add.at(i).at(j);
}
}
int m = 0;
for ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, X;
cin >> N >> M >> X;
vector<int> price(12, 0);
vector<vector<int>> add(N, vector<int>(M));
for (int i = 0; i < N; i++) {
cin >> price.at(i);
for (int j = 0; j < M; j++) {
cin >> add.at(i).at(j);
}
}
int m = 0;
for ... | replace | 21 | 22 | 21 | 22 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 9) >= this->size() (which is 3)
|
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
// static const int MAX = 1e6;
// static const int NIL = -1;
// static const ll INF = 1<<21;
// static const ll MOD = 1e9 + 7;
bool compPair(const pint &ar... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
// static const int MAX = 1e6;
// static const int NIL = -1;
// static const ll INF = 1<<21;
// static const ll MOD = 1e9 + 7;
bool compPair(const pint &ar... | replace | 31 | 32 | 31 | 32 | 0 | |
p02683 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const int MAX = 1001001001;
int main() {
int N, M, X;
std::cin >> N >> M >> X;
std::vector<int> C(N);
std::vector<std::vector<int>> A(N, std::vector<int>(N));
for (int i = 0; i < N; i++) {
s... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const int MAX = 1001001001;
int main() {
int N, M, X;
std::cin >> N >> M >> X;
std::vector<int> C(N);
std::vector<std::vector<int>> A(N, std::vector<int>(M));
for (int i = 0; i < N; i++) {
s... | replace | 14 | 15 | 14 | 15 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, X;
cin >> N >> M >> X;
vector<vector<int>> A(N, vector<int>(M));
vector<int> MAX(M, 0);
vector<int> c(N);
for (int i = 0; i < N; i++) {
cin >> c[i];
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int ans = 200000... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, X;
cin >> N >> M >> X;
vector<vector<int>> A(N, vector<int>(M));
vector<int> MAX(M, 0);
vector<int> c(N);
for (int i = 0; i < N; i++) {
cin >> c[i];
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int ans = 200000... | replace | 18 | 19 | 18 | 19 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL << 60;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
re... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL << 60;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
re... | replace | 45 | 46 | 45 | 46 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define Sort(a) sort(a.begin(), a.end())
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
templa... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define Sort(a) sort(a.begin(), a.end())
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
templa... | replace | 36 | 37 | 36 | 37 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
bool provera(vector<long long> &niz, int &m, long long &x) {
for (int i = 0; i < m; i++)
if (niz[i] < x)
return false;
return true;
}
long long f(vector<vector<long long>> &v, vector<long long> &cene, int &n,
int &m, long long &x, vector<long lon... | #include <bits/stdc++.h>
using namespace std;
bool provera(vector<long long> &niz, int &m, long long &x) {
for (int i = 0; i < m; i++)
if (niz[i] < x)
return false;
return true;
}
long long f(vector<vector<long long>> &v, vector<long long> &cene, int &n,
int &m, long long &x, vector<long lon... | replace | 42 | 43 | 42 | 43 | 0 | |
p02683 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
int r = x % y;
if (r == 0) {
return y;
}
return gcd(y, r);
}
int main() {
int N, M, X;
cin >> N >> M >> X;
vector<int> C(N);
vector<vector<int>> A(N, vect... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
int r = x % y;
if (r == 0) {
return y;
}
return gcd(y, r);
}
int main() {
int N, M, X;
cin >> N >> M >> X;
vector<int> C(N);
vector<vector<int>> A(N, vect... | replace | 30 | 31 | 30 | 31 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts...... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts...... | replace | 33 | 34 | 33 | 34 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
#define two(a) (1 << (a))
#define LINF (1ll << 61)
#define EPS (1e-14)
#define Lshift(a, b) ((a) << (b))
#define Rshift(a, b) ((a) >> (b))
#define rep(a, b) for (a = 0; a < b; a++)
#define xrep(a, b, c) for (a = b; a < c; a++)
#define INF (1 << 29)
#define sz(a) int(a.size())
#define mset(x) me... | #include <bits/stdc++.h>
#define two(a) (1 << (a))
#define LINF (1ll << 61)
#define EPS (1e-14)
#define Lshift(a, b) ((a) << (b))
#define Rshift(a, b) ((a) >> (b))
#define rep(a, b) for (a = 0; a < b; a++)
#define xrep(a, b, c) for (a = b; a < c; a++)
#define INF (1 << 29)
#define sz(a) int(a.size())
#define mset(x) me... | replace | 37 | 38 | 37 | 38 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.1415926535897932384626433832795028
#define INF (1 << 29)
#define LINF (1LL << 60)
using namespace std;
using INT = long long;
using P = pair<int, int>;
int main() {
int n, m, x;
cin >> n >> m >> x;
vector<vector<int>> c;
c.resi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.1415926535897932384626433832795028
#define INF (1 << 29)
#define LINF (1LL << 60)
using namespace std;
using INT = long long;
using P = pair<int, int>;
int main() {
int n, m, x;
cin >> n >> m >> x;
vector<vector<int>> c;
c.resi... | replace | 29 | 30 | 29 | 30 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) ... | replace | 193 | 194 | 193 | 194 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, x;
cin >> n >> m >> x;
int c[50], a[50][50], sum[50], ans[50] = {0}, cnt = 0;
for (int i = 1; i <= n; i++) {
cin >> c[i];
for (int j = 1; j <= m; j++)
cin >> a[i][j];
}
for (int i = 0; i < (1 << n); i++) {
memset(sum, 0, ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, x;
cin >> n >> m >> x;
int c[50], a[50][50], sum[50], ans[4097], cnt = 0;
memset(ans, 0, sizeof(ans));
for (int i = 1; i <= n; i++) {
cin >> c[i];
for (int j = 1; j <= m; j++)
cin >> a[i][j];
}
for (int i = 0; i < (1 << n);... | replace | 5 | 6 | 5 | 7 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
int a[15][15];
int price[15];
int main() {
int n, m, x;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
int a[15][15];
int price[15];
int main() {
int n, m, x;
... | replace | 25 | 26 | 25 | 26 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MIN_VAL = 1001001001;
int main(void) {
int N, M, X;
cin >> N >> M >> X;
vector<int> C(N);
int A[N][N];
for (int i = 0; i < N; i++) {
cin >> C[i];
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
long long int ans = MIN_VAL;
f... | #include <bits/stdc++.h>
using namespace std;
const int MIN_VAL = 1001001001;
int main(void) {
int N, M, X;
cin >> N >> M >> X;
vector<int> C(N);
int A[12][12];
for (int i = 0; i < N; i++) {
cin >> C[i];
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
long long int ans = MIN_VAL;
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02683 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<ll>>;
int main() {
ll N, K, b;
cin >> N >> K >> b;
vector<vector<ll>> vec(N, vector<ll>(K + 1));
ll d = 0;
for (ll i = 0; i < N; i++) {
for (ll j = 0; j < K + 1; j++) {
cin >> vec.at(i).at(j);
}
d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<ll>>;
int main() {
ll N, K, b;
cin >> N >> K >> b;
vector<vector<ll>> vec(N, vector<ll>(K + 1));
ll d = 0;
for (ll i = 0; i < N; i++) {
for (ll j = 0; j < K + 1; j++) {
cin >> vec.at(i).at(j);
}
d... | replace | 19 | 20 | 19 | 20 | 0 | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdlib.h>
#include <vector>
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
// freopen("input.txt","r",stdin);
/... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdlib.h>
#include <vector>
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
// freopen("input.txt","r",stdin);
/... | replace | 75 | 76 | 75 | 76 | 0 | |
p02684 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 1000000000 + 7;
int main() {
int N;
ll K;
cin >> N >> K;
int log_K = floor(log2(K));
cerr << N << " " << log_K << endl;
vector<vector<int>> next(log_K + 1, vector<int>(N));
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 1000000000 + 7;
int main() {
int N;
ll K;
cin >> N >> K;
int log_K = floor(log2(K));
cerr << N << " " << log_K << endl;
vector<vector<int>> next(log_K + 1, vector<int>(N));
for (int i = 0; i... | replace | 29 | 30 | 29 | 30 | TLE | |
p02684 | C++ | Runtime Error | // 17571@nith.ac.in @Ankit Verma
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define MP make_pair
#define int long long
#define ll long long
#define inf 0x3f3f3f3f
#define MOD 1000000007
#define ld long double
#define eb emplace_back
#define pii pair<int, int>
#... | // 17571@nith.ac.in @Ankit Verma
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define MP make_pair
#define int long long
#define ll long long
#define inf 0x3f3f3f3f
#define MOD 1000000007
#define ld long double
#define eb emplace_back
#define pii pair<int, int>
#... | replace | 34 | 35 | 34 | 35 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define loop(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
ll n, k;
cin >> n >> k;
vector<int> a(n), s, done(n + 1, -1);
int c = 1, l = 0;
loop(i, n) {
cin >> a[i];
done[i] = false;
}
int v = 1;
... | #include <bits/stdc++.h>
#define loop(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
ll n, k;
cin >> n >> k;
vector<int> a(n), s, done(n + 1, -1);
int c = 1, l = 0;
loop(i, n) { cin >> a[i]; }
int v = 1;
while (done[v] == -1) {
... | replace | 12 | 16 | 12 | 13 | -8 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
A[i]--;
}
vector<int> G(0);
vector<int> kai(N, 0);
int now = 0, fin = 0, saki = 0, sta = 0;
G.push_back(0);
while (G.size... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
A[i]--;
}
vector<int> G(0);
vector<int> kai(N, 0);
int now = 0, fin = 0, saki = 0, sta = 0;
G.push_back(0);
while (G.size... | replace | 16 | 17 | 16 | 17 | -8 | |
p02684 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++... | replace | 68 | 69 | 68 | 69 | TLE | |
p02684 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | replace | 170 | 173 | 170 | 178 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
/* 大文字を小文字に変換 */
char tolower(char c) { return (c + 0x20); }
/* 小文字を大文字に変換 */
char toupr(char c) { return (c - 0x20); }
// if('A'<=s[i] && s[i]<='Z') s[i] += 'a'-'A';
/*
string s = "a... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
/* 大文字を小文字に変換 */
char tolower(char c) { return (c + 0x20); }
/* 小文字を大文字に変換 */
char toupr(char c) { return (c - 0x20); }
// if('A'<=s[i] && s[i]<='Z') s[i] += 'a'-'A';
/*
string s = "a... | replace | 23 | 24 | 23 | 24 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lli = long long;
using pii = pair<int, int>;
#define rep(i, k, n) for (int i = (k); i != int(n); ++i)
#define sz(x) x.size()
#define all(x) x.begin(), x.end()
#define dbg(x) cout << #x << '=' << x << '\n'
#define dbg2(x, y) cout << #x << '=' << x << ' ' << #y << '='... | #include <bits/stdc++.h>
using namespace std;
using lli = long long;
using pii = pair<int, int>;
#define rep(i, k, n) for (int i = (k); i != int(n); ++i)
#define sz(x) x.size()
#define all(x) x.begin(), x.end()
#define dbg(x) cout << #x << '=' << x << '\n'
#define dbg2(x, y) cout << #x << '=' << x << ' ' << #y << '='... | replace | 24 | 25 | 24 | 25 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
if (k <= 200000) {
int q = 0;
while (k) {
q = a[q]... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
if (k <= 200000) {
int q = 0;
while (k) {
q = a[q]... | replace | 22 | 24 | 22 | 24 | 0 | |
p02684 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 1; i <= n; i++) {
cin >> a[... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
ci... | replace | 11 | 12 | 11 | 12 | 0 | |
p02684 | C++ | Runtime Error | /***************************************** START OF TEMPLATE
* *********************************************/
#include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(0); ... | /***************************************** START OF TEMPLATE
* *********************************************/
#include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(0); ... | delete | 83 | 85 | 83 | 83 | 0 | |
p02684 | C++ | Runtime Error | // #pragma GCC optimize(3,"Ofast","inline")
// #pragma GCC optimize(2)
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack... | // #pragma GCC optimize(3,"Ofast","inline")
// #pragma GCC optimize(2)
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack... | replace | 58 | 59 | 58 | 59 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
int main() {
ll n, k;
vector<ll> v(10000), c(10000);
cin >> n >> k;
for (ll i = 0; i < n; i++) {
cin >> v[i];
v[i]--;
}
ll now = 0;
bool can = true;
for (ll i = 1; i <= k; i++) {
if (c[now] && can) {
can = false;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
int main() {
ll n, k;
vector<ll> v(1000000), c(1000000);
cin >> n >> k;
for (ll i = 0; i < n; i++) {
cin >> v[i];
v[i]--;
}
ll now = 0;
bool can = true;
for (ll i = 1; i <= k; i++) {
if (c[now] && can) {
can = fal... | replace | 6 | 7 | 6 | 7 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REPA(i, a) \
for (ll i = 0; i < (ll)(a.siz... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REPA(i, a) \
for (ll i = 0; i < (ll)(a.siz... | replace | 40 | 42 | 40 | 42 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02684 | C++ | Runtime Error | #include <iostream>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int D = 60; // 2の60乗まででダブリングの表が足りるので60．
const int MAX_N = 200010;
int to[D][MAX_N];
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
long long k;
cin >> n >> k;
REP(i, n) {
cin >> to[0][i];... | #include <iostream>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int D = 60; // 2の60乗まででダブリングの表が足りるので60．
const int MAX_N = 200010;
int to[D][MAX_N];
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
long long k;
cin >> n >> k;
REP(i, n) {
cin >> to[0][i];... | replace | 22 | 23 | 22 | 23 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
bool b[200001];
int a[200001];
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
b[i] = false;
}
int c = 0;
int p = 1;
while (b[p] == false) {
b[p] = true;
p = a[p];
c++;
}
// cout << p <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
bool b[200001];
int a[200001];
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
b[i] = false;
}
int c = 0;
int p = 1;
while (b[p] == false) {
b[p] = true;
p = a[p];
c++;
}
// cout << p <<... | replace | 23 | 29 | 23 | 27 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long A[200005], C[200005];
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
long long N, K;
cin >> N >> K;
for (long long i = 1; i <= N; ++i) {
cin >> A[i];
}
long long curr = 1, move = 1, len, moves;
vec... | #include <bits/stdc++.h>
using namespace std;
long long A[200005], C[200005];
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
long long N, K;
cin >> N >> K;
for (long long i = 1; i <= N; ++i) {
cin >> A[i];
}
long long curr = 1, move = 1, len, moves;
if ... | insert | 17 | 17 | 17 | 23 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mod 1e9 + 7;
#define INF 1e9 + 9;
#define ps(x, y) fixed << setprecision(y) << x
typedef long long ll;
typedef unsigned long long ull;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
... | #include <bits/stdc++.h>
using namespace std;
#define mod 1e9 + 7;
#define INF 1e9 + 9;
#define ps(x, y) fixed << setprecision(y) << x
typedef long long ll;
typedef unsigned long long ull;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
... | replace | 25 | 27 | 25 | 27 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define watch(x) ... | #include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define watch(x) ... | replace | 39 | 41 | 39 | 41 | 0 | |
p02684 | C++ | Runtime Error | /*
Created by Ezio112
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define inf ll(10e16)
#define mod ll(10e8 + 7)
#define ff first
#define ss second
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t;
// cin>>t;
t = 1;
w... | /*
Created by Ezio112
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define inf ll(10e16)
#define mod ll(10e8 + 7)
#define ff first
#define ss second
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t;
// cin>>t;
t = 1;
w... | replace | 28 | 29 | 28 | 29 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
const int INF = 0x7f7f7f7f;
int A[MAXN];
int L[MAXN];
int Re[MAXN];
bool Vis[MAXN];
int main() {
int N;
long long K;
cin >> N >> K;
for (int i = 1; i <= N; ++i)
cin >> A[i];
int r = 0, pos = 1;
Vis[1] = true;
L[0] = 1;
Re[1] ... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
const int INF = 0x7f7f7f7f;
int A[MAXN];
int L[MAXN];
int Re[MAXN];
bool Vis[MAXN];
int main() {
int N;
long long K;
cin >> N >> K;
for (int i = 1; i <= N; ++i)
cin >> A[i];
int r = 0, pos = 1;
Vis[1] = true;
L[0] = 1;
Re[1] ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02684 | C++ | Runtime Error | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
const int MAX_N = 1e5 + 10;
ll N, K;
int A[MAX_N], B[MAX_N];
cin >> N >> K;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
A[i] = a - 1;
B[i] = -1;
}
B[0] = 0;
int v = 0, cost = 0;
while (B[A[v]] == -1) {
... | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
const int MAX_N = 2e5 + 10;
ll N, K;
int A[MAX_N], B[MAX_N];
cin >> N >> K;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
A[i] = a - 1;
B[i] = -1;
}
B[0] = 0;
int v = 0, cost = 0;
while (B[A[v]] == -1) {
... | replace | 5 | 6 | 5 | 6 | 0 | |
p02684 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int64_t N, K;
cin >> N >> K;
int32_t Ai[100001];
int64_t Aiused[100001];
int32_t realstate[100000];
for (int i = 1; i <= N; ++i) {
cin >> Ai[i];
Aiused[i] = -1;
realstate[i - 1] = 0;
}
int64_t mod = K... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int64_t N, K;
cin >> N >> K;
int32_t Ai[200001];
int64_t Aiused[200001];
int32_t realstate[200000];
for (int i = 1; i <= N; ++i) {
cin >> Ai[i];
Aiused[i] = -1;
realstate[i - 1] = 0;
}
int64_t mod = K... | replace | 9 | 12 | 9 | 12 | 0 | |
p02684 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | replace | 27 | 39 | 27 | 41 | TLE | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define repq(i, a, n) for (int(i) = (a); (i) <= (n); (i)++)
#define repr(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)
#define int long long
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template <t... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define repq(i, a, n) for (int(i) = (a); (i) <= (n); (i)++)
#define repr(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)
#define int long long
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template <t... | replace | 16 | 18 | 16 | 18 | 0 | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stri... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stri... | insert | 120 | 120 | 120 | 126 | 0 | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int MAX = 2000;
const int X = 64;
int main() {
unsigned long long N, K;
int A[MAX][X];
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int MAX = 200000;
const int X = 64;
int main() {
unsigned long long N, K;
int A[MAX][X];
... | replace | 13 | 14 | 13 | 14 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define MAX 20000005
#define fastcin \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using namespace std;
ll vis[MAX], cycle[MAX];
... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define MAX 20000005
#define fastcin \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using namespace std;
ll vis[MAX], cycle[MAX];
... | replace | 47 | 48 | 47 | 49 | -11 | |
p02684 | C++ | Runtime Error | // AtCoder template
// 最近sabaがかまってくれないからキレて暴れてる
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// 入力
int n;
ll k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) {
cin >> a[i];
a... | // AtCoder template
// 最近sabaがかまってくれないからキレて暴れてる
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// 入力
int n;
ll k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) {
cin >> a[i];
a... | replace | 63 | 64 | 63 | 73 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef vector<int> Vl;
typedef pair<int, int> pii;
typedef vector<pii> Vll;
typedef vector<pair<int, pair<int, int>>> Vlll;
#define S second
#define F first
#define mp make_pair
#define ms(x, y) memset(x, y, sizeof(x))
#define pb push_back
#define sl(... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef vector<int> Vl;
typedef pair<int, int> pii;
typedef vector<pii> Vll;
typedef vector<pair<int, pair<int, int>>> Vlll;
#define S second
#define F first
#define mp make_pair
#define ms(x, y) memset(x, y, sizeof(x))
#define pb push_back
#define sl(... | insert | 38 | 38 | 38 | 43 | 0 | |
p02684 | C++ | Runtime Error | /*"Success isn't permanent, failure isn't fatal,
it's the courage to continue that counts"*/
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
// typedef tree<int, null_type, less<... | /*"Success isn't permanent, failure isn't fatal,
it's the courage to continue that counts"*/
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
// typedef tree<int, null_type, less<... | replace | 26 | 27 | 26 | 27 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
int main() {
lint N, K;
cin >> N >> K;
vector<lint> A(N);
for (auto &elem : A)
cin >> elem;
for (auto &elem : A)
elem--;
if (K <= N + N) {
lint idx = 0;
for (lint i = 0; i < K; i++) {
idx = A[idx];
}
c... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
int main() {
lint N, K;
cin >> N >> K;
vector<lint> A(N);
for (auto &elem : A)
cin >> elem;
for (auto &elem : A)
elem--;
if (K <= N + N) {
lint idx = 0;
for (lint i = 0; i < K; i++) {
idx = A[idx];
}
c... | replace | 37 | 38 | 37 | 38 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 5;
int n, m, tot, now, ans, sum;
int a[N], b[N], c[N], f[N];
signed main() {
scanf("%lld%lld", &n, &m);
for (register int i = 1; i <= n; ++i)
scanf("%lld", &a[i]);
if (m <= n) {
now = 1;
for (register int i = 1; i ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2e5 + 5;
int n, m, tot, now, ans, sum;
int a[N], b[N], c[N], f[N];
signed main() {
scanf("%lld%lld", &n, &m);
for (register int i = 1; i <= n; ++i)
scanf("%lld", &a[i]);
if (m <= n) {
now = 1;
for (register int i = 1; i ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02684 | 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 | 66 | 67 | 66 | 73 | 0 | |
p02684 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define vi vector<int>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define x first
#define y second
#define sz(x) (x).size()
#define all(x) (x).begin(), (x).end() // Forward traversal
#define rall(x) (x).rbegin, (x).rend() ... | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define vi vector<int>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define x first
#define y second
#define sz(x) (x).size()
#define all(x) (x).begin(), (x).end() // Forward traversal
#define rall(x) (x).rbegin, (x).rend() ... | replace | 188 | 189 | 188 | 189 | TLE | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | replace | 27 | 28 | 27 | 28 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define multi_test true and false
#define all(a) (a).begin(), (a).end()
using namespace std;
void dfs(int v, vector<bool> &bani, vector<int> &path, int arr[]) {
if (bani[v]) {
path.push_back(v);
return;
}
bani[v] = true;
path.push_back(v);
dfs(arr[v], ba... | #include <bits/stdc++.h>
#define int long long
#define multi_test true and false
#define all(a) (a).begin(), (a).end()
using namespace std;
void dfs(int v, vector<bool> &bani, vector<int> &path, int arr[]) {
if (bani[v]) {
path.push_back(v);
return;
}
bani[v] = true;
path.push_back(v);
dfs(arr[v], ba... | insert | 37 | 37 | 37 | 41 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long K;
cin >> N >> K;
vector<vector<int>> next(60, vector<int>(N));
for (int j = 0; j < N; j++) {
cin >> next.at(0).at(j);
next.at(0).at(j)--;
}
for (int i = 0; i < 59; i++) {
for (int j = 0; j < N; j++) {
next.at(i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long K;
cin >> N >> K;
vector<vector<int>> next(60, vector<int>(N));
for (int j = 0; j < N; j++) {
cin >> next.at(0).at(j);
next.at(0).at(j)--;
}
for (int i = 0; i < 59; i++) {
for (int j = 0; j < N; j++) {
next.at(i... | replace | 18 | 19 | 18 | 19 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fastIO() \
; \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define fr(i, ... | #include <bits/stdc++.h>
using namespace std;
#define fastIO() \
; \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define fr(i, ... | replace | 37 | 38 | 37 | 38 | 0 | |
p02684 | C++ | Time Limit Exceeded | #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 ... | replace | 144 | 147 | 144 | 161 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.