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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03031 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <vector>
using namespace std;
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef ve... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <vector>
using namespace std;
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef ve... | replace | 27 | 28 | 27 | 28 | 0 | |
p03031 | C++ | Runtime Error | #include <stdio.h>
#include <stdlib.h>
#define MAX_N (10)
#define MAX_M (10)
int main(int argc, char *argv[]) {
// read inputs
int N, M, ks[MAX_M], xss[MAX_M][MAX_N], ps[MAX_M];
scanf("%d %d", &N, &M);
for (int i = 0; i < M; i++) {
scanf("%d", &ks[i]);
for (int j = 0; j < N; j++) {
scanf("%d", &... | #include <stdio.h>
#include <stdlib.h>
#define MAX_N (10)
#define MAX_M (10)
int main(int argc, char *argv[]) {
// read inputs
int N, M, ks[MAX_M], xss[MAX_M][MAX_N], ps[MAX_M];
scanf("%d %d", &N, &M);
for (int i = 0; i < M; i++) {
scanf("%d", &ks[i]);
for (int l = 0; l < ks[i]; l++) {
scanf("%d... | replace | 12 | 15 | 12 | 15 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, m, k;
cin >> n >> m;
vector<bitset<10>> a(m);
vector<int> c(m);
rep(i, m) {
cin >> k;
int b;
bitset<10> bs;
rep(j, k) {
cin >> b;
bs.set(b);
}
a[i] = bs;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, m, k;
cin >> n >> m;
vector<bitset<10>> a(m);
vector<int> c(m);
rep(i, m) {
cin >> k;
int b;
bitset<10> bs;
rep(j, k) {
cin >> b;
bs.set(b - 1);
}
a[i] = b... | replace | 14 | 15 | 14 | 15 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <string>
#define pb push_back
#define ll long long
#define ull unsigned long long
#define deb(x) cerr << #x << " " << x << "\n"
#define debi cerr << "hey sparky\n"
#define x first
#define y s... | #include <bits/stdc++.h>
#include <cmath>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <string>
#define pb push_back
#define ll long long
#define ull unsigned long long
#define deb(x) cerr << #x << " " << x << "\n"
#define debi cerr << "hey sparky\n"
#define x first
#define y s... | replace | 113 | 114 | 113 | 114 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vector<vector<int>> var(n, vector<int>(m, 0))
#define vecll2(var, n, m) vector<vector<ll>> var(n, vect... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vector<vector<int>> var(n, vector<int>(m, 0))
#define vecll2(var, n, m) vector<vector<ll>> var(n, vect... | replace | 47 | 48 | 47 | 48 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> k(m);
vector<vector<int>> s(m, vector<int>(m));
vector<int> p(m);
rep(i, m) {
cin >> k[i];
rep(j, k[i]) { cin >> s[i][j]; }
}
r... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> k(m);
vector<vector<int>> s(m, vector<int>(n));
vector<int> p(m);
rep(i, m) {
cin >> k[i];
rep(j, k[i]) { cin >> s[i][j]; }
}
r... | replace | 10 | 11 | 10 | 11 | 0 | |
p03031 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
auto k = vector<int>(m);
auto s = vector<vector<int>>(m);
auto p = vector<int>(m);
for (int i = 0; i < m; i++) {
cin >> k[i];
f... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
auto k = vector<int>(m);
auto s = vector<vector<int>>(m);
auto p = vector<int>(m);
for (int i = 0; i < m; i++) {
cin >> k[i];
f... | replace | 33 | 35 | 33 | 35 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const int MAX = 510000;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M), p(M);
vector<vector<int>> s(M);
for (int i = 0; i < M; i++) {
cin >> k[i]... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const int MAX = 510000;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M), p(M);
vector<vector<int>> s(M);
for (int i = 0; i < M; i++) {
cin >> k[i]... | insert | 18 | 18 | 18 | 19 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> S(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
cin >> S.at(i).at(j);
}
}
vector<int> P(M);
for (int i = 0; i < M; i++)
cin >> P.at(i);
in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> S(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
S.at(i).resize(k);
for (int j = 0; j < k; j++) {
cin >> S.at(i).at(j);
}
}
vector<int> P(M);
for (int i = 0; i < M; i++)
... | insert | 10 | 10 | 10 | 11 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define srt(x) sort((x).begin(), (x).end());
#define rsrt(x) sort((x).rbegin(), (x).rend());
#define deb(x) cout << #x << " = " << (x) << " (L" << LINE << ")" << endl;
#define vdeb(x) ... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define srt(x) sort((x).begin(), (x).end());
#define rsrt(x) sort((x).rbegin(), (x).rend());
#define deb(x) cout << #x << " = " << (x) << " (L" << LINE << ")" << endl;
#define vdeb(x) ... | replace | 42 | 43 | 42 | 43 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("inp.txt", "r", stdin);
freopen("outp.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(N... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m, ans = 0;
cin >> n >> m;
vector<vector<int>> light(m);
vector<int> num(m)... | replace | 8 | 12 | 8 | 9 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> cont(n);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
s--;
cont.at(i) |= 1 << s;
}
}
int p = 0;
for (int i = 0; i < m... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> cont(n);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
s--;
cont.at(s) |= 1 << i;
}
}
int p = 0;
for (int i = 0; i < m... | replace | 16 | 17 | 16 | 17 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> s(N);
for (int i = 0; i < M; i++) {
cin >> k[i];
s[i].resize(k[i]);
for (int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> s(M);
for (int i = 0; i < M; i++) {
cin >> k[i];
s[i].resize(k[i]);
for (int... | replace | 12 | 13 | 12 | 13 | 0 | |
p03031 | C++ | Runtime Error | // wawando's template
#include <algorithm>
#include <cctype>
#include <climits> // LLONG_MAX , LLONG_MIN , INT_MAX , INT_MIN
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime> //clock_t , clock() , CLOCKS_PER_SEC
#include <deque>
#include <fstream>
#include <functional>
#include ... | // wawando's template
#include <algorithm>
#include <cctype>
#include <climits> // LLONG_MAX , LLONG_MIN , INT_MAX , INT_MIN
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime> //clock_t , clock() , CLOCKS_PER_SEC
#include <deque>
#include <fstream>
#include <functional>
#include ... | replace | 47 | 48 | 47 | 48 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> s(M);
vector<int> p(M);
for (int i = 0; i < M; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
s[i][j]--;
}
}
f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> s(M);
vector<int> p(M);
for (int i = 0; i < M; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
int a;
cin >> a;
a--;
s[i].pu... | replace | 15 | 17 | 15 | 19 | -11 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pii_ pair<int, int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define show1(a) cout << #a << " = " << a << endl
#define sh... | #include <bits/stdc++.h>
#define ll long long
#define pii_ pair<int, int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define show1(a) cout << #a << " = " << a << endl
#define sh... | replace | 38 | 39 | 38 | 39 | 0 | |
p03031 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
s[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> s[i][j];
--s[i][j];
}
}
vector<int> p(M);
for ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
s[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> s[i][j];
--s[i][j];
}
}
vector<int> p(M);
for ... | replace | 22 | 23 | 22 | 23 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(n);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s_in;
cin >> s_in;
s[s_in - 1].push_back(j);
}
}
vector<int> p(m);
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(n);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s_in;
cin >> s_in;
s[s_in - 1].push_back(i);
}
}
vector<int> p(m);
for (int i = 0... | replace | 12 | 13 | 12 | 13 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m, ans;
cin >> n >> m;
vector<vector<int>> ks(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
cin >> ks[i][j];
ks[i][j]--;
}
}
vector<int> p(m);
for (int i = 0; i < m; i++)
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m, ans;
cin >> n >> m;
vector<vector<int>> ks(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
ks[i].resize(k);
for (int j = 0; j < k; j++) {
cin >> ks[i][j];
ks[i][j]--;
}
}
vector<int> p(m);
for (int... | insert | 9 | 9 | 9 | 10 | -11 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[20], s[20][20], p[20];
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int bit = 0; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[20], s[20][20], p[20];
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int bit = 0; ... | replace | 18 | 19 | 18 | 19 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<vector<bool>> g(n, vector<bool>(m, false));
rep(i, ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<vector<bool>> g(n, vector<bool>(m, false));
rep(i, ... | replace | 20 | 21 | 20 | 21 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <map>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define s(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
int main() {
int n, m;
cin >> n >> m;
vector<vl> a(m);
rep(i, m) {
... | #include <bits/stdc++.h>
#include <cmath>
#include <map>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define s(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
int main() {
int n, m;
cin >> n >> m;
vector<vl> a(m);
rep(i, m) {
... | replace | 19 | 20 | 19 | 21 | -11 | |
p03031 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int MOD = 1000000007;
int main() {
int N, M, k, ans = 0, c = 0;
cin >> N >> M;
vector<vector<int>> s(M + 10);
for (int i = 0; i < M; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> s[i... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int MOD = 1000000007;
int main() {
int N, M, k, ans = 0, c = 0;
cin >> N >> M;
vector<vector<int>> s(M + 10);
for (int i = 0; i < M; i++) {
cin >> k;
s[i].resize(k);
for (int j = 0; j < k; j++... | insert | 15 | 15 | 15 | 16 | -11 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <bitset>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<long long> Bit(M, 0);
vector<long long> mod(M, 0);
for (int i = 0; i < N; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
Bit[i] ^= 1 << (s - 1);
... | #include <bits/stdc++.h>
#include <bitset>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<long long> Bit(M, 0);
vector<long long> mod(M, 0);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
Bit[i] ^= 1 << (s - 1);
... | replace | 9 | 10 | 9 | 10 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
for (int i = 0; i < m; ++i) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int a;
cin >> a;
a--;
s[i].emplace_back(a);
}
}
vector<int> p(m);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
for (int i = 0; i < m; ++i) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int a;
cin >> a;
a--;
s[i].emplace_back(a);
}
}
vector<int> p(m);
... | replace | 29 | 30 | 29 | 30 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX // 2147483647
#define INFLL LLONG_MAX // 9223372036854775807
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define per(i, n) fo... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX // 2147483647
#define INFLL LLONG_MAX // 9223372036854775807
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define per(i, n) fo... | replace | 40 | 41 | 40 | 41 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define uint unsigned int
#define ld long double
#define showoff \
ios::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define int long long
#define uint unsigned int
#define ld long double
#define showoff \
ios::sync_with_stdio(false); \
cin.tie(0); ... | replace | 63 | 64 | 63 | 64 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef long double ld;
#define rd(x) scanf("%d", &x)
#define rd2(x, y) scanf("%d %d", &x, &y)
#define rd3(x, y, z) scanf("%d %d %d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef long double ld;
#define rd(x) scanf("%d", &x)
#define rd2(x, y) scanf("%d %d", &x, &y)
#define rd3(x, y, z) scanf("%d %d %d... | replace | 69 | 70 | 69 | 70 | 0 | |
p03031 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> S(N);
rep(i, M) {
int k;
cin >> k;
rep(i, k) {
in... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> S(N);
rep(i, M) {
int k;
cin >> k;
rep(j, k) {
in... | replace | 14 | 15 | 14 | 15 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, A = 0;
cin >> N >> M;
vector<int> k(M), p(M);
vector<vector<int>> s(M, vector<int>(N));
for (int i = 0; i < M; i++) {
cin >> k.at(i);
for (int j = 0; j < k.at(i); j++)
cin >> s.at(i).at(j);
}
for (int i = 0; i < M; i++)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, A = 0;
cin >> N >> M;
vector<int> k(M), p(M);
vector<vector<int>> s(M, vector<int>(N));
for (int i = 0; i < M; i++) {
cin >> k.at(i);
for (int j = 0; j < k.at(i); j++)
cin >> s.at(i).at(j);
}
for (int i = 0; i < M; i++)
... | replace | 16 | 17 | 16 | 17 | 0 | |
p03031 | Python | Runtime Error | import itertools
N, M = map(int, input().split())
connected_switches = [[int(x) - 1 for x in input().split()[1:]] for x in range(M)]
conditions = list(map(int, input().split()))
ok = 0
for patterns in itertools.product((0, 1), repeat=M):
patterns = list(patterns)
is_lighting = True
for i, lights in enume... | import itertools
N, M = map(int, input().split())
connected_switches = [[int(x) - 1 for x in input().split()[1:]] for x in range(M)]
conditions = list(map(int, input().split()))
ok = 0
for patterns in itertools.product((0, 1), repeat=N):
patterns = list(patterns)
is_lighting = True
for i, lights in enume... | replace | 8 | 9 | 8 | 9 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#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++)
using namespace std;
int N = 0, M = 0, k = 0;
long long ans = 0;
int main() {
cin >> N >> M;
// 繋がっているスイッチを格納するベクター
vector<vector<int>> S(M, vector... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#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++)
using namespace std;
int N = 0, M = 0, k = 0;
long long ans = 0;
int main() {
cin >> N >> M;
// 繋がっているスイッチを格納するベクター
vector<vector<int>> S(M, vector... | replace | 12 | 13 | 12 | 13 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define all(v) v.begin(), v.end()
const ll mod = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define all(v) v.begin(), v.end()
const ll mod = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-... | replace | 17 | 18 | 17 | 18 | -11 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> vec(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
vec[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> vec[i][j];
--vec[i][j];
}
}
vector<int> p(M);
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> vec(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
vec[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> vec[i][j];
--vec[i][j];
}
}
vector<int> p(M);
for (int i = 0... | replace | 24 | 25 | 24 | 25 | 0 | |
p03031 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int cnt = 0;
vector<int> a(N);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; k++) {
int s = 0;
cin >> s;
s--;
a[s] |= 1 << i;
}
}
int p;
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int cnt = 0;
vector<int> a(N);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s = 0;
cin >> s;
s--;
a[s] |= 1 << i;
}
}
int p;
for (int i = 0; ... | replace | 12 | 13 | 12 | 13 | TLE | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> S[N], T(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
S[i].push_back(s - 1);
}
}
for (int i = 0; i < M; i++) {
cin >> T[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> S[M], T(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
S[i].push_back(s - 1);
}
}
for (int i = 0; i < M; i++) {
cin >> T[... | replace | 7 | 8 | 7 | 8 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> c(m, vector<int>(n, 0));
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
c.at(i).at(s - 1) = 1;
}
}
vector<int> p(n);
for ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> c(m, vector<int>(n, 0));
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
c.at(i).at(s - 1) = 1;
}
}
vector<int> p(m);
for ... | replace | 15 | 16 | 15 | 16 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ifstream in("data1.txt");
cin.rdbuf(in.rdbuf());
int N, M;
cin >> N >> M;
vector<vector<int>> vec(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
vec[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> vec[i][j];
--v... | #include <bits/stdc++.h>
using namespace std;
int main() {
// ifstream in("data1.txt");
// cin.rdbuf(in.rdbuf());
int N, M;
cin >> N >> M;
vector<vector<int>> vec(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
vec[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> vec[i][j];
... | replace | 4 | 6 | 4 | 6 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
int *k, **s, *p;
int pattern = 1;
int count = 0;
cin >> n >> m;
k = new int[m];
s = new int *[m];
p = new int[m];
for (int i = 0; i < n; i++) {
pattern *= 2;
}
count = pattern;
for (int i = 0; i < m; i++) {
cin >> ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
int *k, **s, *p;
int pattern = 1;
int count = 0;
cin >> n >> m;
k = new int[m];
s = new int *[m];
p = new int[m];
for (int i = 0; i < n; i++) {
pattern *= 2;
}
count = pattern;
for (int i = 0; i < m; i++) {
cin >> ... | replace | 18 | 19 | 18 | 19 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> b(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int i = 0; i < k; i++) {
int s;
cin >> s;
b[i].push_back(s);
}
}
vector<int> p(m);
for (int i = 0; i < m... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> b(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
b[i].push_back(s);
}
}
vector<int> p(m);
for (int i = 0; i < m... | replace | 11 | 12 | 11 | 12 | 0 | |
p03031 | 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()
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 | 26 | 27 | 26 | 27 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define min_3(a, b, c) min(a, min(b, c))
t... | #include <bits/stdc++.h>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define min_3(a, b, c) min(a, min(b, c))
t... | replace | 25 | 26 | 25 | 26 | 0 | |
p03031 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
... | replace | 45 | 46 | 45 | 46 | 0 | |
p03031 | C++ | Runtime Error | #include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
ll N, M;
cin >> N >> M;
vector<vector<ll>> switches(M);
vector<ll> p(M);
for (ll i = 0; i < M; i++) {
ll k;
cin >> k;
for (ll i = 0; i < k; i++) {
ll s;
cin >> s;
switches[i].push_bac... | #include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
ll N, M;
cin >> N >> M;
vector<vector<ll>> switches(M);
vector<ll> p(M);
for (ll i = 0; i < M; i++) {
ll k;
cin >> k;
for (ll j = 0; j < k; j++) {
ll s;
cin >> s;
switches[i].push_bac... | replace | 15 | 16 | 15 | 16 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cMOD 10... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cMOD 10... | replace | 21 | 22 | 21 | 22 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
bool isprime(int n) {
double rootn = sqrt(n);
if (n < 2) {
return false;
} else if (n == 2) {
return true;
} else if (n % 2 == 0) {
return false;
} else {
for (int i = 3; i <= rootn; i += 2) {
if (n % i == 0) {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
bool isprime(int n) {
double rootn = sqrt(n);
if (n < 2) {
return false;
} else if (n == 2) {
return true;
} else if (n % 2 == 0) {
return false;
} else {
for (int i = 3; i <= rootn; i += 2) {
if (n % i == 0) {
... | replace | 68 | 69 | 68 | 69 | 0 | |
p03031 | C++ | Runtime Error | #include <iostream>
using namespace std;
int ans, n, m, p[10], k[10], d[10][10];
void dfs(int a[], int l) {
if (l == n) {
bool f = true;
for (int i = 0; i < m; i++) {
if (a[i] != p[i])
f = false;
}
if (f)
ans++;
return;
}
int aa[10];
for (int i = 0; i < n; i++)
aa[i... | #include <iostream>
using namespace std;
int ans, n, m, p[10], k[10], d[10][10];
void dfs(int a[], int l) {
if (l == n) {
bool f = true;
for (int i = 0; i < m; i++) {
if (a[i] != p[i])
f = false;
}
if (f)
ans++;
return;
}
int aa[10];
for (int i = 0; i < n; i++)
aa[i... | replace | 29 | 30 | 29 | 30 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define RREP(i, a, b) for (int(i) = (a)-1; (i) >= (b); --(i))
#define ALL(x) (x).begin(), (x).end()
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
using namespace std;
typedef long long ll;
int main() {
int N, M;
... | #include <bits/stdc++.h>
#define REP(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define RREP(i, a, b) for (int(i) = (a)-1; (i) >= (b); --(i))
#define ALL(x) (x).begin(), (x).end()
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
using namespace std;
typedef long long ll;
int main() {
int N, M;
... | replace | 13 | 14 | 13 | 15 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> connect(m);... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> connect(m);... | replace | 18 | 19 | 18 | 19 | 0 | |
p03031 | C++ | Runtime Error | #include <algorithm> // sort
#include <cmath>
#include <iostream>
#include <map> // pair
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
void bin_vecadd(vector<int> &input) {
int N = input.size();
input[0]++;
for (int i = 0; i < N; i++) {
if (input[i] == 2) {
... | #include <algorithm> // sort
#include <cmath>
#include <iostream>
#include <map> // pair
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
void bin_vecadd(vector<int> &input) {
int N = input.size();
input[0]++;
for (int i = 0; i < N; i++) {
if (input[i] == 2) {
... | replace | 16 | 17 | 16 | 18 | 0 | |
p03031 | C++ | Runtime Error | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int nijou(int a) {
int b = 1;
rep(i, a - 1) b *= 2;
return b;
}
int main() {
int n, m, ans = 0;
cin >> n >> m;
vector<vector<int>> a(m, vector<int>(n));
vector<int> p(m);
rep(i, m) {
cin >> a... | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int nijou(int a) {
int b = 1;
rep(i, a - 1) b *= 2;
return b;
}
int main() {
int n, m, ans = 0;
cin >> n >> m;
vector<vector<int>> a(m, vector<int>(n + 1));
vector<int> p(m);
rep(i, m) {
cin ... | replace | 14 | 15 | 14 | 15 | 0 | |
p03031 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 110
int n, m;
vector<vector<int>> vec;
int p[N], a[20];
int main() {
while (scanf("%d%d", &n, &m) != EOF) {
vec.clear();
vec.resize(m + 1);
for (int i = 1, k; i <= m; ++i) {
scanf("%d", &k);
for (int j = 1, x; j <= k; ++j) {
sca... | #include <bits/stdc++.h>
using namespace std;
#define N 110
int n, m;
vector<vector<int>> vec;
int p[N], a[20];
int main() {
while (scanf("%d%d", &n, &m) != EOF) {
vec.clear();
vec.resize(n + 1);
for (int i = 1, k; i <= m; ++i) {
scanf("%d", &k);
for (int j = 1, x; j <= k; ++j) {
sca... | replace | 11 | 12 | 11 | 12 | 0 | |
p03032 | C++ | Runtime Error | #pragma region include
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i =... | #pragma region include
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i =... | replace | 86 | 91 | 86 | 93 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int n, k, v[50], dp[50][50][100];
int g(int p, int q, int r) {
vector<int> x;
for (int i = 0; i < p; ++i)
x.push_back(... | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int n, k, v[50], dp[50][50][100];
int g(int p, int q, int r) {
vector<int> x;
for (int i = 0; i < p; ++i)
x.push_back(... | replace | 24 | 26 | 24 | 26 | 0 | |
p03032 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | replace | 105 | 106 | 105 | 106 | 0 | |
p03032 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int INF = (1 << 30);
const ll INFLL = (1ll << 60);
const ll MOD = (ll)(1e9 + 7);
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
a = (a < MOD) ? a : (a - MOD);
b = (b < MOD) ? b : (b - M... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int INF = (1 << 30);
const ll INFLL = (1ll << 60);
const ll MOD = (ll)(1e9 + 7);
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
a = (a < MOD) ? a : (a - MOD);
b = (b < MOD) ? b : (b - M... | replace | 28 | 29 | 28 | 29 | TLE | |
p03032 | C++ | Time Limit Exceeded | // ↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const long long SIZE = 1 << 17;
int dx[] = {1, 0, -1,... | // ↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const long long SIZE = 1 << 17;
int dx[] = {1, 0, -1,... | insert | 83 | 83 | 83 | 86 | TLE | |
p03032 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
int n, k, i, j, s, t, v[50];
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> v[i];
}
int r = min(n, k);
int su... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
int n, k, i, j, s, t, v[50];
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> v[i];
}
int r = min(n, k);
int su... | replace | 30 | 31 | 30 | 31 | 0 | |
p03032 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using Lf = long double;
using plong = pair<ll, ll>;
const int mod = 1000000007;
int main() {
ll N... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using Lf = long double;
using plong = pair<ll, ll>;
const int mod = 1000000007;
int main() {
ll N... | replace | 28 | 30 | 28 | 30 | 0 | |
p03032 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define LL long long
#define MOD (1000000007)
// 129
/*
int main() {
LL H, W;
scanf("%lld %lld", &H,... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define LL long long
#define MOD (1000000007)
// 129
/*
int main() {
LL H, W;
scanf("%lld %lld", &H,... | replace | 134 | 136 | 134 | 138 | 0 | |
p03032 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph = vector<vector<int>... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph = vector<vector<int>... | replace | 41 | 42 | 41 | 42 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
int uu = 0;
for (int i = 0; i < k + 1; i++) {
for (int j = 0; j < k - i + 1; j++) {
vector<int> a;
for (int l = 0; l < i; l++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
int uu = 0;
for (int i = 0; i < min(k + 1, n + 1); i++) {
for (int j = 0; j < min(k - i + 1, n + 1 - i); j++) {
vector<int> a;
for (int... | replace | 11 | 13 | 11 | 13 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int v[55], sort_lr[55];
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int ans = 0;
for (int left = 0; left <= k; left++) {
for (int right = 0; right <= k - left; right++) {
for (int i = ... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int v[55], sort_lr[55];
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int ans = 0;
for (int left = 0; left <= k; left++) {
for (int right = 0; right <= min(n - left, k - left); right++) {
... | replace | 13 | 14 | 13 | 14 | 0 | |
p03032 | C++ | Runtime Error | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cout << #x << ": " << x << endl
#define repn(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define re... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cout << #x << ": " << x << endl
#define repn(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define re... | replace | 36 | 37 | 36 | 37 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int n;
vector<int> shift(int x, vector<int> v) {
vector<int> ans(n);
ans = v;
int tmp = ans[n - 1];
for (int i = x; i <= n - 1; i++)
ans[i] = v[i - 1];
ans[x - 1] = tmp;
return ans;
}
void... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int n;
vector<int> shift(int x, vector<int> v) {
vector<int> ans(n);
ans = v;
int tmp = ans[n - 1];
for (int i = x; i <= n - 1; i++)
ans[i] = v[i - 1];
ans[x - 1] = tmp;
return ans;
}
void... | replace | 24 | 25 | 24 | 25 | 0 | |
p03032 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<ll> D;
for (int i = 0; i < n; i++) {
ll tmp;
cin >> tmp;
D.push_back(tmp);
}
ll max;
max = -INT_MAX;
for (int a = 0; a <= k; a++) {
for (int b = 0; b... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<ll> D;
for (int i = 0; i < n; i++) {
ll tmp;
cin >> tmp;
D.push_back(tmp);
}
ll max;
max = -INT_MAX;
int m;
m = min(n, k);
for (int a = 0; a <= m; a... | replace | 20 | 22 | 20 | 25 | 0 | |
p03032 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (ll i = a; i <= b; i++)
#define rep(i, n) for (ll ... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (ll i = a; i <= b; i++)
#define rep(i, n) for (ll ... | replace | 52 | 54 | 52 | 54 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long int;
using vec = vector<int>;
const int INF = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vec v(n);
rep(i, n) { cin >> v[i]; }
int m = 0;
vec o;
in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long int;
using vec = vector<int>;
const int INF = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vec v(n);
rep(i, n) { cin >> v[i]; }
int m = 0;
vec o;
in... | replace | 27 | 28 | 27 | 29 | -11 | |
p03032 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <chrono>
#include <iostream>
#include <random>
#include <string>
#include <vector>
int main(void) {
int n, k;
std::cin >> n >> k;
std::vector<int> v(n);
for (int i = 0; i < n; i++)
std::cin >> v[i];
std::vector<int> hand(n);
int64_t ans =... | #include <algorithm>
#include <array>
#include <bitset>
#include <chrono>
#include <iostream>
#include <random>
#include <string>
#include <vector>
int main(void) {
int n, k;
std::cin >> n >> k;
std::vector<int> v(n);
for (int i = 0; i < n; i++)
std::cin >> v[i];
std::vector<int> hand(n);
int64_t ans =... | replace | 17 | 19 | 17 | 20 | 0 | |
p03032 | C++ | Runtime Error | #ifdef _WIN32
#define DEBUG 1
#endif
#define _CRT_SECURE_NO_WARNINGS
#define MATH_PI 3.14159265358979323846264338327950288419716939
#include <fstream>
#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
#ifdef DEBUG
#include "include.h"
#else
inline signed wait() { return 0; }
inline void d... | #ifdef _WIN32
#define DEBUG 1
#endif
#define _CRT_SECURE_NO_WARNINGS
#define MATH_PI 3.14159265358979323846264338327950288419716939
#include <fstream>
#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
#ifdef DEBUG
#include "include.h"
#else
inline signed wait() { return 0; }
inline void d... | replace | 238 | 242 | 238 | 241 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll, ll> P;
#define pb push_back
#define ft first
#define sd second
#define mp make_pair
#define fr(i, n) for (int i = 0; i < (n); i++)
#define Fr(i, n) for (int i = 0; i++ < (n);)
#define ifr(i, n) for (int i = (n)-1; i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll, ll> P;
#define pb push_back
#define ft first
#define sd second
#define mp make_pair
#define fr(i, n) for (int i = 0; i < (n); i++)
#define Fr(i, n) for (int i = 0; i++ < (n);)
#define ifr(i, n) for (int i = (n)-1; i ... | replace | 19 | 20 | 19 | 20 | 0 | |
p03032 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n), range(k * 2, 0), vals(0);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
for (int i = 0; i < k; i++) {
if ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n), range(k * 2, 0), vals(0);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
for (int i = 0; i < k; i++) {
if ... | replace | 37 | 38 | 37 | 39 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | insert | 37 | 37 | 37 | 39 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(a) a.begin(), a.end()
typedef pair<int, int> pint;
typede... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(a) a.begin(), a.end()
typedef pair<int, int> pint;
typede... | replace | 60 | 61 | 60 | 61 | 0 | |
p03032 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout... | replace | 37 | 38 | 37 | 38 | TLE | |
p03032 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> q(n);
for (int i = 0; i < n; i++)
cin >> q[i];
int ans = 0;
for (int l = 0; l <= k; l++) {
for (int r = 0; r <= k - l; r--) {
if ... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> q(n);
for (int i = 0; i < n; i++)
cin >> q[i];
int ans = 0;
for (int l = 0; l <= k; l++) {
for (int r = 0; r <= k - l; r++) {
if ... | replace | 15 | 16 | 15 | 16 | TLE | |
p03032 | C++ | Runtime Error | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <deque>
#include <functional> //sort第三引数greater<型名>()で降順
#include <iomanip> //cout<<setw(数字) で空白による桁揃え
#include <iostream> //cout<<right で右揃え
#include <map>
#include <queue>
#include <string>
#include <vector>
u... | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <deque>
#include <functional> //sort第三引数greater<型名>()で降順
#include <iomanip> //cout<<setw(数字) で空白による桁揃え
#include <iostream> //cout<<right で右揃え
#include <map>
#include <queue>
#include <string>
#include <vector>
u... | replace | 43 | 44 | 43 | 44 | -11 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++)
cin >> V.at(i);
int ans = 0;
for (int i = 0; i <= K; i++) {
for (int j = 0; i + j <= K; j++) {
int L = min(i, N);
int R = min(j, N - i);
vector<int> t... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++)
cin >> V.at(i);
int ans = 0;
for (int i = 0; i <= K; i++) {
for (int j = 0; i + j <= K; j++) {
int L = min(i, N);
int R = min(j, max(0, N - i));
vecto... | replace | 14 | 15 | 14 | 15 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e18;
#include "string"
int n, k;
int dp[55][55][101], a[55];
int solve(int l, int r, int cnt) {
if (cnt > k)
return -inf;
if (cnt == k or l > r)
return 0;
int &tmp = dp[l][r][cnt];
if (tmp != -1)
return tmp;
tmp... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e18;
#include "string"
int n, k;
int dp[55][55][101], a[55];
int solve(int l, int r, int cnt) {
if (cnt > k)
return -inf;
if (cnt == k or l > r)
return 0;
int &tmp = dp[l][r][cnt];
if (tmp != -1)
return tmp;
tmp... | replace | 29 | 30 | 29 | 30 | 0 | |
p03032 | C++ | Time Limit Exceeded | // #pragma GCC optimize ('O3')
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
#define mp make_pair
#define f first
#define s second
#define pb push_back
const int N = 50 + 5;
const int M = 100 + 5;
const ll OO = 1e18;
const int mod = 1e9 + 7;
int... | // #pragma GCC optimize ('O3')
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
#define mp make_pair
#define f first
#define s second
#define pb push_back
const int N = 50 + 5;
const int M = 100 + 5;
const ll OO = 1e18;
const int mod = 1e9 + 7;
int... | insert | 25 | 25 | 25 | 28 | TLE | |
p03032 | C++ | Runtime Error | #include "bits/stdc++.h"
// #include <intrin.h> //AtCoder (gcc)
// 上ではこれがあると動かない。__popcnt用のincludeファイル。
using namespace std;
typedef long long ll;
typedef long double ld;
#define int long long
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define sqrt(d) pow((long double)(d), 0.50)
#define PII pair<int, int>... | #include "bits/stdc++.h"
// #include <intrin.h> //AtCoder (gcc)
// 上ではこれがあると動かない。__popcnt用のincludeファイル。
using namespace std;
typedef long long ll;
typedef long double ld;
#define int long long
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define sqrt(d) pow((long double)(d), 0.50)
#define PII pair<int, int>... | replace | 583 | 605 | 583 | 634 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h> //Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 ... | #include <bits/stdc++.h> //Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 ... | insert | 67 | 67 | 67 | 68 | 0 | |
p03032 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin... | replace | 43 | 44 | 43 | 48 | -11 | |
p03032 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define dofloat cout << fixed << setprecision(8)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bitcount _builti... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define dofloat cout << fixed << setprecision(8)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bitcount _builti... | insert | 144 | 144 | 144 | 146 | TLE | |
p03032 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long in... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long in... | replace | 34 | 35 | 34 | 35 | 0 | |
p03032 | C++ | Runtime Error | // 2020-07-15 23:13:36
#include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int ... | // 2020-07-15 23:13:36
#include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int ... | insert | 40 | 40 | 40 | 42 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | replace | 1,294 | 1,299 | 1,294 | 1,300 | 0 | |
p03032 | C++ | Time Limit Exceeded | #include <algorithm>
#include <chrono>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#i... | #include <algorithm>
#include <chrono>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#i... | replace | 47 | 48 | 47 | 49 | TLE | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) ... | replace | 39 | 40 | 39 | 40 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
const int INF = 1e9 + 101;
const long long LINF = 1e18;
const double EPS = 1e-8;
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define reps(i, j,... | #include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
const int INF = 1e9 + 101;
const long long LINF = 1e18;
const double EPS = 1e-8;
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define reps(i, j,... | replace | 30 | 31 | 30 | 31 | 0 | |
p03032 | C++ | Runtime Error | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
// tourist set
template <typena... | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
// tourist set
template <typena... | insert | 193 | 193 | 193 | 195 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
int maxvalue = 0;
for (int take = k / 2; take <= k; take++) {
for (int left = 0; left <= take; left++) {
vector<int> jewels(take);
for ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
int maxvalue = 0;
for (int take = min(n, k / 2); take <= min(n, k); take++) {
for (int left = 0; left <= take; left++) {
vector<int> jewels(t... | replace | 11 | 12 | 11 | 12 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;... | replace | 54 | 55 | 54 | 55 | -11 | |
p03032 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define sorted(vector) sort(vector.begin(), vector.end())
#define vmax(vector) *max_element(vector.begin(), vector.end())
#define vsum(vector) accumulate(vector.begin(), vector.end(), 0)
#define append(a) push_back(a)
#define int(a) stoi(a)
#define str(a) to_string(a)
int ... | #include <bits/stdc++.h>
using namespace std;
#define sorted(vector) sort(vector.begin(), vector.end())
#define vmax(vector) *max_element(vector.begin(), vector.end())
#define vsum(vector) accumulate(vector.begin(), vector.end(), 0)
#define append(a) push_back(a)
#define int(a) stoi(a)
#define str(a) to_string(a)
int ... | replace | 22 | 27 | 22 | 25 | TLE | |
p03032 | Python | Time Limit Exceeded | import heapq
N, K = [int(_) for _ in input().split()]
V = [int(_) for _ in input().split()]
ans = 0
for il in range(min([N + 1, K + 1])):
for ir in range(min([N + 1 - il, K + 1 - il])):
for dl in range(il + 1):
for dr in range(ir + 1):
if il + ir + dl + dr > K:
... | import heapq
N, K = [int(_) for _ in input().split()]
V = [int(_) for _ in input().split()]
ans = 0
for il in range(K + 1):
for ir in range(K + 1 - il):
if il + ir > min([N, K]):
continue
H = V[:il] + V[N - ir : N]
heapq.heapify(H)
now = 0
for d in range(1, il + ... | replace | 5 | 29 | 5 | 21 | TLE | |
p03032 | Python | Runtime Error | N, K = map(int, input().split())
d = list(map(int, input().split()))
left = [0]
left_m = []
right = [0]
right_m = []
for i, l, r in zip(range(K), d, d[::-1]):
left.append(left[i] + l)
left_m.append(l if l < 0 else 0)
right.append(right[i] + r)
right_m.append(r if r < 0 else 0)
point = 0
for i in range(K... | N, K = map(int, input().split())
d = list(map(int, input().split()))
left = [0]
left_m = []
right = [0]
right_m = []
for i, l, r in zip(range(K), d, d[::-1]):
left.append(left[i] + l)
left_m.append(l if l < 0 else 0)
right.append(right[i] + r)
right_m.append(r if r < 0 else 0)
point = 0
m = min(N, K)
fo... | replace | 12 | 14 | 12 | 15 | 0 | |
p03032 | Python | Runtime Error | def solve(string):
n, k, *v = map(int, string.split())
def dfs(deq, get, count, minus):
if count == k:
return sum(get)
op1 = dfs(deq[1:], get + [deq[0]], count + 1, minus + (deq[0] < 0))
op2 = dfs(deq[:-1], get + [deq[-1]], count + 1, minus + (deq[-1] < 0))
m = min(g... | def solve(string):
n, k, *v = map(int, string.split())
ans = 0
for i in range(k + 1):
for j in range(k - i + 1):
base = sorted(v[:i] + v[max(n - k + i + j, i) :])
ans = max(ans, sum([b for l, b in enumerate(base) if b >= 0 or j <= l]))
return str(ans)
if __name__ == "__... | replace | 2 | 13 | 2 | 8 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// 関数
// main関数
int main() {
// 入力
long N, K;
cin >> N >> K;
vector<long> V(N);
for (int i = 0; i < N; i++) {
cin >> V.at(i);
}
// 計算
long ans = -1000000000000, Ls = 0;
multiset<long> Lm;
for (int L = 0; L <= N; L++) {
if (L > 0) {
Ls += ... | #include <bits/stdc++.h>
using namespace std;
// 関数
// main関数
int main() {
// 入力
long N, K;
cin >> N >> K;
vector<long> V(N);
for (int i = 0; i < N; i++) {
cin >> V.at(i);
}
// 計算
long ans = -1000000000000, Ls = 0;
multiset<long> Lm;
for (int L = 0; L <= N; L++) {
if (L > 0) {
Ls += ... | replace | 26 | 27 | 26 | 27 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
#define err(args...) \
{}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream &operator>>(istre... | #include <bits/stdc++.h>
#define err(args...) \
{}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream &operator>>(istre... | replace | 21 | 22 | 21 | 22 | 0 | |
p03032 | C++ | Runtime Error | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define co(x) cout << x << '\n'
#define sz(x) (int)x.size()
#define all(a) a.begin(), a.end()
us... | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define co(x) cout << x << '\n'
#define sz(x) (int)x.size()
#define all(a) a.begin(), a.end()
us... | replace | 12 | 13 | 12 | 13 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.