buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
#include <vector>
using namespace ... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
#include <vector>
using namespace ... | [["+", 64, 9, 0, 57, 15, 339, 51, 91, 17, 111], ["-", 0, 57, 64, 9, 0, 57, 64, 116, 0, 117], ["-", 0, 57, 64, 9, 0, 57, 64, 116, 0, 35], ["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 46]] | 1 | 895 | 5 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
struct Dinic {
struct edge {
int to, cap, rev;
bool alive;
};
vector<vector<edge>> graph;
vector<int> used;
Dinic(int n) { graph.resize(n); }
void add_edge(int from, int to, int cap) {
graph[from].push_back((edge){to, c... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
struct Dinic {
struct edge {
int to, cap, rev;
bool alive;
};
vector<vector<edge>> graph;
vector<int> used;
Dinic(int n) { graph.resize(n); }
void add_edge(int from, int to, int cap) {
graph[from].push_back((edge){to, c... | [["-", 51, 16, 12, 16, 31, 2, 3, 4, 0, 22], ["-", 51, 16, 12, 16, 31, 2, 3, 4, 0, 21], ["+", 51, 16, 12, 16, 31, 2, 3, 4, 0, 21], ["+", 51, 16, 12, 16, 31, 2, 3, 4, 0, 22]] | 1 | 643 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1 << 28
#define MAX_V 600
struct edge {
int to, cap, rev;
edge() {}
edge(int to, int cap, int rev) : to(to), cap(cap), rev(rev) {}
};
vector<edge> G[MAX_V], G2[MAX_V];
map<int, int> M[MAX_V];
int level[MAX_V];
int iter[MAX_V];
void add_edge(int from, int... | #include <bits/stdc++.h>
using namespace std;
#define INF 1 << 28
#define MAX_V 600
struct edge {
int to, cap, rev;
edge() {}
edge(int to, int cap, int rev) : to(to), cap(cap), rev(rev) {}
};
vector<edge> G[MAX_V], G2[MAX_V];
map<int, int> M[MAX_V];
int level[MAX_V];
int iter[MAX_V];
void add_edge(int from, int... | [["-", 0, 2, 63, 118, 28, 69, 341, 342, 0, 22], ["+", 0, 2, 63, 118, 28, 69, 341, 342, 0, 22], ["-", 31, 2, 63, 118, 28, 69, 341, 342, 0, 22], ["+", 31, 2, 63, 118, 28, 69, 341, 342, 0, 22]] | 1 | 930 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1 << 28
#define MAX_V 600
struct edge {
int to, cap, rev;
edge() {}
edge(int to, int cap, int rev) : to(to), cap(cap), rev(rev) {}
};
vector<edge> G[MAX_V];
map<int, int> M[MAX_V];
int level[MAX_V];
int iter[MAX_V];
void add_edge(int from, int to, int ca... | #include <bits/stdc++.h>
using namespace std;
#define INF 1 << 28
#define MAX_V 600
struct edge {
int to, cap, rev;
edge() {}
edge(int to, int cap, int rev) : to(to), cap(cap), rev(rev) {}
};
vector<edge> G[MAX_V];
map<int, int> M[MAX_V];
int level[MAX_V];
int iter[MAX_V];
void add_edge(int from, int to, int ca... | [["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 22]] | 1 | 952 | 2 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
struct edge {
int to, cap, rev;
};
vector<edge> E[500];
bool used[500];
int d[500][500];
void add_edge(int from, int to, int cap) {
E[from].push_back({to, cap, (int)E[to].size()});
E[to].push_back({from, cap, (int)E[fro... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
struct edge {
int to, cap, rev;
};
vector<edge> E[500];
bool used[500];
int d[500][500];
void add_edge(int from, int to, int cap) {
E[from].push_back({to, cap, (int)E[to].size()});
E[to].push_back({from, cap, (int)E[fro... | [["-", 0, 57, 64, 9, 0, 57, 64, 116, 0, 117], ["+", 0, 57, 64, 9, 0, 57, 64, 126, 0, 127], ["+", 0, 57, 64, 9, 0, 57, 64, 126, 128, 129], ["+", 8, 9, 0, 14, 8, 9, 0, 97, 128, 129], ["+", 8, 9, 0, 14, 8, 9, 0, 97, 0, 102], ["+", 0, 14, 8, 9, 0, 97, 0, 1, 0, 35]] | 1 | 864 | 6 |
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using i64 = long long;
struct Graph {
struct edge {
int to;
i64 cap;
i64 rev;
bool alive;
};
int n;
vector<vector<edge>> edges;
Graph(int N) {
n = N;
edges.resize(n, vector<edge>());
}
int size() const... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
using i64 = long long;
struct Graph {
struct edge {
int to;
i64 cap;
i64 rev;
bool alive;
};
int n;
vector<vector<edge>> edges;
Graph(int N) {
n = N;
edges.resize(n, vector<edge>());
}
int size() const... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 60], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["-", 64, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 64, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 742 | 6 |
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using i64 = long long;
struct Graph {
struct edge {
int to;
i64 cap;
i64 rev;
bool alive;
};
int n;
vector<vector<edge>> edges;
Graph(int N) {
n = N;
edges.resize(n, vector<edge>());
}
int size() const... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
using i64 = long long;
struct Graph {
struct edge {
int to;
i64 cap;
i64 rev;
bool alive;
};
int n;
vector<vector<edge>> edges;
Graph(int N) {
n = N;
edges.resize(n, vector<edge>());
}
int size() const... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 60], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 894 | 2 |
#include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
const int INF = 1e8;
using namespace std;
class Edge {
public:
int to, cap, rev;
Edge(int to, int... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
const int INF = 1e8;
using namespace std;
class Edge {
public:
int to, cap, rev;
Edge(int to, int... | [["-", 64, 9, 0, 57, 15, 339, 51, 2, 63, 22], ["+", 64, 9, 0, 57, 15, 339, 51, 2, 63, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 2, 63, 22], ["-", 0, 9, 0, 57, 15, 339, 51, 2, 63, 22], ["+", 0, 9, 0, 57, 15, 339, 51, 2, 63, 22], ["-", 75, 76, 0, 9, 0, 1, 0, 2, 63, 22], ["+", 75, 76, 0, 9... | 1 | 1,419 | 12 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif
typedef long long int ll;
typedef pair<... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif
typedef long long int ll;
typedef pair<... | [["+", 12, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["-", 12, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["-", 12, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 612 | 4 |
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
public class Main {
public static void main(String[] args) { run(); }
static void run() { new Main().solver(); }
void solver() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), e = sc.... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
public class Main {
public static void main(String[] args) { run(); }
static void run() { new Main().solver(); }
void solver() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), e = sc.... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 47], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 20]] | 3 | 563 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
#define MOD 1000000007
#define MAX_N 210
#define MAX_W 10100
int dp[2][MAX_N][MAX_W];
int N, W, x[MAX_N];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++) {
cin >> x[i];
}
x[N + 1] = W + 1;
sort(x, x + N);
dp[1][1][0] = 1;
for (int... | #include <algorithm>
#include <iostream>
using namespace std;
#define MOD 1000000007
#define MAX_N 210
#define MAX_W 10100
int dp[2][MAX_N][MAX_W];
int N, W, x[MAX_N];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++) {
cin >> x[i];
}
x[N + 1] = W + 1;
sort(x + 1, x + N + 1);
dp[1][1][0] = 1;
... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 428 | 4 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vvd = vector<vd>;
#define REP(i, n) for (ll i = 0;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vvd = vector<vd>;
#define REP(i, n) for (ll i = 0;... | [["+", 31, 2, 63, 2, 3, 4, 0, 2, 63, 22], ["+", 63, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["+", 63, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 63, 2, 3, 4, 0, 2, 3, 4, 0, 21], ["+", 63, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 497 | 5 |
#include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long ll;
ll dp[202][20011] = {1}, ans;
int n, W, w[201], sum[201];
int main() {
cin >> n >> W;
for (int i = 0; i < n; i++)
cin >> w[i];
sort(w, w + n, greater<int>());
sum[n - 1] = w[n - 1];
for (int i = n - 2; i >= 0; i--)... | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long ll;
ll dp[202][20011] = {1}, ans;
int n, W, w[201], sum[201];
int main() {
cin >> n >> W;
for (int i = 0; i < n; i++)
cin >> w[i];
sort(w, w + n, greater<int>());
sum[n - 1] = w[n - 1];
for (int i = n - 2; i >= 0; i--)... | [["+", 0, 1, 0, 16, 31, 16, 12, 2, 63, 22], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 24], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 21], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 25]] | 1 | 309 | 5 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll solve(int N, int W, vector<int> &w) {
vector<int> sum(N + 1);
sort(w.begin(), w.end());
for (int i = 0; i < N; i++) {
sum[i + 1] = sum[i] + w[i];
}
if (sum[N] <= W) {
return 1;
}
ll res =... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll solve(int N, int W, vector<int> &w) {
vector<int> sum(N + 1);
sort(w.begin(), w.end());
for (int i = 0; i < N; i++) {
sum[i + 1] = sum[i] + w[i];
}
if (sum[N] <= W) {
return 1;
}
ll res =... | [["+", 49, 50, 51, 2, 3, 4, 0, 16, 17, 72], ["+", 49, 50, 51, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 348 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1000000007
typedef /*long long*/ int LLI;
int n;
int W;
int myws[201];
int imos[201];
LLI dp[2][10001][201];
int main() {
scanf("%d%d", &n, &W);
for (int i = 1; i <= n; i++) {
scanf("%d", &myws[i]);
}
sort(myws + 1, myws + n... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1000000007
typedef /*long long*/ int LLI;
int n;
int W;
int myws[201];
int imos[201];
LLI dp[2][11451][201];
int main() {
scanf("%d%d", &n, &W);
for (int i = 1; i <= n; i++) {
scanf("%d", &myws[i]);
}
sort(myws + 1, myws + n... | [["-", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 57, 64, 1, 0, 11, 12, 2, 63, 22], ["+", 64, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["+", 64, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["+", 64, 1, 0, 11, 12, 2, 3, 4, 0, 13], ["+", 64, 1, 0, 11, 12, 2, 3, 4, 0, 25]] | 1 | 443 | 7 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define MOD (1000000007)
int dp[2][201][10010];
int main() {
int N, W;
cin >> N >> W;
vector<int> friends;
for (int i = 0; i < N; ++i) {
int w;
cin >> w;
// ??????????????????????????????
if (w... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define MOD (1000000007)
int dp[2][201][10010];
int main() {
int N, W;
cin >> N >> W;
vector<int> friends;
for (int i = 0; i < N; ++i) {
int w;
cin >> w;
// ??????????????????????????????
if (w... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 440 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define mp(a, b) make_pair((a), (b))
#define pb(a) push_back((a))
#define all(x) (x).begin(), (x).end()
#define uniq(x) sort(all(x)), (x).erase(unique(all(x)), end(x))
#define fi... | #include <bits/stdc++.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define mp(a, b) make_pair((a), (b))
#define pb(a) push_back((a))
#define all(x) (x).begin(), (x).end()
#define uniq(x) sort(all(x)), (x).erase(unique(all(x)), end(x))
#define fi... | [["+", 0, 7, 10, 43, 49, 50, 51, 2, 63, 22], ["+", 10, 43, 49, 50, 51, 2, 3, 4, 0, 24], ["+", 10, 43, 49, 50, 51, 2, 3, 4, 0, 13], ["+", 10, 43, 49, 50, 51, 2, 3, 4, 0, 21], ["+", 10, 43, 49, 50, 51, 2, 3, 4, 0, 25]] | 1 | 543 | 5 |
#include <algorithm>
#include <iostream>
using namespace std;
int dp[11111];
int W, w[222], n, M = 1e9 + 7;
main() {
cin >> n >> W;
for (int i = 0; i < n; i++) {
cin >> w[i];
W -= w[i];
}
sort(w, w + n, greater<int>());
int ans = 0;
dp[0] = 1;
for (int i = 0; i < n; i++) {
W += w[i];
for (... | #include <algorithm>
#include <iostream>
using namespace std;
int dp[11111];
int W, w[222], n, M = 1e9 + 7;
main() {
cin >> n >> W;
for (int i = 0; i < n; i++) {
cin >> w[i];
W -= w[i];
}
sort(w, w + n, greater<int>());
int ans = 0;
dp[0] = 1;
for (int i = 0; i < n; i++) {
W += w[i];
for (... | [["-", 8, 9, 0, 7, 15, 16, 31, 16, 17, 47], ["+", 8, 9, 0, 7, 15, 16, 31, 16, 17, 20]] | 1 | 219 | 2 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
const int mod = 1e9 + 7;
int n, w;
int dp[210][10010];
int nxt[210][10010];
int main() {
cin >> n >> w;
vector<int> a(n);
rep(i, 0, n) cin >> a[i];
sort(a.begin(), a.end());
a.push_back(0);
dp[n][0] = 1;
rep(i... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
const int mod = 1e9 + 7;
int n, w;
int dp[210][10010];
int nxt[210][10010];
int main() {
cin >> n >> w;
vector<int> a(n);
rep(i, 0, n) cin >> a[i];
sort(a.begin(), a.end());
a.push_back(w + 1);
dp[n][0] = 1;
r... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 354 | 4 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n... | [["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131]] | 1 | 1,500 | 6 |
#ifndef ___Geometry_Library
#define ___Geometry_Library
// ------ Includes ------ //
#include <algorithm>
#include <cmath>
#include <complex>
#include <utility>
#include <vector>
// ------ Defines ------ //
typedef long double GType;
typedef std::complex<GType> Point;
typedef std::pair<Point, Point> Segment;
// ----... | #ifndef ___Geometry_Library
#define ___Geometry_Library
// ------ Includes ------ //
#include <algorithm>
#include <cmath>
#include <complex>
#include <utility>
#include <vector>
// ------ Defines ------ //
typedef long double GType;
typedef std::complex<GType> Point;
typedef std::pair<Point, Point> Segment;
// ----... | [["-", 64, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 64, 9, 0, 1, 0, 2, 63, 118, 28, 22]] | 1 | 1,030 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef complex<double> P;
const double eps = 1e-8;
double dot(P a, P b) { return real(conj(a) * b); }
double cross(P a, P b) { return imag(conj(a) * b); }
int ccw(P a, P b, P c) {
b -= a;
c -= a;
if (cross(b, c) > eps)
return 1;
if (cross(b, c) < -eps)
retu... | #include <bits/stdc++.h>
using namespace std;
typedef complex<double> P;
const double eps = 1e-8;
double dot(P a, P b) { return real(conj(a) * b); }
double cross(P a, P b) { return imag(conj(a) * b); }
int ccw(P a, P b, P c) {
b -= a;
c -= a;
if (cross(b, c) > eps)
return 1;
if (cross(b, c) < -eps)
retu... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 1,139 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i, a) for (auto &i : a)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define RFOR(i, a, b) for (ll i = (b)-1; i >= (a); i--)
#define REP(i, n) for (l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i, a) for (auto &i : a)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define RFOR(i, a, b) for (ll i = (b)-1; i >= (a); i--)
#define REP(i, n) for (l... | [["+", 0, 37, 0, 16, 31, 23, 0, 16, 17, 72], ["+", 0, 37, 0, 16, 31, 23, 0, 16, 12, 22]] | 1 | 684 | 2 |
#include <bits/stdc++.h>
/*
*/
using namespace std;
typedef pair<long long int, pair<long long int, long long int>> one;
#define mod 1000000007LL
int main() {
long long int W, H;
cin >> W >> H;
vector<string> D(H);
long long int counttile = 0;
pair<long long int, long long int> start, goal;
vector<pair<... | #include <bits/stdc++.h>
/*
*/
using namespace std;
typedef pair<long long int, pair<long long int, long long int>> one;
#define mod 1000000007LL
int main() {
long long int W, H;
cin >> W >> H;
vector<string> D(H);
long long int counttile = 0;
pair<long long int, long long int> start, goal;
vector<pair<... | [["-", 8, 9, 0, 43, 49, 50, 51, 16, 31, 22], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 17, 85], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 31, 22], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 17, 48], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 48], ["+",... | 1 | 1,021 | 8 |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long double ld;
const int MAX = 501, IINF = INT_MAX;
const ld LDINF = 1e100;
int H, W, sx, sy, gx, gy;
ld mincost[MAX... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long double ld;
const int MAX = 501, IINF = INT_MAX;
const ld LDINF = 1e100;
int H, W, sx, sy, gx, gy;
ld mincost[MAX... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 858 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
int p[111111];
int main(void) {
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
p[a - 1]++;
p[b]--;
}
int best = 0;
for (int i = 1; i <= 100001; i++) {
p[i] += p[i - 1];
if (i < p[i]... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
int p[111111];
int main(void) {
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
p[a - 1]++;
p[b]--;
}
int best = 0;
for (int i = 1; i <= 100001; i++) {
p[i] += p[i - 1];
if (i <= p[i... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 125 | 2 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
static int v[100010];
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
++v[a];
--v[b + 1];
}
int ans = 0;
int acc = 0;
for (int i = 1; i <= N; i++) {
acc += v[i];
if (acc >= i) {
ans = i - 1;
... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
static int v[100010];
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
++v[a];
--v[b + 1];
}
int ans = 0;
int acc = 0;
for (int i = 0; i <= N + 1; i++) {
acc += v[i];
if (acc >= i - 1) {
ans = i -... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 123 | 6 |
#include <algorithm>
#include <iostream>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
using namespace std;
const int INF = 1 << 29;
int x[100010];
int main() {
int n;
cin >> n;
rep(i, n) {
int a, b;
cin >> a >> b;
x[a]++, x[b + 1]--;
}
... | #include <algorithm>
#include <iostream>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
using namespace std;
const int INF = 1 << 29;
int x[100010];
int main() {
int n;
cin >> n;
rep(i, n) {
int a, b;
cin >> a >> b;
x[a]++, x[b + 1]--;
}
... | [["-", 0, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 142 | 2 |
s=Array.new(100001,0)
gets.to_i.times{a,b=gets.split.map(&:to_i);s[a-1]+=1;s[b]-=1}
t=0;p 1.step(100000).reduce(0){|a,i|a=(t+=s[i])<i ?a: i} | s=Array.new(100002,0)
gets.to_i.times{a,b=gets.split.map(&:to_i);s[a-1]+=1;s[b]-=1}
t=0;p 1.step(100000).reduce(0){|a,i|(t+=s[i])<i ? a : i} | [["-", 0, 493, 0, 662, 12, 652, 3, 4, 0, 612], ["+", 0, 493, 0, 662, 12, 652, 3, 4, 0, 612], ["-", 0, 652, 196, 196, 8, 734, 0, 662, 31, 22], ["-", 0, 652, 196, 196, 8, 734, 0, 662, 0, 32]] | 4 | 85 | 4 |
N = int(input())
t = [0 for i in range(100002)]
for i in range(N):
a,b = [int(i) for i in input().split(' ')]
t[a-1] +=1
t[b] -= 1
ans = 0
for i in range(1,100001):
t[i] += t[i-1]
if (t[i] > i):
ans = i
print(ans)
| N = int(input())
t = [0 for i in range(100002)]
for i in range(N):
a,b = [int(i) for i in input().split(' ')]
t[a-1] +=1
t[b] -= 1
ans = 0
#print(t)
for i in range(1,100002):
t[i] += t[i-1]
if (t[i] >= i):
ans = i
#print(t)
print(ans)
| [["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["-", 8, 196, 0, 57, 15, 23, 0, 666, 667, 47], ["+", 8, 196, 0, 57, 15, 23, 0, 666, 667, 20]] | 5 | 106 | 4 |
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct Node {
int now, step;
};
bool operator>(const Node &n1, const Node &n2) { return n1.step > n2.step; }
int main() {
int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; ++i)
cin >> v[i];
vector<int> ans(N, 1e9);
... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct Node {
int now, step;
};
bool operator>(const Node &n1, const Node &n2) { return n1.step > n2.step; }
int main() {
int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; ++i)
cin >> v[i];
vector<int> ans(N, 1e9);
... | [["-", 75, 76, 0, 9, 0, 7, 15, 16, 17, 18], ["+", 75, 76, 0, 9, 0, 7, 15, 16, 17, 19]] | 1 | 279 | 2 |
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
vector<int> dijkstra(int N, vector<vector<pair<int, int>>> &G) {
int INF = 1000000000;
vector<int> ret(N, INF);
priority_queue<pair<int, int>> wait;
wait.emplace(0, 0);
while (!wait.empty()) {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
vector<int> dijkstra(int N, vector<vector<pair<int, int>>> &G) {
int INF = 1000000000;
vector<int> ret(N, INF);
priority_queue<pair<int, int>> wait;
wait.emplace(0, 0);
while (!wait.empty()) {
... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 117], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 569 | 6 |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using pii = pair<int, int>;
using vlai = valarray<int>;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define range(i, ... |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using pii = pair<int, int>;
using vlai = valarray<int>;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define range(i, ... | [["-", 12, 16, 31, 2, 3, 4, 0, 69, 28, 22], ["-", 31, 2, 3, 4, 0, 69, 341, 342, 0, 70], ["+", 12, 16, 31, 2, 3, 4, 0, 2, 63, 22], ["+", 31, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["-", 31, 2, 3, 4, 0, 69, 341, 342, 0, 73], ["+", 31, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 523 | 6 |
N = gets.to_i
P = N.times.map{gets.to_i} + [0]*6
move = [nil]*(N+6)
(N+6).times do |i|
ptr = i
stack = []
while move[ptr] == nil
if P[ptr] == 0
move[ptr] = ptr
break
end
move[ptr] = -1
stack << ptr
ptr = ptr + P[ptr]
end
if move[ptr]... | N = gets.to_i
P = N.times.map{gets.to_i} + [0]*6
move = [nil]*(N+6)
(N+6).times do |i|
ptr = i
stack = []
while move[ptr] == nil
if P[ptr] == 0
move[ptr] = ptr
break
end
move[ptr] = -1
stack << ptr
ptr = ptr + P[ptr]
end
if move[ptr]... | [["-", 8, 736, 0, 121, 15, 738, 31, 738, 17, 18], ["-", 8, 736, 0, 121, 15, 738, 31, 738, 12, 612], ["+", 8, 736, 0, 121, 15, 738, 31, 738, 17, 60], ["+", 8, 736, 0, 121, 15, 738, 31, 738, 12, 147], ["-", 8, 736, 0, 121, 15, 738, 12, 738, 17, 60], ["-", 8, 736, 0, 121, 15, 738, 12, 738, 12, 147], ["+", 8, 736, 0, 121, ... | 4 | 253 | 8 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erev(i, m, n) for (int i = n; i >= m; i--)
typedef long long int ll;
const ll MOD = 1000000007LL;
int N;
ll W;
ll w[222];
ll dp[11111];
ll v[222];
int main(int argc, char *argv[]) {
cin >> N >> W;
rep(i, N) cin >>... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erev(i, m, n) for (int i = n; i >= m; i--)
typedef long long int ll;
const ll MOD = 1000000007LL;
int N;
ll W;
ll w[222];
ll dp[11111];
ll v[222];
int main(int argc, char *argv[]) {
cin >> N >> W;
rep(i, N) cin >>... | [["+", 0, 1, 0, 16, 31, 16, 12, 2, 63, 22], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 24], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 21], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 25]] | 1 | 273 | 5 |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <vector>
using namespace std;
int main() {
const int M = 1000000007;
int N, W;
scanf("%d%d", &N, &W);
vector<int> w(N);
vector<vector<int>> bag(N + 1);
bag[0].resize(W + 1);
bag[0][0] = 1;
for (int i = 0; i < N; i++) {
scanf("%d"... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <vector>
using namespace std;
int main() {
const int M = 1000000007;
int N, W;
scanf("%d%d", &N, &W);
vector<int> w(N);
vector<vector<int>> bag(N + 1);
bag[0].resize(W + 1);
bag[0][0] = 1;
for (int i = 0; i < N; i++) {
scanf("%d"... | [["-", 0, 16, 12, 23, 0, 41, 15, 16, 17, 47], ["+", 0, 16, 12, 23, 0, 41, 15, 16, 17, 20]] | 1 | 335 | 14 |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
// < "D:\D_Download\Visual Studio
// 2015\Projects\programing_contest_c++\Debug\a.txt"
int dp[... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
// < "D:\D_Download\Visual Studio
// 2015\Projects\programing_contest_c++\Debug\a.txt"
int dp[... | [["+", 0, 7, 10, 43, 49, 50, 51, 2, 63, 22], ["+", 10, 43, 49, 50, 51, 2, 3, 4, 0, 24], ["+", 10, 43, 49, 50, 51, 2, 3, 4, 0, 13], ["+", 10, 43, 49, 50, 51, 2, 3, 4, 0, 21], ["+", 10, 43, 49, 50, 51, 2, 3, 4, 0, 25]] | 1 | 626 | 5 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> i_i;
int f(int W, vector<vector<int>> &dp, int x) {
vector<int> a, b;
for (int j = 1; j <= W; j++)
for (int k = 0; k < 2; k++)
if (dp[k][j] && dp[k][j] >= x) {
a.push_back(k);
b.push_back(j);
}
int mini = INT_MAX... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> i_i;
int f(int W, vector<vector<int>> &dp, int x) {
vector<int> a, b;
for (int j = 1; j <= W; j++)
for (int k = 0; k < 2; k++)
if (dp[k][j] && dp[k][j] >= x) {
a.push_back(k);
b.push_back(j);
}
int mini = INT_MAX... | [["-", 0, 7, 8, 9, 0, 43, 49, 50, 51, 22], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 51, 22]] | 1 | 668 | 2 |
import java.util.Scanner;
public class Main {
public void run() {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int right = 0, left = 0;
for (int i = 0; i < n; i++) {
long x = in.nextInt();
char c = in.next().charAt(0);
long a = in.nextInt();
if (c == '(')
... | import java.util.Scanner;
public class Main {
public void run() {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
long right = 0, left = 0;
for (int i = 0; i < n; i++) {
long x = in.nextLong();
char c = in.next().charAt(0);
long a = in.nextLong();
if (c == '(')
... | [["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 506, 0, 96], ["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["-", 0, 492, 3, 4, 0, 510, 64, 5, 0, 491], ["+", 0, 492, 3, 4, 0, 510, 64, 5, 0, 491], ["-", 0, 492, 3, 4, 0, 510, 75, 5, 0... | 3 | 153 | 10 |
#include <stdio.h>
int main(void) {
int q, p, n, l, r;
char c;
scanf("%d", &q);
l = r = 0;
while (q--) {
scanf("%d %c %d", &p, &c, &n);
if (c == '(') {
l += n;
} else {
r += n;
}
printf("%s\n", l == r ? "YES" : "NO");
}
return 0;
} | #include <stdio.h>
int main(void) {
long long q, p, n, l, r;
char c;
scanf("%d", &q);
l = r = 0;
while (q--) {
scanf("%lld %c %lld", &p, &c, &n);
if (c == '(') {
l += n;
} else {
r += n;
}
printf("%s\n", l == r ? "Yes" : "No");
}
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 2, 3, 4, 0, 41, 64, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 41, 64, 5, 0, 6], ["-", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6]] | 0 | 106 | 9 |
#include <iostream>
using namespace std;
int main() {
int q;
cin >> q;
long long l = 0, r = 0;
while (q--) {
int p, n;
char c;
cin >> p >> c >> n;
(c == '(' ? l : r) += n;
cout << (l == r ? "YES\n" : "NO\n");
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int q;
cin >> q;
long long l = 0, r = 0;
while (q--) {
int p, n;
char c;
cin >> p >> c >> n;
(c == '(' ? l : r) += n;
cout << (l == r ? "Yes\n" : "No\n");
}
return 0;
} | [["-", 0, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["+", 0, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["-", 0, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 0, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 87 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; ... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 146 | 4 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#inc... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#inc... | [["-", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["-", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 267 | 4 |
#include <bits/stdc++.h>
#include <regex>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) begin(a), end(a)
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pai... | #include <bits/stdc++.h>
#include <regex>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) begin(a), end(a)
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pai... | [["-", 0, 2, 3, 4, 0, 41, 64, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 41, 64, 5, 0, 6], ["-", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6]] | 1 | 232 | 4 |
#include <iostream>
using namespace std;
int main() {
int q;
cin >> q;
int brac_diff = 0;
for (int j = 0; j < q; ++j) {
int p, n;
char c;
cin >> p >> c >> n;
if (c == '(') {
brac_diff += n;
} else {
brac_diff -= n;
}
cout << (brac_diff == 0 ? "YES" : "NO") << endl;
}
... | #include <iostream>
using namespace std;
int main() {
int q;
cin >> q;
long long brac_diff = 0;
for (int j = 0; j < q; ++j) {
int p, n;
char c;
cin >> p >> c >> n;
if (c == '(') {
brac_diff += n;
} else {
brac_diff -= n;
}
cout << (brac_diff == 0 ? "Yes" : "No") << endl;... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["-", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 98 | 7 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 227 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#def... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#def... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 248 | 6 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i, a) for (auto &&i : a)
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i, a) for (auto &&i : a)
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 391 | 4 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long cnt = 0;
for (int i = 0; i < n; i++) {
int a, b;
char c;
cin >> a >> b >> c;
c == '(' ? cnt += b : cnt -= b;
!cnt ? cout << "Yes" << endl : cout << "No" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long cnt = 0;
for (int i = 0; i < n; i++) {
int a, b;
char c;
cin >> a >> c >> b;
c == '(' ? cnt += b : cnt -= b;
!cnt ? cout << "Yes" << endl : cout << "No" << endl;
}
return 0;
}
| [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 93 | 4 |
cnt = 0
for loop in range(int(input())):
a,c,n = input().split()
n = int(n)
cnt += n if c == "(" else -n
print("YES" if cnt == 0 else "NO")
| cnt = 0
for loop in range(int(input())):
a,c,n = input().split()
n = int(n)
cnt += n if c == "(" else -n
print("Yes" if cnt == 0 else "No")
| [["-", 0, 652, 3, 4, 0, 41, 0, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 41, 0, 557, 0, 6]] | 5 | 61 | 4 |
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#includ... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#includ... | [["+", 3, 4, 0, 191, 51, 83, 0, 16, 17, 33], ["+", 3, 4, 0, 191, 51, 83, 0, 16, 12, 13]] | 1 | 1,331 | 4 |
#include <bits/stdc++.h>
using namespace std;
// h, w, dir, P, Q
typedef struct _State {
int h, w, dir;
vector<int> pq;
bool operator<(const _State r) const {
return r.h == h
? r.w == w ? r.dir == dir ? r.pq < pq : r.dir < dir : r.w < w
: r.h < h;
}
} State;
int N, M, A;
int... | #include <bits/stdc++.h>
using namespace std;
// h, w, dir, P, Q
typedef struct _State {
int h, w, dir;
vector<int> pq;
bool operator<(const _State r) const {
return r.h == h
? r.w == w ? r.dir == dir ? r.pq < pq : r.dir < dir : r.w < w
: r.h < h;
}
} State;
int N, M, A;
int... | [["-", 8, 9, 0, 7, 8, 7, 15, 16, 12, 22], ["+", 8, 9, 0, 7, 8, 7, 15, 16, 12, 22]] | 1 | 625 | 2 |
#include <bits/stdc++.h>
using namespace std;
// h, w, dir, P, Q
typedef struct _State {
int h, w, dir;
vector<int> pq;
} State;
int N, M, A;
int Sh, Sw, Gh, Gw;
vector<string> field;
// south is 0
int dh[] = {1, -1, 0, 0};
int dw[] = {0, 0, 1, -1};
int table[2][4] = {{2, 3, 0, 1}, {3, 2, 1, 0}};
int dist[110]... | #include <bits/stdc++.h>
using namespace std;
// h, w, dir, P, Q
typedef struct _State {
int h, w, dir;
vector<int> pq;
} State;
int N, M, A;
int Sh, Sw, Gh, Gw;
vector<string> field;
// south is 0
int dh[] = {1, -1, 0, 0};
int dw[] = {0, 0, 1, -1};
int table[2][4] = {{2, 3, 0, 1}, {3, 2, 1, 0}};
int dist[110]... | [["-", 8, 9, 0, 7, 8, 7, 15, 16, 12, 22], ["+", 8, 9, 0, 7, 8, 7, 15, 16, 12, 22]] | 1 | 753 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long i64;
typedef long double ld;
typedef pair<i64, i64> P;
#define rep(i, s, e) for (int i = (s); i <= (e); i++)
int n;
vector<vector<int>> edg... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long i64;
typedef long double ld;
typedef pair<i64, i64> P;
#define rep(i, s, e) for (int i = (s); i <= (e); i++)
int n;
vector<vector<int>> edg... | [["+", 0, 57, 64, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 57, 75, 76, 0, 57, 75, 76, 0, 95], ["-", 64, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 60]] | 1 | 519 | 5 |
#include <algorithm>
#include <array>
#include <iostream>
using namespace std;
int rec(const array<int, 16> &a, int d) {
if (count(begin(a), end(a), 0) == 16)
return 0;
if (d == 0)
return 9;
int m = 9;
for (int i = 0; i < 16; i++) {
auto n = a;
n[i]++;
if (n[i] >= 5) {
n[i] = 0;
... | #include <algorithm>
#include <array>
#include <iostream>
using namespace std;
int rec(const array<int, 16> &a, int d) {
if (count(begin(a), end(a), 0) == 16)
return 0;
if (d == 0)
return 9;
int m = 9;
for (int i = 0; i < 16; i++) {
auto n = a;
n[i]++;
if (n[i] >= 5) {
n[i] = 0;
... | [["-", 12, 23, 0, 41, 15, 23, 0, 16, 17, 47], ["+", 12, 23, 0, 41, 15, 23, 0, 16, 17, 19]] | 1 | 420 | 2 |
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<vector<int>, int> P;
typedef pair<int, int> P2;
typedef pair<P2, P2> P3;
int a[4][4], o;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
vector<int> vp(16), tmp(16);
set<vector<int>> s;
vector<int> get(vector<int>... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<vector<int>, int> P;
typedef pair<int, int> P2;
typedef pair<P2, P2> P3;
int a[4][4], o;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
vector<int> vp(16), tmp(16);
set<vector<int>> s;
vector<int> get(vector<int>... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 795 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define resz(v, ...) (v).clear(), (v).resize(__VA_ARGS__)
#define reps(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) reps(i, 0, n)
template <class T1, class T2> void chmin(T1 &a, T2 b) {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define resz(v, ...) (v).clear(), (v).resize(__VA_ARGS__)
#define reps(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) reps(i, 0, n)
template <class T1, class T2> void chmin(T1 &a, T2 b) {
... | [["-", 75, 76, 0, 9, 0, 57, 75, 76, 0, 95]] | 1 | 847 | 1 |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args) {
IO io = new IO();
int n = io... | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args) {
IO io = new IO();
int n = io... | [["-", 0, 195, 8, 196, 0, 503, 49, 200, 141, 22], ["+", 0, 195, 8, 196, 0, 503, 49, 200, 141, 22]] | 3 | 2,034 | 4 |
#include <bits/stdc++.h>
using namespace std;
vector<int> Ws[100001], Hs[100001];
int par[40000];
int find(int x) { return (par[x] >= 0 ? par[x] = find(par[x]) : x); }
void merge(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (-par[x] < -par[y])
swap(x, y);
par[x] += par[y];
pa... | #include <bits/stdc++.h>
using namespace std;
vector<int> Ws[100001], Hs[100001];
int par[40000];
int find(int x) { return (par[x] >= 0 ? par[x] = find(par[x]) : x); }
void merge(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (-par[x] < -par[y])
swap(x, y);
par[x] += par[y];
pa... | [["+", 0, 2, 3, 4, 0, 41, 64, 16, 31, 22], ["+", 0, 2, 3, 4, 0, 41, 64, 16, 17, 33]] | 1 | 453 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define MAX 100005
int N, H, W;
int y, x;
vector<int> G[2][MAX];
bool visited[2][MAX];
int flg[4], cnt[4];
void dfs(int f, int p) {
visited[f][p] = true;
if (p == 0)
flg[f] = true;
if (p == (f == 0 ? H : W))
flg[2 + f] = true;
int r = 1 - f;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
#define MAX 100005
int N, H, W;
int y, x;
vector<int> G[2][MAX];
bool visited[2][MAX];
int flg[4], cnt[4];
void dfs(int f, int p) {
visited[f][p] = true;
if (p == 1)
flg[f] = true;
if (p == (f == 0 ? H : W))
flg[2 + f] = true;
int r = 1 - f;
for (int i =... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 433 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, f, n) for (int i = (f); i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define each(it, v) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, f, n) for (int i = (f); i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define each(it, v) ... | [["-", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22]] | 1 | 713 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define each(itr, c) \
for (__typeof(c.begin()) itr = c.begin(); itr != c.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define each(itr, c) \
for (__typeof(c.begin()) itr = c.begin(); itr != c.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define... | [["-", 341, 342, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 341, 342, 0, 2, 3, 4, 0, 66, 28, 22]] | 1 | 873 | 2 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int a, b, H, W, N, used[100009], c, d;
vector<int> x[50009];
vector<pair<int, int>> X[100009], Y[100009];
int main() {
cin >> N >> H >> W;
for (int i = 0; i < N; i++) {
cin >> a >> b;
if (a == 1 || b == 1 || a =... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int a, b, H, W, N, used[100009], c, d;
vector<int> x[50009];
vector<pair<int, int>> X[100009], Y[100009];
int main() {
cin >> N >> H >> W;
for (int i = 0; i < N; i++) {
cin >> a >> b;
if (a == 1 || b == 1 || a =... | [["-", 0, 1, 0, 2, 63, 118, 28, 69, 28, 22], ["+", 0, 1, 0, 2, 63, 118, 28, 69, 28, 22]] | 1 | 516 | 2 |
#include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int N;
int W, H;
vector<tuple<int, int, int>> tupX, tupY;
int parent[40005];
void init() {
for (int i = 0; i < N; i++)
parent[i] = i;
}
int root(int i) {
if (parent[i] == i)
return i;
return parent[i] = r... | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int N;
int W, H;
vector<tuple<int, int, int>> tupX, tupY;
int parent[40005];
void init() {
for (int i = 0; i < N; i++)
parent[i] = i;
}
int root(int i) {
if (parent[i] == i)
return i;
return parent[i] = r... | [["+", 8, 9, 0, 43, 49, 50, 51, 2, 63, 22]] | 1 | 513 | 1 |
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
struct UnionFind {
vector<int> data;
UnionFind(int n) : data(n, -1) {}
bool unite(int x, int y) {
x = find(x);
y = find(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];... | #include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
struct UnionFind {
vector<int> data;
UnionFind(int n) : data(n, -1) {}
bool unite(int x, int y) {
x = find(x);
y = find(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 499 | 4 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 707 | 4 |
#include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int,... | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int,... | [["-", 0, 52, 15, 339, 51, 16, 12, 16, 17, 20], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 47]] | 1 | 486 | 2 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> inline T sqr(T x) { return x * x; }
typedef vector<int> v... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> inline T sqr(T x) { return x * x; }
typedef vector<int> v... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 7, 8, 9, 0, 43, 39, 78]] | 1 | 338 | 4 |
#include <algorithm>
#include <array>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (in... | #include <algorithm>
#include <array>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (in... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 8, 1, 0, 11, 12, 16, 31, 23, 0, 24], ["-", 12, 23, 0, 16, 12, 2, 3, 4, 0, 25]] | 1 | 284 | 4 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 78], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["-", 8, 9, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 14, 8, 9, 0, 43, 39, 78]] | 1 | 236 | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, mod = 1e9 + 7;
std::cin >> n >> t;
vector<int> d(n);
for (int i = 0; i < n; i++) {
std::cin >> d[i];
}
sort(d.begin(), d.end());
vector<int> dp(n);
vector<int> hoge(n, 1);
for (int i = 1; i < n; i++) {
hoge[i] = (d.begin() +... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, mod = 1e9 + 7;
std::cin >> n >> t;
vector<int> d(n);
for (int i = 0; i < n; i++) {
std::cin >> d[i];
}
sort(d.begin(), d.end());
vector<int> dp(n);
vector<int> hoge(n, 1);
for (int i = 1; i < n; i++) {
hoge[i] = (d.begin() +... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 200 | 2 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
typedef pair<int, int> P;
const int mod = 1e9 + 7;
int dp[100010];
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, 0, n) cin >> a[i];
sort(a.begin(), a.end());
dp[0] = 1;
rep(i, 1, n) {
int ... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
const int mod = 1e9 + 7;
int dp[100010];
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, 0, n) cin >> a[i];
sort(a.begin(), a.end());
dp[0] = 1;
... | [["+", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 156]] | 1 | 180 | 5 |
#include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int N, ans = 0;
cin >> N;
int C[N][N];
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
cin >> C[i][j];
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
ans += min(C[i][j], C[j][i]);
cout << ans ... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int N;
long long ans = 0;
cin >> N;
int C[N][N];
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
cin >> C[i][j];
for (int i = 0; i < N; i++)
for (int j = i + 1; j < N; j++)
ans += min(C[i][j], C[j][i])... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 7, 8, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["+", 8, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 8, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 131 | 8 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
int n;
cin >> n;
vector<double> s(n + 1);
rep(i, n + 1) {
int m;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
int n;
cin >> n;
vector<double> s(n + 1);
rep(i, n + 1) {
int m;
... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 180 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n;
double a[11] = {};
cin >> t;
for (int i = 0; i <= t; i++) {
double v[100], r[100], s = 0;
cin >> n >> n;
for (int j = 0; j < n; j++)
cin >> v[j] >> r[j], s += r[j];
for (int j = 0; j < n; j++)
a[i] += v[j] * r[j] / ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, n;
double a[11] = {};
cin >> t;
for (int i = 0; i <= t; i++) {
double v[100], r[100], s = 0;
cin >> n >> n;
for (int j = 0; j < n; j++)
cin >> v[j] >> r[j], s += r[j];
for (int j = 0; j < n; j++)
a[i] += v[j] * r[j] / ... | [["-", 0, 7, 8, 57, 15, 339, 51, 16, 17, 18], ["-", 0, 7, 8, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 7, 8, 57, 15, 339, 51, 16, 17, 47], ["+", 0, 7, 8, 57, 15, 339, 51, 16, 12, 13]] | 1 | 192 | 4 |
#include <iostream>
using namespace std;
int num;
int n, m;
int in;
long double per;
long double sum, sump, now;
int main() {
cin >> num;
for (int i = 0; i < num; i++) {
cin >> n >> m;
sum = 0, sump = 0, now = 0;
for (int j = 0; j < m; j++) {
cin >> in >> per;
sum += in * per;
sump... | #include <iostream>
using namespace std;
int num;
int n, m;
int in;
long double per;
long double sum, sump, now;
int main() {
cin >> num;
for (int i = 0; i < num; i++) {
cin >> n >> m;
sum = 0, sump = 0;
for (int j = 0; j < m; j++) {
cin >> in >> per;
sum += in * per;
sump += per;
... | [["-", 8, 9, 0, 1, 0, 34, 12, 34, 0, 21], ["-", 0, 1, 0, 34, 12, 34, 12, 11, 31, 22], ["-", 0, 1, 0, 34, 12, 34, 12, 11, 17, 32], ["-", 0, 1, 0, 34, 12, 34, 12, 11, 12, 13]] | 1 | 190 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
double getE(int n, int m) {
vector<int> num(m);
vector<double> p(m);
double psum = 0;
rep(j, m) {
cin >> num[j] >> p[j];
psum += p[j];
}
double ex = 0;... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
double getE(int n, int m) {
vector<int> num(m);
vector<double> p(m);
double psum = 0;
rep(j, m) {
cin >> num[j] >> p[j];
psum += p[j];
}
double ex = 0;... | [["+", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["+", 12, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 196 | 5 |
// AOJ 2364: Lucky Dip
// 2017.10.4 bal4u@uu
#include <stdio.h>
#define MAX 1000500
/* UNION-FIND library */
int p[MAX], rank[MAX];
void make_set(int x) { p[x] = x, rank[x] = 0; }
void link(int x, int y) {
if (rank[x] > rank[y])
p[y] = x;
else {
p[x] = y;
if (rank[x] == rank[y])
rank[y] = rank[... | // AOJ 2364: Lucky Dip
// 2017.10.4 bal4u@uu
#include <stdio.h>
#define MAX 1000500
/* UNION-FIND library */
int p[MAX], rank[MAX];
void make_set(int x) { p[x] = x, rank[x] = 0; }
void link(int x, int y) {
if (rank[x] > rank[y])
p[y] = x;
else {
p[x] = y;
if (rank[x] == rank[y])
rank[y] = rank[... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 2, 63, 22], ["+", 64, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 64, 9, 0, 1, 0, 2, 3, 4, 0, 25]] | 0 | 714 | 7 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <tuple>
using namespace std;
int X[2000][2000];
int V[2000][2000];
int H, W, K, SX, SY, X1, Y1;
char c;
int main() {
cin >> W >> H;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> c;
if (c == '#') {
X[i][j]... | #include <algorithm>
#include <iostream>
#include <queue>
#include <tuple>
using namespace std;
int X[2000][2000];
int V[2000][2000];
int H, W, K, SX, SY, X1, Y1;
char c;
int main() {
cin >> W >> H;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> c;
if (c == '#') {
X[i][j]... | [["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 2... | 1 | 721 | 8 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MP make_pair
using namespace std;
typedef pair<int, int> P;
vector<P> open;
int gx, gy;
int W, H, N;
char field[1002][1002];
const int dx[] = {0, ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MP make_pair
using namespace std;
typedef pair<int, int> P;
vector<P> open;
int gx, gy;
int W, H, N;
char field[1002][1002];
const int dx[] = {0, ... | [["-", 0, 43, 49, 50, 51, 83, 0, 16, 17, 33], ["-", 0, 43, 49, 50, 51, 83, 0, 16, 12, 13], ["+", 0, 30, 0, 43, 49, 50, 51, 83, 0, 21], ["+", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13]] | 1 | 539 | 4 |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.util.*;
public class Main {
int INF = 1 << 28;
String str;
int p;
void run() {
Scanner sc = new Scanner(System.in);
str = sc.next() + "z";
cat();
System.out.println((str.charAt(p) == 'z' ? "YES" : "NO"));
}
v... |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.util.*;
public class Main {
int INF = 1 << 28;
String str;
int p;
void run() {
Scanner sc = new Scanner(System.in);
str = sc.next() + "z";
cat();
System.out.println((str.charAt(p) == 'z' ? "Cat" : "Rabbit"));
}
... | [["-", 3, 4, 0, 23, 0, 510, 64, 5, 0, 491], ["+", 3, 4, 0, 23, 0, 510, 64, 5, 0, 491], ["-", 3, 4, 0, 23, 0, 510, 75, 5, 0, 491], ["+", 3, 4, 0, 23, 0, 510, 75, 5, 0, 491]] | 3 | 218 | 4 |
#include <stdio.h>
#include <string.h>
int main(void) {
char str[512], stack[512];
int i, j, sp, l;
// puts(emp);
fgets(str, sizeof(str), stdin);
l = strlen(str);
// printf("%d\n",l);
// puts(str);
if (str[0] != 'm')
puts("Rabbit");
else {
sp = 0;
for (i = 0; i < l - 1; i++) {
stack... | #include <stdio.h>
#include <string.h>
int main(void) {
char str[512], stack[512];
int i, j, sp, l;
// puts(emp);
fgets(str, sizeof(str), stdin);
l = strlen(str);
// printf("%d\n",l);
// puts(str);
if (str[0] != 'm')
puts("Rabbit");
else {
sp = 0;
for (i = 0; i < l - 1; i++) {
stack... | [["-", 0, 57, 64, 9, 0, 1, 0, 2, 63, 22], ["-", 64, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 64, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 64, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 0 | 232 | 7 |
#include <stdio.h>
#include <string.h>
int main(void) {
char str[512], stack[512];
int i, j, sp, l;
// puts(emp);
fgets(str, sizeof(str), stdin);
l = strlen(str);
// printf("%d\n",l);
// puts(str);
if (str[0] != 'm')
puts("Rabbit");
else {
sp = 0;
for (i = 0; i < l - 1; i++) {
stack... | #include <stdio.h>
#include <string.h>
int main(void) {
char str[512], stack[512];
int i, j, sp, l;
fgets(str, sizeof(str), stdin);
l = strlen(str);
if (str[0] != 'm')
puts("Rabbit");
else {
sp = 0;
for (i = 0; i < l - 1; i++) {
stack[sp] = str[i];
if (i >= 2 && stack[sp - 2] == 'm... | [["-", 0, 57, 64, 9, 0, 1, 0, 2, 63, 22], ["-", 64, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 64, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 64, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 0 | 232 | 7 |
/*
AizuOnline A2369
cat checker
*/
#include <stdio.h>
#include <string.h>
#define MAXLEN 500
char S[MAXLEN + 1];
char stack[MAXLEN + 1];
int depth;
int state;
#define AFTERW 0
#define AFTERM 1
#define AFTERMW 2
#define AFTERE 3
#define AFTEREW 4
int ismew(char *s, int len) {
int i, state;
char c;
if (len == 0)
... | /*
AizuOnline A2369
cat checker
*/
#include <stdio.h>
#include <string.h>
#define MAXLEN 500
char S[MAXLEN + 1];
char stack[MAXLEN + 1];
int depth;
int state;
#define AFTERW 0
#define AFTERM 1
#define AFTERMW 2
#define AFTERE 3
#define AFTEREW 4
int ismew(char *s, int len) {
int i, state;
char c;
if (len == 0)
... | [["-", 0, 57, 15, 23, 0, 16, 12, 103, 0, 125], ["+", 0, 57, 15, 23, 0, 16, 12, 103, 0, 125]] | 0 | 330 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define for_(i, a, b) for (int i = a; i < b; ++i)
#define for_rev(i, a, b) for (int i = a; i >= b; --i)
#define allof(a) a.begin(), a.end()
#define minit(a, b) memset(a, b, sizeof(a));
#define size_of(a) (int)a.size()
typedef long long lint;
typedef double Double;
typedef... | #include <bits/stdc++.h>
using namespace std;
#define for_(i, a, b) for (int i = a; i < b; ++i)
#define for_rev(i, a, b) for (int i = a; i >= b; --i)
#define allof(a) a.begin(), a.end()
#define minit(a, b) memset(a, b, sizeof(a));
#define size_of(a) (int)a.size()
typedef long long lint;
typedef double Double;
typedef... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 290 | 2 |
#include <iostream>
#include <string>
using namespace std;
string S;
char dp[501][501];
char dfs(int l, int r) {
// cout << "dfs: " << l << ", " << r << endl;
if (dp[l][r] != -1) {
return dp[l][r];
}
if (l == r) {
return dp[l][r] = 1;
} else if (r - l == 1 || r - l == 2) {
return dp[l][r] = 0;... | #include <iostream>
#include <string>
using namespace std;
string S;
char dp[501][501];
char dfs(int l, int r) {
// cout << "dfs: " << l << "," << r << endl;
if (dp[l][r] != -1) {
return dp[l][r];
}
if (l == r) {
return dp[l][r] = 1;
} else if (r - l == 1 || r - l == 2) {
return dp[l][r] = 0;
... | [["+", 15, 339, 51, 16, 31, 2, 3, 4, 0, 25], ["-", 0, 57, 15, 339, 51, 2, 3, 4, 0, 25]] | 1 | 305 | 2 |
#include <algorithm>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n);... | #include <algorithm>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n);... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40]] | 1 | 367 | 2 |
#include <iostream>
#include <stack>
using namespace std;
int main() {
string s;
cin >> s;
stack<char> sc;
bool neko = true;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'm' || s[i] == 'e' || s[i] == 'w') {
sc.push(s[i]);
if (sc.top() == 'w') {
sc.pop();
if (!sc.empty() ... | #include <iostream>
#include <stack>
using namespace std;
int main() {
string s;
cin >> s;
stack<char> sc;
bool neko = true;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'm' || s[i] == 'e' || s[i] == 'w') {
sc.push(s[i]);
if (sc.top() == 'w') {
sc.pop();
if (!sc.empty() ... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 15, 339, 51, 16, 12, 2, 63, 118, 28, 22], ["+", 15, 339, 51, 16, 12, 2, 63, 118, 17, 131], ["+", 15, 339, 51, 16, 12, 2, 63, 118, 119, 120], ["+", 15, 339, 51, 16, 12, 2, 3, 4, 0, 24], ["+", 15, 339, 51, 16, 12, 2, 3, 4, 0, 25]] | 1 | 256 | 6 |
#include <iostream>
#include <string>
using namespace std;
string o;
void rec(string str) {
// cout << str << endl;
string buf = str;
if (buf.find("mmewe") != -1) {
buf.replace(buf.find("mmewe"), 5, "me");
rec(buf);
} else if (buf.find("emeww") != -1) {
buf.replace(buf.find("emeww"), 5, "ew");
r... | #include <iostream>
#include <string>
using namespace std;
string o;
void rec(string str) {
// cout << str << endl;
string buf = str;
if (buf.find("mmewe") != -1) {
buf.replace(buf.find("mmewe"), 5, "me");
rec(buf);
} else if (buf.find("emeww") != -1) {
buf.replace(buf.find("emeww"), 5, "ew");
r... | [["-", 0, 57, 64, 1, 0, 11, 12, 5, 0, 6], ["+", 0, 57, 64, 1, 0, 11, 12, 5, 0, 6], ["-", 75, 76, 0, 1, 0, 11, 12, 5, 0, 6], ["+", 75, 76, 0, 1, 0, 11, 12, 5, 0, 6]] | 1 | 162 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int m = 0, e = 0, ans = 1;
if (s[0] == 'm')
m++;
for (int i = 1; i < s.size(); i++) {
if (s[i] == 'm') {
if (!m)
ans = 0;
m++;
}
if (s[i] == 'e') {
if (!m)
ans = 0;
e++, m--;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int m = 0, e = 0, ans = 1;
if (s[0] == 'm')
m++;
for (int i = 1; i < s.size(); i++) {
if (s[i] == 'm') {
if (m + e == 0)
ans = 0;
m++;
}
if (s[i] == 'e') {
if (!m)
ans = 0;
e+... | [["-", 64, 9, 0, 57, 15, 339, 51, 91, 17, 111], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 174 | 5 |
#include <stdio.h>
#include <string.h>
#pragma warning(disable : 4996)
int N, M, K, P, L[100];
bool ok[100][100];
int main() {
while (true) {
scanf("%d", &N);
if (N == 0)
break;
memset(ok, false, sizeof(ok));
for (int i = 0; i < N; i++) {
scanf("%d", &M);
for (int j = 0; j < M... | #include <stdio.h>
#include <string.h>
#pragma warning(disable : 4996)
int N, M, K, P, L[100];
bool ok[100][100];
int main() {
while (true) {
scanf("%d", &N);
if (N == 0)
break;
memset(ok, false, sizeof(ok));
for (int i = 0; i < N; i++) {
scanf("%d", &M);
for (int j = 0; j < M... | [["-", 0, 1, 0, 2, 3, 4, 0, 11, 17, 32], ["+", 0, 2, 3, 4, 0, 41, 15, 16, 17, 60]] | 1 | 276 | 2 |
#include <iostream>
#include <map>
#include <vector>
using namespace std;
vector<map<int, int>> known;
vector<int> leak;
int main() {
int n;
while (cin >> n, n) {
// M
for (int i = 0; i < n; i++) {
known.push_back(map<int, int>());
int nknow;
cin >> nknow;
for (int j = 0; j < nkno... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
vector<map<int, int>> known;
vector<int> leak;
int main() {
int n;
while (cin >> n, n) {
// M
for (int i = 0; i < n; i++) {
known.push_back(map<int, int>());
int nknow;
cin >> nknow;
for (int j = 0; j < nkno... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 8, 9, 0, 57, 64, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 12, 13]] | 1 | 316 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vector<set<int>> people(n);
for (int i = 0; i < n; i++) {
int m;
cin >> m;
for (int j = 0; j < m; j++) {
int input;
cin >> input;
people[... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vector<set<int>> people(n);
for (int i = 0; i < n; i++) {
int m;
cin >> m;
for (int j = 0; j < m; j++) {
int input;
cin >> input;
people[... | [["-", 8, 9, 0, 57, 64, 1, 0, 16, 17, 33], ["-", 8, 9, 0, 57, 64, 1, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 17, 32], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 12, 13]] | 1 | 301 | 4 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#... | [["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 330 | 2 |
#include <algorithm>
#include <cstdio>
#include <set>
#include <vector>
using namespace std;
int main() {
int x, n, m, k, i, r;
for (; scanf("%d", &n), n; printf("%d\n", r)) {
vector<set<int>> v;
for (i = 0; i < n; i++) {
set<int> s;
for (scanf("%d", &m), k = 0; k < m; k++)
scanf("%d", &... | #include <algorithm>
#include <cstdio>
#include <set>
#include <vector>
using namespace std;
int main() {
int x, n, m, k, i, r;
for (; scanf("%d", &n), n; printf("%d\n", r)) {
vector<set<int>> v;
for (i = 0; i < n; i++) {
set<int> s;
for (scanf("%d", &m), k = 0; k < m; k++)
scanf("%d", &... | [["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 283 | 2 |
while True:
N = int(input())
if N == 0:break
flgs = [0 for i in range(N)]
for i in range(N):
src = map(int,input().split())
for k in src[1:]:
flgs[i] |= (1 << k)
target = 0
src = map(int,input().split())
for k in src[1:]:
target |= (1 << k)
ans = -1
... | while True:
N = int(input())
if N == 0:break
flgs = [0 for i in range(N)]
for i in range(N):
src = list(map(int,input().split()))
for k in src[1:]:
flgs[i] |= (1 << k)
target = 0
src = list(map(int,input().split()))
for k in src[1:]:
target |= (1 << k)
... | [["+", 8, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 151 | 6 |
//
// main.c
// You Are the Judge
//
// Created by x15071xx on 2016/06/15.
// Copyright ?? 2016??´ AIT. All rights reserved.
//
#include <stdio.h>
#include <string.h>
void swap(int array[50][4], int j, int soezi) {
int tmp;
tmp = array[j][soezi];
array[j][soezi] = array[j - 1][soezi];
array[j - 1][soezi]... | //
// main.c
// You Are the Judge
//
// Created by x15071xx on 2016/06/15.
// Copyright ?? 2016??´ AIT. All rights reserved.
//
#include <stdio.h>
#include <string.h>
void swap(int array[50][4], int j, int soezi) {
int tmp;
tmp = array[j][soezi];
array[j][soezi] = array[j - 1][soezi];
array[j - 1][soezi]... | [["-", 15, 23, 0, 16, 12, 23, 0, 16, 17, 18], ["+", 15, 23, 0, 16, 12, 23, 0, 16, 17, 60]] | 0 | 702 | 2 |
#include <bits/stdc++.h>
#define f first
#define sf second.first
#define ss second.second
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> iP;
int main() {
int t, p, r;
while (cin >> t >> p >> r && t) {
iP a[51];
int k[11][51] = {};
for (int i = 1; i <= t; i++)
a[i] = iP(0, P(0... | #include <bits/stdc++.h>
#define f first
#define sf second.first
#define ss second.second
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> iP;
int main() {
int t, p, r;
while (cin >> t >> p >> r && t) {
iP a[51];
int k[11][51] = {};
for (int i = 1; i <= t; i++)
a[i] = iP(0, P(0... | [["+", 3, 4, 0, 2, 3, 4, 0, 91, 17, 33], ["+", 31, 16, 31, 16, 31, 16, 12, 91, 17, 33]] | 1 | 254 | 2 |
#include <bits/stdc++.h>
using namespace std;
struct team {
int id, c, p;
vector<int> w;
team(int i, int correct, int pena, int num_pro) {
id = i;
c = correct;
p = pena;
w = vector<int>(num_pro + 1, 0);
}
bool operator<(const team &tgt) const {
if (c != tgt.c)
return c < tgt.c;
... | #include <bits/stdc++.h>
using namespace std;
struct team {
int id, c, p;
vector<int> w;
team(int i, int correct, int pena, int num_pro) {
id = i;
c = correct;
p = pena;
w = vector<int>(num_pro + 1, 0);
}
bool operator<(const team &tgt) const {
if (c != tgt.c)
return c < tgt.c;
... | [["-", 8, 9, 0, 57, 64, 37, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 64, 37, 0, 16, 17, 47], ["-", 0, 14, 8, 9, 0, 37, 0, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 17, 47]] | 1 | 367 | 4 |
#include <algorithm>
#include <cctype>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#def... | #include <algorithm>
#include <cctype>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#def... | [["-", 0, 37, 0, 41, 75, 41, 64, 16, 17, 47], ["+", 0, 37, 0, 41, 75, 41, 64, 16, 17, 18]] | 1 | 388 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.