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 <functional>
#include <iostream>
#include <vector>
#pragma warning(disable : 4996)
using namespace std;
int N, K, A, B, dp[11][2001];
vector<int> R[10];
int main() {
scanf("%d", &N);
scanf("%d", &K);
for (int i = 0; i < N; i++) {
scanf("%d", &A);
scanf("%d", &B);
R... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
#pragma warning(disable : 4996)
using namespace std;
int N, K, A, B, dp[11][2001];
vector<int> R[10];
int main() {
scanf("%d", &N);
scanf("%d", &K);
for (int i = 0; i < N; i++) {
scanf("%d", &A);
scanf("%d", &B);
R... | [["+", 63, 118, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 63, 118, 28, 69, 341, 342, 0, 16, 12, 13], ["+", 12, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 354 | 4 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
using namespace std;
int main(void) {
int n, k, i, j, T;
int c[2001], g[2001], sum;
int jan[11][2001], cnt[11], x, kk, temp;
int janaf[11][2001], dp[11][2001];
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++)
scanf("%d %d", &... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
using namespace std;
int main(void) {
int n, k, i, j, T;
int c[2001], g[2001], sum;
int jan[11][2001], cnt[11], x, kk, temp;
int janaf[11][2001], dp[11][2001];
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++)
scanf("%d %d", &... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 620 | 10 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
long long int lis[11][2003], lissize[10] = {0};
for (int i = 0; i < 10; i++) {
for (int j = 1; j < 2003; j++)
lis[i][j] = -2000000000;
}
for (int i = 0; i < N; i++... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
long long int lis[11][2003], lissize[11] = {0};
for (int i = 0; i < 11; i++) {
for (int j = 1; j < 2003; j++)
lis[i][j] = -2000000000;
}
for (int i = 0; i < N; i++... | [["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 43, 49, 50, 49, 80, 49, 80, 81, 13], ["+", 0, 43, 49, 50, 49, 80, 49, 80, 81, 13], ["+", 12, 69, 28, 69, 341, 342, 0, 16, 17, 72], ["+", 1... | 1 | 373 | 8 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22]] | 1 | 718 | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
int g_idx[10] = {0};
int books[10][2000] = {{0}};
int table[10][2001] = {{0}};
int dp[10][2001];
int solve(int idx, int cnt) {
if (idx == 10)
return 0;
if (dp[idx][cnt] != -1)
return dp[idx][cnt];
int ret = 0;
for (int i = 0; i <= g_idx[idx];... | #include <bits/stdc++.h>
using namespace std;
int n, k;
int g_idx[10] = {0};
int books[10][2000] = {{0}};
int table[10][2001] = {{0}};
int dp[10][2001];
int solve(int idx, int cnt) {
if (idx == 10)
return 0;
if (dp[idx][cnt] != -1)
return dp[idx][cnt];
int ret = 0;
for (int i = 0; i <= g_idx[idx];... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 2, 3, 4, 0, 16, 12, 69, 28, 22], ["+", 3, 4, 0, 16, 12, 69, 341, 342, 0, 70], ["+", 3, 4, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 16, 12, 69, 341, 342, 0, 73]] | 1 | 384 | 5 |
#include <iostream>
using namespace std;
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional> //sort(A,A.end(),greater<int>());???????????????
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define INF 10 << 10
int dp[2048] = {0};
int main() {
int... | #include <iostream>
using namespace std;
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional> //sort(A,A.end(),greater<int>());???????????????
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define INF 10 << 10
int dp[2048] = {0};
int main() {
int... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 20]] | 1 | 380 | 10 |
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 9000000000000000000
#define INF 2000000000
#define REP(i, n) for (int i = 0; i < (n)... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 9000000000000000000
#define INF 2000000000
#define REP(i, n) for (int i = 0; i < (n)... | [["-", 0, 2, 63, 118, 28, 69, 341, 342, 0, 22], ["+", 0, 2, 63, 118, 28, 69, 341, 342, 0, 13]] | 1 | 638 | 2 |
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 1
#define dump(o) \
if (DBG) { \
cerr << #o << " " << o << endl; ... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 1
#define dump(o) \
if (DBG) { \
cerr << #o << " " << o << endl; ... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 583 | 2 |
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 2005;
vector<int> a[10];
vector<int> b[10];
int dp[10][MAX_N];
int n, K;
int main() {
int x, y;
scanf("%d%d"... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 2005;
vector<int> a[11];
vector<int> b[11];
int dp[11][MAX_N];
int n, K;
int main() {
int x, y;
scanf("%d%d"... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13]] | 1 | 381 | 6 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int c, g, dp[2001];
vector<int> bks[11];
for (int i = 0; i < n; ++i) {
cin >> c >> g;
bks[g].push_back(c);
}
for (int i = 0; i < 10; ++i) {
sort(bks[i].beg... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int c, g, dp[2001];
vector<int> bks[11];
for (int i = 0; i < n; ++i) {
cin >> c >> g;
bks[g - 1].push_back(c);
}
for (int i = 0; i < 10; ++i) {
sort(bks[i]... | [["+", 63, 118, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 63, 118, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 293 | 2 |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <vector>
using namespace std;
int n, k;
int dp[11][2001];
int main() {
vector<int> vcc[11];
vector<int> vc[11];
scanf("%d %d", &n, &k);
int a, b;
for (int i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
vcc[b].push_back(a);
}
fo... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <vector>
using namespace std;
int n, k;
int dp[11][2001];
int main() {
vector<int> vcc[11];
vector<int> vc[11];
scanf("%d %d", &n, &k);
int a, b;
for (int i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
vcc[b].push_back(a);
}
fo... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 3, 4, 0, 69, 28, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 69, 28, 69, 341, 342, 0, 13]] | 1 | 433 | 4 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <vector>
using namespace std;
#define INF (1 << 30)
long long int dp[11][2012], ans;
vector<long long int> books[11];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
int c, g;
scanf("%d%d... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <vector>
using namespace std;
#define INF (1 << 30)
int dp[11][2012], ans;
vector<int> books[11];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
int c, g;
scanf("%d%d", &c, &g);
book... | [["-", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["-", 39, 344, 3, 347, 0, 77, 39, 86, 0, 96], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 18], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 19], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 439 | 8 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> p;
typedef pair<int, p> P;
typedef pair<p, p> p2;
#define pu push
#def... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> p;
typedef pair<int, p> P;
typedef pair<p, p> p2;
#define pu push
#def... | [["-", 63, 118, 28, 69, 341, 342, 0, 27, 17, 68], ["+", 63, 118, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 63, 118, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 456 | 3 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
using namespace std;
typedef vector<int> VI;
int n, k;
VI topic[10];
int DP[10][2001];
int main() {
int i, t, u, qsize[10] = {0};
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> t >> u;
u--;
topic[u].push_back(t);
qsiz... | //問題文をしっかり読む！。最後と空っぽに注意！メモリをしっかり確保すること。
#include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
using namespace std;
typedef vector<int> VI;
int n, k;
VI topic[11];
int DP[11][2001];
int main() {
int i, t, u, qsize[10] = {0};
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> t >> u;
... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 413 | 10 |
### constant
MAXGE = 10
### main
n, k = gets.strip.split(' ').map{|s| s.to_i}
books = MAXGE.times.map{[]}
nge = 0
n.times do
ci, gi = gets.strip.split(' ').map{|s| s.to_i}
books[gi - 1] << ci
nge = gi if nge < gi
end
for g in (1...nge)
books[g].sort!{|a, b| b <=> a}
end
#p nge
#p books
costs = [0]
for g... | ### constant
MAXGE = 10
### main
n, k = gets.strip.split(' ').map{|s| s.to_i}
books = MAXGE.times.map{[]}
nge = 0
n.times do
ci, gi = gets.strip.split(' ').map{|s| s.to_i}
books[gi - 1] << ci
nge = gi if nge < gi
end
for g in (0...nge)
books[g].sort!{|a, b| b <=> a}
end
#p nge
#p books
costs = [0]
for g... | [["-", 0, 88, 51, 267, 0, 739, 0, 475, 756, 612], ["+", 0, 88, 51, 267, 0, 739, 0, 475, 756, 612]] | 4 | 237 | 2 |
def knapsack(items, budget)
table = (0..1).map{ Array.new(budget+1, 0) }
for i in 0..items.size-1
c, v = items[i]
for j in 0..budget
x = table[0][j]
y = (j >= c ? table[0][j-c] + v : 0)
table[1][j] = x > y ? x : y
end
table << table.shift
end
table[0].max
end
n, k = gets.split.map(&:to_i)
hash = ... | def knapsack(items, budget)
table = (0..1).map{ Array.new(budget+1, 0) }
for i in 0..items.size-1
c, v = items[i]
for j in 0..budget
x = table[0][j]
y = (j >= c ? table[0][j-c] + v : 0)
table[1][j] = x > y ? x : y
end
table << table.shift
end
table[0].max
end
n, k = gets.split.map(&:to_i)
hash = ... | [["-", 0, 493, 0, 88, 8, 170, 0, 652, 735, 22], ["-", 8, 170, 0, 652, 3, 4, 0, 742, 0, 70], ["-", 8, 170, 0, 652, 3, 4, 0, 742, 0, 612], ["-", 8, 170, 0, 652, 3, 4, 0, 742, 0, 73], ["-", 0, 493, 0, 88, 8, 170, 0, 738, 31, 22]] | 4 | 330 | 5 |
n,k=list(map(int,input().split()))
g=[[] for _ in range(10)]
for i in range(n):
v,j=list(map(int,input().split()))
g[j-1].append(v)
for i in range(10):
g[i].sort()
g[i].reverse()
books=[[0]*(k+1) for _ in range(10)]
for i in range(10):
for j in range(1,len(g[i])+1):
books[i][j]=books[i][j-1... | n,k=list(map(int,input().split()))
g=[[] for _ in range(10)]
for i in range(n):
v,j=list(map(int,input().split()))
g[j-1].append(v)
for i in range(10):
g[i].sort()
g[i].reverse()
books=[[0]*2005 for _ in range(10)]
for i in range(10):
for j in range(1,len(g[i])+1):
books[i][j]=books[i][j-1]... | [["-", 0, 662, 12, 658, 8, 657, 12, 23, 0, 24], ["-", 12, 658, 8, 657, 12, 23, 0, 657, 31, 22], ["-", 12, 658, 8, 657, 12, 23, 0, 657, 17, 72], ["-", 12, 658, 8, 657, 12, 23, 0, 657, 12, 612], ["-", 0, 662, 12, 658, 8, 657, 12, 23, 0, 25], ["+", 0, 1, 0, 662, 12, 658, 8, 657, 12, 612]] | 5 | 277 | 6 |
[N,K]=list(map(int, input().split()))
C=[[] for i in range(11)]
D=[[0 for j in range(K+1)] for i in range(11)]
M=[0 for i in range(11)]
for i in range(N):
c,g=list(map(int, input().split()))
C[g].append(c)
M[g]+=1
for i in range(1,11):
y=sorted(C[i], reverse=True)
for j in range(len(y)):
n ... | [N,K]=list(map(int, input().split()))
C=[[] for i in range(11)]
D=[[0 for j in range(N+1)] for i in range(11)]
M=[0 for i in range(11)]
for i in range(N):
c,g=list(map(int, input().split()))
C[g].append(c)
M[g]+=1
for i in range(1,11):
y=sorted(C[i], reverse=True)
for j in range(len(y)):
n ... | [["-", 0, 659, 12, 652, 3, 4, 0, 657, 31, 22], ["+", 0, 659, 12, 652, 3, 4, 0, 657, 31, 22]] | 5 | 288 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
#define INF (1e9)
#define LLINF (1e18)
#define long long
#define MAX_V 3000
using namespace std;
typedef struct edge {
public:
int to;
double cost;
edge() {}
edge(int _to, double _cost) {
to = ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
#define INF (1e9)
#define LLINF (1e18)
#define long long
#define MAX_V 3000
using namespace std;
typedef struct edge {
public:
int to;
double cost;
edge() {}
edge(int _to, double _cost) {
to = ... | [["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 3, 4, 0, 74, 51, 23, 0, 16, 17, 72], ["+", 3, 4, 0, 74, 51, 23, 0, 16, 12, 13]] | 1 | 612 | 4 |
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#define INF 500000000
using namespace std;
typedef pair<int, int> P;
int n, m, k;
int l[100100], a[100100], b[100100];
vector<P> g[5000];
int d[5000], w[5000];
int s[5000];
int main() {
cin >> n >> m >> k;
for (int i = 0; i < ... | #include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#define INF 500000000
using namespace std;
typedef pair<int, int> P;
int n, m, k;
int l[100100], a[100100], b[100100];
vector<P> g[5000];
int d[5000], w[5000];
int s[5000];
int main() {
cin >> n >> m >> k;
for (int i = 0; i < ... | [["+", 3, 4, 0, 2, 3, 4, 0, 69, 28, 22], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 70], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 73]] | 1 | 539 | 3 |
#include <bits/stdc++.h>
using namespace std;
#define INF 100000000
typedef long long LL;
typedef pair<int, int> P;
struct edge {
int to, cost;
};
vector<edge> G[3390];
int dis[3390];
void dijkstra(int s) {
priority_queue<P, vector<P>, greater<P>> Q;
fill(dis, dis + 3389, INF);
dis[s] = 0;
Q.push(P(0, s));
... | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
typedef long long LL;
typedef pair<int, int> P;
struct edge {
int to, cost;
};
vector<edge> G[3390];
int dis[3390];
void dijkstra(int s) {
priority_queue<P, vector<P>, greater<P>> Q;
fill(dis, dis + 3389, INF);
dis[s] = 0;
Q.push(P(0, s));
... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 27, 17, 29], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["-", 0, 1, 0, 11, 12, 16, 12, 16, 31, 13], ["-", 0, 1, 0, 11, 12, 16, 12, 16, 17, 85], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 90]] | 1 | 505 | 7 |
#include <bits/stdc++.h>
#define N 3002
using namespace std;
typedef pair<int, int> P;
vector<P> G[N];
bool num[N];
int n, m, K;
double dijkstra() {
vector<int> D(N, 1e9);
priority_queue<P, vector<P>, greater<P>> Q;
for (int i = 0; i < n; i++)
if (num[i])
Q.push(P(0, i)), D[i] = 0;
while (!Q.empty()... | #include <bits/stdc++.h>
#define N 3002
using namespace std;
typedef pair<int, int> P;
vector<P> G[N];
bool num[N];
int n, m, K;
double dijkstra() {
vector<int> D(N, 1e9);
priority_queue<P, vector<P>, greater<P>> Q;
for (int i = 0; i < n; i++)
if (num[i])
Q.push(P(0, i)), D[i] = 0;
while (!Q.empty()... | [["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 22], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 22]] | 1 | 475 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define M 100000007
typedef pair<int, int> P;
/*int main(){
cout<<8979879<<endl;
}*/
int ri[3001][3001];
int main(void) {
int n, m, k, i, j, mx, t, ans, a[100001], b[100001], l[100001], s[3000],
d[3001];
priority_queue<P, vector<P>, greater<P>> que;
ci... | #include <bits/stdc++.h>
using namespace std;
#define M 100000007
typedef pair<int, int> P;
/*int main(){
cout<<8979879<<endl;
}*/
int ri[3001][3001];
int main(void) {
int n, m, k, i, j, mx, t, ans, a[100001], b[100001], l[100001], s[3000],
d[3001];
priority_queue<P, vector<P>, greater<P>> que;
ci... | [["+", 0, 11, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 12, 2, 3, 4, 0, 16, 12, 69, 28, 22], ["+", 3, 4, 0, 16, 12, 69, 341, 342, 0, 70], ["+", 3, 4, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 16, 12, 69, 341, 342, 0, 73]] | 1 | 531 | 5 |
// 27
#include <algorithm>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
int t[3001];
fill(t, t + 3001, 1 << 29);
int a[10000][2], l[10000];
for (int i = 0; i < m; i++) {
cin >> a[i][0] >> a[i][1] >> l[i];
}
for (int i = 0; i < k; i++) {
... | // 27
#include <algorithm>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
int t[3001];
fill(t, t + 3001, 1 << 29);
int a[100000][2], l[100000];
for (int i = 0; i < m; i++) {
cin >> a[i][0] >> a[i][1] >> l[i];
}
for (int i = 0; i < k; i++) ... | [["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 31, 16, 31, 23, 0, 16, 31, 16, 31, 22], ["+", 31, 23, 0, 16, 31, 16, 31, 69, 28, 22], ["+", 0, 16, 31, 16, 31, 69, 341, 342, 0, 70], ["+", ... | 1 | 319 | 9 |
#include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
const int MAXN = 1000 + 20;
int dp[MAXN][MAXN];
int maze[MAXN][MAXN];
int h, w, n, sx[10], sy[10], temp;
void input() {
memset(maze, -1, sizeof(maze));
cin >> h >> w >> n;
cin.get();
for (int i = 1; i <... | #include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
const int MAXN = 1000 + 20;
int dp[MAXN][MAXN];
int maze[MAXN][MAXN];
int h, w, n, sx[10], sy[10], temp;
void input() {
memset(maze, -1, sizeof(maze));
cin >> h >> w >> n;
cin.get();
for (int i = 1; i <... | [["+", 0, 16, 31, 16, 12, 16, 31, 16, 12, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33]] | 1 | 602 | 2 |
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string.h>
using namespace std;
int map[1002][1002], was[1002][1002];
int main(void) {
int count = 0, H, W, N, i, j;
char c = 0;
pair<int, int> q, a[10];
queue<pair<int, int>> que;
queue<int> quec;
quec.push(0);
scanf("%d %d %d", &H, &W, &N)... | #include <iostream>
#include <queue>
#include <stdio.h>
#include <string.h>
using namespace std;
int map[1002][1002], was[1002][1002];
int main(void) {
int count = 0, H, W, N, i, j;
char c = 0;
pair<int, int> q, a[10];
queue<pair<int, int>> que;
queue<int> quec;
quec.push(0);
scanf("%d %d %d", &H, &W, &N)... | [["-", 0, 57, 64, 9, 0, 1, 0, 27, 17, 68], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 17, 29], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 1,022 | 4 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define P(p) cout << (p) << endl
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rrep(i, m, n) for (in... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define P(p) cout << (p) << endl
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rrep(i, m, n) for (in... | [["-", 8, 9, 0, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 9, 0, 1, 0, 11, 12, 13]] | 1 | 928 | 2 |
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
int h, w, n;
const int MAX_N = 1005;
char map[MAX_N][MAX_N];
int visit[MAX_N][MAX_N];
struct point {
int x, y;
int step;
point() {
x = 0;
y = 0;
step = 0;
}
point(int xx, int yy, int ss) {
x = xx;
y = yy;
step... | #include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
int h, w, n;
const int MAX_N = 1005;
char map[MAX_N][MAX_N];
int visit[MAX_N][MAX_N];
struct point {
int x, y;
int step;
point() {
x = 0;
y = 0;
step = 0;
}
point(int xx, int yy, int ss) {
x = xx;
y = yy;
step... | [["-", 15, 339, 51, 16, 31, 23, 0, 16, 17, 60], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 17, 79], ["-", 51, 16, 31, 23, 0, 16, 12, 103, 0, 125], ["+", 51, 16, 31, 23, 0, 16, 12, 103, 0, 125]] | 1 | 662 | 4 |
#define LOCAL
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#define SIZE 1010
using namespace std;
char map[SIZE][SIZE];
int dir[][2] = {0, 1, 0, -1, 1, 0, -1, 0};
int bfs(int &x, int &y, int h, int w, int target) {
int step[SIZE][SIZE];
for (int i = 0; i < h; i++)
fill(step[i]... | //#define LOCAL
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#define SIZE 1010
using namespace std;
char map[SIZE][SIZE];
int dir[][2] = {0, 1, 0, -1, 1, 0, -1, 0};
int bfs(int &x, int &y, int h, int w, int target) {
int step[SIZE][SIZE];
for (int i = 0; i < h; i++)
fill(step[... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148], ["-", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22]] | 1 | 521 | 2 |
#include <cstdlib>
#include <iostream>
#include <queue>
#define INF 1000000
using namespace std;
typedef pair<int, int> P;
int H, W, N;
char field[1000][1000];
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int d[1000][1000];
int ans = 0;
void bfs(int sx, int sy, int n) {
int x, y;
queue<P> que;
for (int i = ... | #include <cstdlib>
#include <iostream>
#include <queue>
#define INF 1000000
using namespace std;
typedef pair<int, int> P;
int H, W, N;
char field[1000][1000];
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int d[1000][1000];
int ans = 0;
void bfs(int sx, int sy, int n) {
int x, y;
queue<P> que;
for (int i = ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 526 | 4 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
using namespace std;
#define INF 100000
char map[1001][1001];
int h, w, n;
int d1[4] = {0, 1, 0, -1};
int d2[4] = {1, 0, -1, 0};
int i, j, x[10], y[... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
using namespace std;
#define INF 100000
char map[1001][1001];
int h, w, n;
int d1[4] = {0, 1, 0, -1};
int d2[4] = {1, 0, -1, 0};
int i, j, x[10], y[... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 593 | 4 |
#include <algorithm>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
int search(int sx, int sy, int dx, int dy, vector<vector<char>> &f, int w,
int h) {
vector<bool> visit;
queue<pair<pair<int, int>, int>> q;
visit.resize(w * h, false);
q.push(make_pair(make_pair(sx, sy), 0... | #include <algorithm>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
int search(int sx, int sy, int dx, int dy, vector<vector<char>> &f, int w,
int h) {
vector<bool> visit;
queue<pair<pair<int, int>, int>> q;
visit.resize(w * h, false);
q.push(make_pair(make_pair(sx, sy), 0... | [["-", 15, 339, 51, 16, 31, 16, 12, 16, 12, 22], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 12, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22]] | 1 | 618 | 4 |
#include <memory.h>
#include <stdbool.h>
#include <stdio.h>
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, -1, 0, 1};
int c[1000][1000];
int dat[1000][1000];
int cost[1000][1000];
int destination = 1;
int startposx, startposy;
int h, w, n;
struct QUEUE {
int x, y;
};
QUEUE queue[256];
int qbegin = 0, qend = 0;
void bf... | #include <memory.h>
#include <stdbool.h>
#include <stdio.h>
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, -1, 0, 1};
int c[1000][1000];
int dat[1000][1000];
int cost[1000][1000];
int destination = 1;
int startposx, startposy;
int h, w, n;
struct QUEUE {
int x, y;
};
QUEUE queue[1000000];
int qbegin = 0, qend = 0;
voi... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22]] | 1 | 642 | 6 |
p = min(eval(input()), input, eval(input()))
j = min(eval(input()), eval(input()))
print((p + j) - 50) | p = min(eval(input()), eval(input()), eval(input()))
j = min(eval(input()), eval(input()))
print((p + j) - 50) | [["+", 0, 662, 12, 652, 3, 4, 0, 652, 63, 22], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 48 | 5 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
/**
* Soccer
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedR... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
/**
* Soccer
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedR... | [["-", 0, 57, 64, 196, 0, 1, 0, 27, 0, 29], ["+", 0, 57, 64, 196, 0, 1, 0, 11, 17, 32], ["+", 64, 196, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 64, 196, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 64, 196, 0, 1, 0, 11, 12, 16, 12, 499]] | 3 | 555 | 5 |
#include <stdio.h>
int main(void) {
int game, n, i, j, team[100];
int a, b, c, d, ban[100];
scanf("%d", &n);
for (i = 0; i < n; i++) {
team[i] = 0;
ban[i] = 1;
}
game = n * (n - 1) / 2;
for (i = 0; i < game; i++) {
scanf("%d %d %d %d", &a, &b, &c, &d);
if (c > d) {
team[a - 1] += 3;
... | #include <stdio.h>
int main(void) {
int game, n, i, j, team[100];
int a, b, c, d, ban[100];
scanf("%d", &n);
for (i = 0; i < n; i++) {
team[i] = 0;
ban[i] = 1;
}
game = n * (n - 1) / 2;
for (i = 0; i < game; i++) {
scanf("%d %d %d %d", &a, &b, &c, &d);
if (c > d) {
team[a - 1] += 3;
... | [["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 244 | 2 |
#include <stdio.h>
int main(void) {
int n, i, j, no[2], point[2], z, team[100] = {0};
scanf("%d", &n);
if (n) {
int prank[n];
for (i = 0; i < n * (n - 1) / 2; i++) {
scanf("%d %d", &no[0], &no[1]);
scanf("%d %d", &point[0], &point[1]);
if (point[0] > point[1])
team[no[0] - 1] ... | #include <stdio.h>
int main(void) {
int n, i, j, no[2], point[2], z, team[100] = {0};
scanf("%d", &n);
if (n) {
int prank[n];
for (i = 0; i < n * (n - 1) / 2; i++) {
scanf("%d %d", &no[0], &no[1]);
scanf("%d %d", &point[0], &point[1]);
if (point[0] > point[1])
team[no[0] - 1] ... | [["-", 8, 9, 0, 57, 64, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 12, 13], ["-", 75, 76, 0, 57, 64, 1, 0, 11, 12, 13], ["+", 75, 76, 0, 57, 64, 1, 0, 11, 12, 13]] | 0 | 353 | 4 |
#include <stdio.h>
int main(void) {
int n, i, j, team[100], score[100], a, b, c, d;
scanf("%d", &n);
for (i = 0; i < n; i++) {
team[i] = 0;
}
for (i = 0; i < n * (n - 1) / 2; i++) {
scanf("%d%d%d%d", &a, &b, &c, &d);
if (c > d) {
team[a - 1] += 3;
} else if (c < d) {
team[b - 1] +=... | #include <stdio.h>
int main(void) {
int n, i, j, team[100], score[100], a, b, c, d;
scanf("%d", &n);
for (i = 0; i < n; i++) {
team[i] = 0;
}
for (i = 0; i < n * (n - 1) / 2; i++) {
scanf("%d%d%d%d", &a, &b, &c, &d);
if (c > d) {
team[a - 1] += 3;
} else if (c < d) {
team[b - 1] +... | [["-", 64, 9, 0, 1, 0, 27, 28, 69, 71, 22], ["+", 64, 9, 0, 1, 0, 27, 28, 69, 71, 22]] | 0 | 250 | 2 |
#include <iostream>
using namespace std;
int main() {
int N, n[110], cnt = 1, A, B, C, D;
cin >> N;
for (int i = 0; i < N * (N - 1) / 2; i++) {
cin >> A >> B >> C >> D;
if (C == D) {
n[A] += 1;
n[B] += 1;
}
if (C > D) {
n[A] += 3;
}
if (D > C) {
n[B] += 3;
}
}... | #include <iostream>
using namespace std;
int main() {
int N, n[110] = {}, cnt = 1, A, B, C, D;
cin >> N;
for (int i = 0; i < N * (N - 1) / 2; i++) {
cin >> A >> B >> C >> D;
if (C == D) {
n[A] += 1;
n[B] += 1;
}
if (C > D) {
n[A] += 3;
}
if (D > C) {
n[B] += 3;
... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46]] | 1 | 188 | 3 |
#include <iostream>
using namespace std;
int main() {
int N;
int A, B, C, D;
int sc[101] = {0};
int rank[101];
int n;
int max, mi;
int c;
cin >> N;
for (int i = 0; i < N * (N - 1) / 2; i++) {
cin >> A >> B >> C >> D;
if (C > D)
sc[A] += 3;
if (C == D)
sc[A]++, sc[B]++;
... | #include <iostream>
using namespace std;
int main() {
int N;
int A, B, C, D;
int sc[101] = {0};
int rank[101];
int n;
int max, mi;
int c;
cin >> N;
for (int i = 0; i < N * (N - 1) / 2; i++) {
cin >> A >> B >> C >> D;
if (C > D)
sc[A] += 3;
if (C == D)
sc[A]++, sc[B]++;
... | [["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 271 | 2 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
//#include <windows.h>
#include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
using namespace std;
typedef unsigned int uint;
typedef long long int llint;
typedef ... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
//#include <windows.h>
#include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
using namespace std;
typedef unsigned int uint;
typedef long long int llint;
typedef ... | [["-", 0, 57, 64, 9, 0, 1, 0, 16, 17, 33], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32]] | 1 | 2,017 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s[100], cop[100], rank[100];
cin >> n;
for (int i = 0; i < n * (n - 1) / 2; i++) {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (c == d) {
s[a - 1]++;
s[b - 1]++;
} else {
(c > d ? s[a - 1] : s[b - 1]) += 3;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, s[101], cop[101], rank[10101];
cin >> n;
for (int i = 0; i < n * (n - 1) / 2; i++) {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (c == d) {
s[a - 1]++;
s[b - 1]++;
} else {
(c > d ? s[a - 1] : s[b - 1]) += 3;
... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 226 | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
int score[101];
int pnt[101];
fill_n(pnt, 101, 0);
vector<pair<int, int>> v;
cin >> n;
for (int i = 0; i < n * (n - 1) / 2; i++) {
cin >> a >> b >> c >> d;
if (c < d)
pnt[b]++;
else if (c > d)
pnt[a]++;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
int score[101];
int pnt[101];
fill_n(pnt, 101, 0);
vector<pair<int, int>> v;
cin >> n;
for (int i = 0; i < n * (n - 1) / 2; i++) {
cin >> a >> b >> c >> d;
if (c < d)
pnt[b] += 3;
else if (c > d)
pnt[a]... | [["-", 8, 9, 0, 57, 64, 1, 0, 27, 17, 29], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 17, 107], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 12, 13], ["-", 75, 76, 0, 57, 64, 1, 0, 27, 17, 29], ["+", 75, 76, 0, 57, 64, 1, 0, 11, 17, 107], ["+", 75, 76, 0, 57, 64, 1, 0, 11, 12, 13]] | 1 | 304 | 6 |
#include <stdio.h>
int n, team[100];
int main() {
scanf("%d", &n);
for (int i = 0; i < n * (n - 1) / 2; i++) {
int a, b, c, d;
scanf("%d%d%d%d", &a, &b, &c, &d);
if (c == d) {
team[a]++;
team[b]++;
}
if (c > d) {
team[a] += 3;
}
if (c < d) {
team[b] += 3;
}
... | #include <stdio.h>
int n, team[100];
int main() {
scanf("%d", &n);
for (int i = 0; i < n * (n - 1) / 2; i++) {
int a, b, c, d;
scanf("%d%d%d%d", &a, &b, &c, &d);
if (c == d) {
team[a]++;
team[b]++;
}
if (c > d) {
team[a] += 3;
}
if (c < d) {
team[b] += 3;
}
... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 193 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int toppingN = sc.nextInt();
int valBase = sc.nextInt();
int valTopping = sc.nextInt();
int calBase = sc.nextInt();
int[] calTopping = new int[toppingN];
for (int ... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int toppingN = sc.nextInt();
int valBase = sc.nextInt();
int valTopping = sc.nextInt();
int calBase = sc.nextInt();
int[] calTopping = new int[toppingN];
for (int i... | [["-", 0, 492, 3, 4, 0, 16, 31, 74, 0, 24], ["-", 3, 4, 0, 16, 31, 74, 39, 511, 0, 512], ["-", 0, 492, 3, 4, 0, 16, 31, 74, 0, 25]] | 3 | 210 | 3 |
#include <stdio.h>
#include <stdlib.h>
int cmp(const void *a, const void *b) { return (int *)b - (int *)a; }
int main() {
int n, a, b, c, d[10000], i, cost, calorie;
scanf("%d%d%d%d", &n, &a, &b, &c);
for (i = 0; i < n; i++) {
scanf("%d", &d[i]);
}
qsort(d, n, sizeof(int), cmp);
cost = a;
calorie = c;... | #include <stdio.h>
#include <stdlib.h>
int cmp(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main() {
int n, a, b, c, d[10000], i, cost, calorie;
scanf("%d%d%d%d", &n, &a, &b, &c);
for (i = 0; i < n; i++) {
scanf("%d", &d[i]);
}
qsort(d, n, sizeof(int), cmp);
cost = a;
calorie = ... | [["+", 8, 9, 0, 37, 0, 16, 31, 66, 17, 48], ["+", 8, 9, 0, 37, 0, 16, 12, 66, 17, 48]] | 0 | 175 | 2 |
#include <stdio.h>
int main() {
int n, a, b, c, d[100], y, i, p, j, tmp, max, k;
int price, calorie, cur;
scanf("%d %d %d %d", &n, &a, &b, &c);
for (i = 0; i < n; i++) {
scanf("%d", &d[i]);
}
for (i = 0; i < n; i++) {
for (j = 0; j < i; j++) {
if (d[j] < d[i]) {
tmp = d[j];
d... | #include <stdio.h>
int main() {
int n, a, b, c, d[100], y, i, p, j, tmp, max, k;
int price, calorie, cur;
scanf("%d %d %d %d", &n, &a, &b, &c);
for (i = 0; i < n; i++) {
scanf("%d", &d[i]);
}
for (i = 0; i < n; i++) {
for (j = 0; j < i; j++) {
if (d[j] < d[i]) {
tmp = d[j];
d... | [["-", 64, 9, 0, 1, 0, 11, 31, 69, 71, 22], ["+", 64, 9, 0, 1, 0, 11, 31, 69, 71, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 34, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 231 | 6 |
#include <algorithm>
#include <iostream>
#include <map>
#define MAX 300
using namespace std;
int main(void) {
int n;
int a, b;
int pizza;
//今までの最高値を格納
double ans = 0;
int top[MAX];
cin >> n;
cin >> a >> b >> pizza;
for (int i = 0; i < n; i++) {
cin >> top[i];
}
sort(top, top + n, greate... | #include <algorithm>
#include <iostream>
#include <map>
#define MAX 300
using namespace std;
int main(void) {
int n;
int a, b;
int pizza;
//今までの最高値を格納
double ans = 0;
int top[MAX];
cin >> n;
cin >> a >> b >> pizza;
for (int i = 0; i < n; i++) {
cin >> top[i];
}
sort(top, top + n, greate... | [["+", 0, 1, 0, 16, 31, 16, 12, 74, 0, 24], ["+", 0, 16, 31, 16, 12, 74, 39, 77, 39, 40], ["+", 0, 1, 0, 16, 31, 16, 12, 74, 0, 25]] | 1 | 152 | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, a, b, c, x[100], d, p;
main() {
p = 0;
cin >> n;
cin >> a >> b;
cin >> c;
for (int i = 0; i < n; i++) {
cin >> x[i];
}
d = 0;
sort(x, x + n, greater<int>());
p = c / a;
for (int i = 0; i < n; i++) {
c += b;
a += x[i];
p = max(p, c ... | #include <bits/stdc++.h>
using namespace std;
int n, a, b, c, x[100], d, p;
main() {
p = 0;
cin >> n;
cin >> a >> b;
cin >> c;
for (int i = 0; i < n; i++) {
cin >> x[i];
}
d = 0;
sort(x, x + n, greater<int>());
p = c / a;
for (int i = 0; i < n; i++) {
a += b;
c += x[i];
p = max(p, c ... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22]] | 1 | 143 | 19 |
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int n;
int a, b;
int c;
vector<int> d;
int main() {
scanf("%d %d %d %d", &n, &a, &b, &c);
for (int i = 0; i < n; i++) {
int t;
scanf("%d", &t);
d.push_back(t);
}
sort(d.rbegin(), d.rend());
/* printf("%d %d %d %d\n", ... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int n;
int a, b;
int c;
vector<int> d;
int main() {
scanf("%d %d %d %d", &n, &a, &b, &c);
for (int i = 0; i < n; i++) {
int t;
scanf("%d", &t);
d.push_back(t);
}
sort(d.rbegin(), d.rend());
/*
printf("%d %d %... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 189 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int n;
int A, B;
int pieC;
int C[100];
int main() {
cin >> n;
cin >> A >> B;
cin >> pieC;
for (int i = 0; i < n; i++) {
cin >> C[i];
}
// テゥツ卍催ゥツ??10,9,8,...)テ」ツ?ォテ」ツつステ」ツδシテ」ツδ暗」ツ?凖」ツつ?
sort(C, C + n);
reverse(C, C + n);
int calor... | #include <algorithm>
#include <iostream>
using namespace std;
int n;
int A, B;
int pieC;
int C[100];
int main() {
cin >> n;
cin >> A >> B;
cin >> pieC;
for (int i = 0; i < n; i++) {
cin >> C[i];
}
// テゥツ卍催ゥツ??10,9,8,...)テ」ツ?ォテ」ツつステ」ツδシテ」ツδ暗」ツ?凖」ツつ?
sort(C, C + n);
reverse(C, C + n);
int calor... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 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, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 159 | 9 |
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int a, b, money, top;
double cal;
cin >> a >> money >> b >> cal;
vector<int> c(a);
for (int i = 0; i < a; i++) {
cin >> c[i];
}
for (int i = 0; i < a; ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int a, b, money, top;
double cal;
cin >> a >> money >> b >> cal;
vector<int> c(a);
for (int i = 0; i < a; i++) {
cin >> c[i];
}
for (int i = 0; i < a; ... | [["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["-", 51, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["-", 0, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["-", 3, 4, 0, 69, 341, 342, 0, 16, 31,... | 1 | 206 | 8 |
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int cal[10005];
int main() {
int n, a, b, c;
cin >> n >> a >> b >> c;
for (int i = 0; i < n; i++) {
cin >> cal[i];
}
sort(cal, cal + n);
double sumcal = c, sumdol = a;
double cado = sumcal / sumdol;
for (int i = n - 1... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int cal[10005];
int main() {
int n, a, b, c;
cin >> n >> a >> b >> c;
for (int i = 0; i < n; i++) {
cin >> cal[i];
}
sort(cal, cal + n);
double sumcal = c, sumdol = a;
double cado = sumcal / sumdol;
for (int i = n - 1... | [["-", 75, 76, 0, 9, 0, 1, 0, 11, 31, 22], ["-", 75, 76, 0, 9, 0, 1, 0, 11, 17, 32], ["-", 75, 76, 0, 9, 0, 1, 0, 11, 12, 22], ["-", 0, 57, 75, 76, 0, 9, 0, 1, 0, 35]] | 1 | 167 | 4 |
# directions
x_dir = [0, 1, 0, -1]
y_dir = [1, 0, -1, 0]
# map info
visited = []
maps = []
# bfs algorithm
def bfs(h, w, cheese, sx, sy, moves):
que = [(moves, sx, sy)]
for i in range(h):
for j in range(w):
visited[i][j] = (maps[i][j] != 'X')
visited[sy][sx] = False
while len(qu... | # directions
x_dir = [0, 1, 0, -1]
y_dir = [1, 0, -1, 0]
# map info
visited = []
maps = []
# bfs algorithm
def bfs(h, w, cheese, sx, sy, moves):
que = [(moves, sx, sy)]
for i in range(h):
for j in range(w):
visited[i][j] = (maps[i][j] != 'X')
visited[sy][sx] = False
while len(qu... | [["-", 0, 57, 64, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 31, 22], ["-", 0, 662, 12, 652, 3, 4, 0, 206, 51, 22], ["+", 0, 662, 12, 652, 3, 4, 0, 206, 51, 22]] | 5 | 406 | 8 |
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**6)
def calculate_distance(field,locations,current_HP):
is_visit = [[False for _ in range(len(field[0]))] for __ in range(len(field))]
frontier = set()
frontier.add(locations[current_HP-1])
for step in range(10**4):
for cx,cy in frontier:
if (cx,cy)... | # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**6)
def calculate_distance(field,locations,current_HP):
is_visit = [[False for _ in range(len(field[0]))] for __ in range(len(field))]
frontier = set()
frontier.add(locations[current_HP-1])
for step in range(10**6):
for cx,cy in frontier:
if (cx,cy)... | [["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612], ["-", 0, 57, 64, 196, 0, 37, 0, 657, 17, 72], ["-", 0, 57, 64, 196, 0, 37, 0, 657, 12, 612]] | 5 | 440 | 4 |
# -*- coding: utf-8 -*-
def get_shortest_distance(field,locations,current_HP):
is_visit = [[False for _ in range(len(field[0]))] for __ in range(len(field))]
frontier = set()
frontier.add(locations[current_HP-1])
for step in xrange(10**10):
for cx,cy in frontier:
if (cx,cy)==locations[current_HP]: return step... | # -*- coding: utf-8 -*-
def get_shortest_distance(field,locations,current_HP):
is_visit = [[False for _ in range(len(field[0]))] for __ in range(len(field))]
frontier = set()
frontier.add(locations[current_HP-1])
for step in range(10**10):
for cx,cy in frontier:
if (cx,cy)==locations[current_HP]: return step
... | [["-", 0, 14, 8, 196, 0, 7, 12, 652, 63, 22], ["+", 0, 14, 8, 196, 0, 7, 12, 652, 63, 22]] | 5 | 416 | 2 |
def bfs(field,H,W,start_x,start_y,tmp_N):
direction = [[-1,0],[1,0],[0,-1],[0,1]]
que = []
que.append([start_x,start_y])
INF = 1000000
min_path = [[INF] * W for i in range(H)]
min_path[start_y][start_x] = 0
while len(que) != 0:
current = que.pop(0)
for d in direction:
... | def bfs(field,H,W,start_x,start_y,tmp_N):
direction = [[-1,0],[1,0],[0,-1],[0,1]]
que = []
que.append([start_x,start_y])
INF = 1000000
min_path = [[INF] * W for i in range(H)]
min_path[start_y][start_x] = 0
while len(que) != 0:
current = que.pop(0)
for d in direction:
... | [["-", 0, 662, 12, 652, 3, 4, 0, 657, 31, 22], ["-", 0, 662, 12, 652, 3, 4, 0, 657, 17, 72]] | 5 | 490 | 2 |
h,w,n = map(int, input().split())
stage = [input() for i in range(h)]
starts = [str(i) for i in range(n)]
goals = [str(i+1) for i in range(n)]
starts_y = [0 for i in range(n)]
starts_x = [0 for i in range(n)]
goals_y = [0 for i in range(n)]
goals_x = [0 for i in range(n)]
starts[0] = "S"
for y in range(h):
for x in r... | h,w,n = map(int, input().split())
stage = [input() for i in range(h)]
starts = [str(i) for i in range(n)]
goals = [str(i+1) for i in range(n)]
starts_y = [0 for i in range(n)]
starts_x = [0 for i in range(n)]
goals_y = [0 for i in range(n)]
goals_x = [0 for i in range(n)]
starts[0] = "S"
for y in range(h):
for x in r... | [["-", 0, 57, 15, 679, 12, 666, 0, 557, 0, 6], ["+", 0, 57, 15, 679, 12, 666, 0, 557, 0, 6]] | 5 | 464 | 2 |
h,w,n = map(int, input().split())
stage = [input() for i in range(h)]
starts = [str(i) for i in range(n)]
goals = [str(i+1) for i in range(n)]
starts_y = [0 for i in range(n)]
starts_x = [0 for i in range(n)]
goals_y = [0 for i in range(n)]
goals_x = [0 for i in range(n)]
starts[0] = "S"
for y in range(h):
for x in r... | h,w,n = map(int, input().split())
stage = [input() for i in range(h)]
starts = [str(i) for i in range(n)]
goals = [str(i+1) for i in range(n)]
starts_y = [0 for i in range(n)]
starts_x = [0 for i in range(n)]
goals_y = [0 for i in range(n)]
goals_x = [0 for i in range(n)]
starts[0] = "S"
for y in range(h):
for x in r... | [["-", 0, 57, 15, 679, 12, 666, 0, 557, 0, 6], ["+", 0, 57, 15, 679, 12, 666, 0, 557, 0, 6]] | 5 | 488 | 2 |
#import time, sys#
from collections import deque
H, W, N = map(int, input().split())
field = [list(input()) for i in range(H)]
'''
20 30 9
.......X..8.XXXX.XX..XX.X.XX..
X.XX....X.XX..X.X.X....XXXX..X
..X.X..XX..X.....XX.X..X.XX...
....X.X.X.XXX.X..X..X.X..XX.X.
..XXX.XX...X.X....X.X..X..X...
..X...........X.X...X.1.X... | #import time, sys#
from collections import deque
H, W, N = map(int, input().split())
field = [list(input()) for i in range(H)]
'''
20 30 9
.......X..8.XXXX.XX..XX.X.XX..
X.XX....X.XX..X.X.X....XXXX..X
..X.X..XX..X.....XX.X..X.XX...
....X.X.X.XXX.X..X..X.X..XX.X.
..XXX.XX...X.X....X.X..X..X...
..X...........X.X...X.1.X... | [["-", 0, 52, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 52, 8, 196, 0, 1, 0, 662, 31, 22]] | 5 | 354 | 2 |
#include <iostream>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
#define mod 100000
using namespace std;
int H, W, dp[2][1 << 19][2][2];
string M[20];
int main() {
scanf("%d", &H);
scanf("%d", &W);
for (int i = 0; i < H; i++)
cin >> M[i];
if (M[0][0] == 'J' || M[0][0] == '?')
... | #include <iostream>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
#define mod 100000
using namespace std;
int H, W, dp[2][1 << 19][2][2];
string M[20];
int main() {
scanf("%d", &H);
scanf("%d", &W);
for (int i = 0; i < H; i++)
cin >> M[i];
if (M[0][0] == 'J' || M[0][0] == '?')
... | [["-", 8, 9, 0, 57, 64, 1, 0, 11, 17, 32], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 17, 107]] | 1 | 1,239 | 6 |
#include <iostream>
#include <string>
#pragma warning(disable : 4996)
#define mod 100000
using namespace std;
int H, W, dp[2][1 << 19][2][2], bits[10946];
string M[20];
int main() {
scanf("%d", &H);
scanf("%d", &W);
for (int i = 0; i < H; i++)
cin >> M[i];
if (M[0][0] == 'J' || M[0][0] == '?')
d... | #include <iostream>
#include <string>
#pragma warning(disable : 4996)
#define mod 100000
using namespace std;
int H, W, dp[2][1 << 19][2][2], bits[10946];
string M[20];
int main() {
scanf("%d", &H);
scanf("%d", &W);
for (int i = 0; i < H; i++)
cin >> M[i];
if (M[0][0] == 'J' || M[0][0] == '?')
d... | [["+", 28, 69, 28, 69, 341, 342, 0, 69, 28, 22], ["+", 28, 69, 341, 342, 0, 69, 341, 342, 0, 70], ["+", 28, 69, 341, 342, 0, 69, 341, 342, 0, 73], ["+", 12, 69, 28, 69, 28, 69, 341, 342, 0, 70]] | 1 | 1,226 | 6 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FI... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FI... | [["-", 0, 30, 0, 43, 49, 50, 51, 16, 31, 13], ["-", 0, 30, 0, 43, 49, 50, 51, 16, 17, 151], ["-", 0, 30, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 36, 36, 0, 30, 0, 43, 39, 86, 0, 133], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40]] | 1 | 1,058 | 6 |
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int mod = 100000;
int m, n;
char str[25][25];
//メモリの容量上直前の2マスのみ保存
/* 1~x-1番目のbitは, その場所を基準として, JOが続くか否かを表す.
x番目のbitは, そこにJが来るか来ないかを表す.
(JOが作れるか作れないか知るために必要) */
int dp[2][1 << 20][3];
int ans = 0;
char joi[4] = "JOI";
//＼bitDPできない勢／
in... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int mod = 100000;
int m, n;
char str[25][25];
//メモリの容量上直前の2マスのみ保存
/* 1~x-1番目のbitは, その場所を基準として, JOが続くか否かを表す.
x番目のbitは, そこにJが来るか来ないかを表す.
(JOが作れるか作れないか知るために必要) */
int dp[2][1 << 20][3];
int ans = 0;
char joi[4] = "JOI";
//＼bitDPできない勢／
in... | [["-", 64, 1, 0, 11, 12, 16, 31, 23, 0, 24], ["+", 64, 1, 0, 11, 12, 16, 12, 23, 0, 24], ["-", 64, 1, 0, 11, 12, 16, 31, 23, 0, 25], ["+", 64, 1, 0, 11, 12, 16, 12, 23, 0, 25]] | 1 | 593 | 4 |
#include <stdio.h>
#include <string.h>
char field[1001][1002];
int J[1001][1001], O[1001][1001], I[1001][1001];
int main(void) {
int M, N, K, i, j, a, b, c, d;
scanf("%d%d", &M, &N);
scanf("%d", &K);
for (i = 0; i <= M; i++) {
for (j = 0; j <= N; j++) {
J[i][j] = O[i][j] = I[i][j] = 0;
}
}
... | #include <stdio.h>
#include <string.h>
char field[1001][1002];
int J[1001][1001], O[1001][1001], I[1001][1001];
int main(void) {
int M, N, K, i, j, a, b, c, d;
scanf("%d%d", &M, &N);
scanf("%d", &K);
for (i = 0; i <= M; i++) {
for (j = 0; j <= N; j++) {
J[i][j] = O[i][j] = I[i][j] = 0;
}
}
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 541 | 2 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> class BIT {
private:
int n, m;
vector<vector<T>> bit;
public:
void add(int i, int j, T val) {
for (int i_ = i + 1; i_ < n; i_ += i_ & -i_)
for (int j_ = j + 1; j_ < m; j_ += j_ & -j_)
bit[i_][j_] += val;
}
T sum(int i, in... | #include <bits/stdc++.h>
using namespace std;
template <typename T> class BIT {
private:
int n, m;
vector<vector<T>> bit;
public:
void add(int i, int j, T val) {
for (int i_ = i + 1; i_ < n; i_ += i_ & -i_)
for (int j_ = j + 1; j_ < m; j_ += j_ & -j_)
bit[i_][j_] += val;
}
T sum(int i, in... | [["-", 0, 14, 49, 53, 54, 55, 0, 56, 49, 22], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 49, 22]] | 1 | 705 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, x) for (int i = 0; i < x; ++i)
#define FOR(i, x, y) for (int i = x; i < y; ++i)
#define ALL(a) a.begin(), a.end()
using ll = long long;
int m, n, k;
inline int hash_(char c) { return ((c == 'J') ? 0 : ((c == 'O') ? 1 : 2)); }
int imos[3][1234][1234];
int m... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, x) for (int i = 0; i < x; ++i)
#define FOR(i, x, y) for (int i = x; i < y; ++i)
#define ALL(a) a.begin(), a.end()
using ll = long long;
int m, n, k;
inline int hash_(char c) { return ((c == 'J') ? 0 : ((c == 'O') ? 1 : 2)); }
int imos[3][1234][1234];
int m... | [["-", 51, 16, 12, 69, 28, 69, 341, 342, 0, 22], ["+", 51, 16, 12, 69, 28, 69, 341, 342, 0, 22], ["-", 49, 50, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 49, 50, 51, 16, 12, 69, 341, 342, 0, 22]] | 1 | 377 | 4 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <st... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <st... | [["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["-", 12, 23, 0, 41, 15, 16, 12, 16, 31, 22], ["-", 12, 23, 0, 41, 15, 16, 12, 16, 17, 33], ["-", 12, 23, 0, 41, 15, 16, 12, 16, 12, 13], ["+", 0, 16, 12, 23, 0, 41, 15, 16, 12, 13]] | 1 | 534 | 6 |
#include <cstdio>
int joi2num(char c) {
if (c == 'J')
return 0;
if (c == 'O')
return 1;
return 2;
}
int main() {
int m, n, k;
char fld[1024][1024];
int sum[1024][1024][3];
scanf("%d%d%d", &m, &n, &k);
for (int x = 0; x < m; ++x)
scanf("%s", fld[x]);
for (int i = 0; i < 3; ++i)
sum[0]... | #include <cstdio>
int joi2num(char c) {
if (c == 'J')
return 0;
if (c == 'O')
return 1;
return 2;
}
int main() {
int m, n, k;
static char fld[1024][1024];
static int sum[1024][1024][3] = {0};
scanf("%d%d%d", &m, &n, &k);
for (int x = 0; x < m; ++x)
scanf("%s", fld[x]);
for (int i = 0; i ... | [["+", 0, 14, 8, 9, 0, 43, 0, 114, 0, 115], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46]] | 1 | 623 | 6 |
#include <stdio.h>
int main() {
int m, n, i, j, k;
long int K;
int a, b, c, d;
char tmp;
int J[1002][1002] = {0}, O[1002][1002] = {0}; // I[1002][1002]={0};
int tmp1, tmp2, tmp3;
scanf("%d %d\n%ld\n", &m, &n, &K);
// for(i=0;i<m;i++){
// gets(map[i]);
// printf("%s\n",&map[i]);
//}
// pri... | #include <stdio.h>
int main() {
int m, n, i, j, k;
long int K;
int a, b, c, d;
char tmp;
int J[1002][1002] = {0}, O[1002][1002] = {0}; // I[1002][1002]={0};
int tmp1, tmp2, tmp3;
scanf("%d %d\n%ld\n", &m, &n, &K);
// for(i=0;i<m;i++){
// gets(map[i]);
// printf("%s\n",&map[i]);
//}
// pri... | [["-", 31, 16, 12, 23, 0, 16, 31, 16, 31, 22], ["-", 31, 16, 12, 23, 0, 16, 31, 16, 17, 33], ["+", 31, 16, 12, 23, 0, 16, 31, 16, 17, 33], ["+", 31, 16, 12, 23, 0, 16, 31, 16, 12, 22]] | 1 | 577 | 4 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#includ... | [["-", 15, 339, 51, 16, 31, 69, 28, 69, 28, 22], ["-", 51, 16, 31, 69, 28, 69, 341, 342, 0, 70], ["-", 51, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 51, 16, 31, 69, 28, 69, 341, 342, 0, 73], ["+", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22]] | 1 | 719 | 5 |
#include <bits/stdc++.h>
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
using namespace std;
using I = int;
using L = long;
using F = float;
using D = double... | #include <bits/stdc++.h>
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
using namespace std;
using I = int;
using L = long;
using F = float;
using D = double... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["-", 0, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 9, 0, 57, 64, 9, 0, 46], ["-", 8, 9, 0, 9, 0, 57, 75, 76, 0, 95], ["-", 0, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["-", 0, 57, 75, 76, 0, 9, 0, 93, 0, 94]] | 1 | 486 | 7 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <vector>
using namespace std;
int n, a, b, c, p;
int main() {
scanf("%d", &n);
scanf("%d %d", &a, &b);
scanf("%d", &c);
std::vector<int> cal(n);
for (int j = 0; j < n; j++) {
scanf("%d", &cal[j]);
}
sort(cal.beg... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <vector>
using namespace std;
int n, a, b, c, p;
int main() {
scanf("%d", &n);
scanf("%d %d", &a, &b);
scanf("%d", &c);
std::vector<int> cal(n);
for (int j = 0; j < n; j++) {
scanf("%d", &cal[j]);
}
sort(cal.beg... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 7, 8, 1, 0, 11, 12, 16, 31, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 223 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
double A, B, C, D[100];
cin >> n >> A >> B >> C;
for (int i = 0; i < n; i++) {
cin >> D[i];
}
sort(D, D + n, greater<int>());
double ret = 0;
double dp[100]; // memo topping
for (int i = 0; i < ... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
double A, B, C, D[100];
cin >> n >> A >> B >> C;
for (int i = 0; i < n; i++) {
cin >> D[i];
}
sort(D, D + n, greater<int>());
double ret = 0;
double dp[100]; // memo topping
for (int i = 0; i < ... | [["+", 3, 4, 0, 2, 3, 4, 0, 2, 63, 22], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 22], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 21], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 241 | 5 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
int rec(int, int, int);
using namespace std;
int n;
int k_n;
int k_prise, t_prise;
vector<int> topi;
vector<vector<int>> dp;
int main() {
cin >> n;
cin >> k_prise >> t_prise;
cin >> k_n;
dp.resize(n + 1);
int p = k_prise + t_pr... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
int rec(int, int, int);
using namespace std;
int n;
int k_n;
int k_prise, t_prise;
vector<int> topi;
vector<vector<int>> dp;
int main() {
cin >> n;
cin >> k_prise >> t_prise;
cin >> k_n;
dp.resize(n + 1);
int p = k_prise + t_pr... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 464 | 4 |
#include <stdio.h>
#include <string.h>
#define N 100
#define M 10000
#define PCHK(X) \
((((p >> 4) & 3) == ((p >> 2) & 3) && ((p >> 2) & 3) == (p & 3)))
static int d[N] = {0};
static int n;
static int k_operafan[N][64];
int dpFSA(int s, int p) {
int... | #include <stdio.h>
#include <string.h>
#define N 100
#define M 10000
#define PCHK(X) \
((((p >> 4) & 3) == ((p >> 2) & 3) && ((p >> 2) & 3) == (p & 3)))
static int d[N] = {0};
static int n;
static int k_operafan[N][64];
int dpFSA(int s, int p) {
int... | [["+", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 1, 0, 11, 31, 69, 71, 16, 17, 33], ["+", 0, 1, 0, 11, 31, 69, 71, 16, 12, 13]] | 0 | 313 | 3 |
#include <stdio.h>
int pasta[100], dp[101][4][4];
int main() {
int n, i, j, k, l;
scanf("%d%d", &n, &k);
for (i = 0; i < k; i++) {
int ai, bi;
scanf("%d%d", &ai, &bi);
pasta[ai] = bi;
}
dp[0][0][0] = 1;
for (i = 1; i <= n; i++) {
if (pasta[i] == 0) {
for (j = 1; j <= 3; j++) {
... | #include <stdio.h>
int pasta[100], dp[101][4][4];
int main() {
int n, i, j, k, l;
scanf("%d%d", &n, &k);
for (i = 0; i < k; i++) {
int ai, bi;
scanf("%d%d", &ai, &bi);
pasta[ai] = bi;
}
dp[0][0][0] = 1;
for (i = 1; i <= n; i++) {
if (pasta[i] == 0) {
for (j = 1; j <= 3; j++) {
... | [["-", 75, 76, 0, 9, 0, 7, 10, 11, 12, 13], ["+", 75, 76, 0, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 378 | 8 |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, init, n) for (int i = init; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define RA... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, init, n) for (int i = init; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define RA... | [["-", 64, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["-", 8, 9, 0, 9, 0, 57, 64, 37, 0, 38], ["-", 8, 9, 0, 9, 0, 57, 64, 37, 0, 13], ["+", 8, 9, 0, 9, 0, 57, 64, 116, 0, 117]] | 1 | 462 | 7 |
#include <cstdio>
using namespace std;
int d[100], n, k, dp[100][6];
// 0:aa, 1:bb, 2:cc, 3:a, 4:b, 5:c
int main() {
int a, b;
scanf("%d%d", &a, &b);
for (int i = 0; i < n; i++)
d[i] = 0;
for (int i = 0; i < k; i++)
scanf("%d%d", &a, &b), d[a - 1] = b;
dp[0][0] = dp[0][1] = dp[0][2] = dp[0][3] = dp[... | #include <cstdio>
using namespace std;
int d[100], n, k, dp[100][6];
// 0:aa, 1:bb, 2:cc, 3:a, 4:b, 5:c
int main() {
int a, b;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++)
d[i] = 0;
for (int i = 0; i < k; i++)
scanf("%d%d", &a, &b), d[a - 1] = b;
dp[0][0] = dp[0][1] = dp[0][2] = dp[0][3] = dp[... | [["-", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22]] | 1 | 677 | 4 |
#include <bits/stdc++.h>
using namespace std;
int dp[100][4][4];
int p[100], n, k;
int solve(int day, int bday, int bbday) {
int &tmp = dp[day][bday][bbday];
if (day == n)
return 1;
if (tmp != -1)
return tmp;
if (p[day] != 0) {
return (bday == bbday && bday == p[day]
? 0
... | #include <bits/stdc++.h>
using namespace std;
int dp[100][4][4];
int p[100], n, k;
int solve(int day, int bday, int bbday) {
int &tmp = dp[day][bday][bbday];
if (day == n)
return 1;
if (tmp != -1)
return tmp;
if (p[day] != 0) {
return (bday == bbday && bday == p[day]
? 0
... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22]] | 1 | 251 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, k, a, b, ans = 0, pasta[101] = {}, dp[101][4][4] = {};
cin >> n >> k;
for (int i = 0; i < k; i++) {
cin >> a >> b;
pasta[a] = b;
}
for (int i = 1; i <= 3; i++) {
if (pasta[1] > 0 && i != pasta[i]) {
continue;
}
dp[1][1][... | #include <iostream>
using namespace std;
int main() {
int n, k, a, b, ans = 0, pasta[101] = {}, dp[101][4][4] = {};
cin >> n >> k;
for (int i = 0; i < k; i++) {
cin >> a >> b;
pasta[a] = b;
}
for (int i = 1; i <= 3; i++) {
if (pasta[1] > 0 && i != pasta[1]) {
continue;
}
dp[1][1][... | [["-", 51, 16, 12, 16, 12, 69, 341, 342, 0, 22], ["+", 51, 16, 12, 16, 12, 69, 341, 342, 0, 13]] | 1 | 382 | 2 |
#include <iostream>
#include <vector>
using namespace std;
#define MOD 10000
int main() {
int N, K, A, B;
cin >> N >> K;
vector<int> P(N, 0);
for (int i = 0; i < K; i++) {
cin >> A >> B;
P[A] = B;
}
vector<vector<vector<int>>> dp(N, vector<vector<int>>(3, vector<int>(2, 0)));
if (P[0] != ... | #include <iostream>
#include <vector>
using namespace std;
#define MOD 10000
int main() {
int N, K, A, B;
cin >> N >> K;
vector<int> P(N, 0);
for (int i = 0; i < K; i++) {
cin >> A >> B;
P[A - 1] = B;
}
vector<vector<vector<int>>> dp(N, vector<vector<int>>(3, vector<int>(2, 0)));
if (P[0]... | [["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 617 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | [["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 839 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#de... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#de... | [["-", 0, 41, 64, 16, 31, 69, 341, 342, 0, 13], ["+", 0, 41, 64, 16, 31, 69, 341, 342, 0, 13]] | 1 | 495 | 4 |
#include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 9000000000000000000
#define INF 2000000000
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 9000000000000000000
#define INF 2000000000
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a... | [["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 760 | 2 |
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n; i >= 0; i--)
#define INF 100000005
#define MAX 100000001
#define dmp make_pair
#define dpb push_back
#define fi first
#define se second
using nam... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n; i >= 0; i--)
#define INF 100000005
#define MAX 100000001
#define dmp make_pair
#define dpb push_back
#define fi first
#define se second
using nam... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 109], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 654 | 2 |
#include <bits/stdc++.h>
#define LL long long
#define VI vector<int>
#define VVI vector<vector<int>>
#define VVVI vector<vector<vector<int>>>
#define VL vector<LL>
#define VVL vector<vector<LL>>
#define VVVL vector<vector<vector<LL>>>
#define VB vector<bool>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#d... | #include <bits/stdc++.h>
#define LL long long
#define VI vector<int>
#define VVI vector<vector<int>>
#define VVVI vector<vector<vector<int>>>
#define VL vector<LL>
#define VVL vector<vector<LL>>
#define VVVL vector<vector<vector<LL>>>
#define VB vector<bool>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#d... | [["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 0, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["-", 0, 11, 31, 2, 63, 2, 3, 4, 0, 13], ["+", 0, 11, 31, 2, 63, 2, 3, 4, 0, 13]] | 1 | 827 | 8 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <... | [["-", 341, 342, 0, 16, 31, 23, 0, 16, 17, 33], ["+", 0, 16, 31, 23, 0, 16, 31, 16, 17, 72], ["+", 341, 342, 0, 16, 31, 23, 0, 16, 17, 33], ["+", 341, 342, 0, 16, 31, 23, 0, 16, 12, 13]] | 1 | 448 | 8 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL INF = 1001001001001001;
int main() {
int w, h, n;
scanf("%d %d %d", &w, &h, &n);
vector<int> X, Y, tX, tY;
for (int i = 0; i < n; i++) {
int x, y;
scanf("%d %d", &x, &y);
X.push_back(x);
tX.push_back(x);
Y.push_ba... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL INF = 1001001001001001LL;
int main() {
int w, h, n;
scanf("%d %d %d", &w, &h, &n);
vector<int> X, Y, tX, tY;
for (int i = 0; i < n; i++) {
int x, y;
scanf("%d %d", &x, &y);
X.push_back(x);
tX.push_back(x);
Y.push_... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22]] | 1 | 333 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
using namespace std;
typedef long long int ll;
int W, H;
int N;
int X[100000];
int Y[100000];
int XC[100000];
int YC[100000];
ll ans;
int ansx, ansy;
int main() {
scanf("%d%d", &W, &H);
scanf("%d", &N);
for (int i = 0; i < N; i++) {
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
using namespace std;
typedef long long int ll;
int W, H;
int N;
int X[100000];
int Y[100000];
int XC[100000];
int YC[100000];
ll ans;
int ansx, ansy;
int main() {
scanf("%d%d", &W, &H);
scanf("%d", &N);
for (int i = 0; i < N; i++) {
... | [["+", 75, 76, 0, 9, 0, 1, 0, 11, 31, 22], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 17, 32], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 57, 75, 76, 0, 9, 0, 1, 0, 35]] | 1 | 855 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define MAX_N 111111
typedef long long int ll;
int W, H;
int N;
ll A[MAX_N];
ll B[MAX_N];
int main() {
scanf("%d%d%d", &W, &H, &N);
for (int i = 0; i < N; i++) {
scanf("%lld%lld", &A[i], &B[i]);
}
if (N & 1) {
int n = N / 2;
ll x, y;... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define MAX_N 111111
typedef long long int ll;
int W, H;
int N;
ll A[MAX_N];
ll B[MAX_N];
int main() {
scanf("%d%d%d", &W, &H, &N);
for (int i = 0; i < N; i++) {
scanf("%lld%lld", &A[i], &B[i]);
}
if (N & 1) {
int n = N / 2;
ll x, y;... | [["+", 3, 4, 0, 16, 31, 2, 3, 4, 0, 25], ["-", 3, 4, 0, 16, 12, 2, 3, 4, 0, 25]] | 1 | 698 | 2 |
#include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a)... | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a)... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 659 | 4 |
#include <bits/stdc++.h>
using namespace std;
int N, x[2][100009], p[100009], z[2][100009];
long long v[2][100009];
int main() {
scanf("%*d%*d%d", &N);
for (int i = 0; i < N; i++)
scanf("%d%d", &x[0][i], &x[1][i]);
for (int i = 0; i < 2; i++) {
for (int j = 0; j < N; j++)
v[i][j] = 1LL << 60, p[j] =... | #include <bits/stdc++.h>
using namespace std;
int N, x[2][100009], p[100009], z[2][100009];
long long v[2][100009];
int main() {
scanf("%*d%*d%d", &N);
for (int i = 0; i < N; i++)
scanf("%d%d", &x[0][i], &x[1][i]);
for (int i = 0; i < 2; i++) {
for (int j = 0; j < N; j++)
v[i][j] = 1LL << 60, p[j] =... | [["-", 0, 7, 8, 9, 0, 57, 64, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 1, 0, 34, 0, 21]] | 1 | 490 | 2 |
#include <bits/stdc++.h>
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FORR(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define pb(a) push_back(a)
#define mp(x, y) make_pair(x, y)
#define ALL(a) a.begin(), a.end()
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, -1, sizeof(a))
#d... | #include <bits/stdc++.h>
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FORR(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define pb(a) push_back(a)
#define mp(x, y) make_pair(x, y)
#define ALL(a) a.begin(), a.end()
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, -1, sizeof(a))
#d... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 427 | 4 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll x[100000], y[100000], tx[100000], ty[100000], sum1[100001], sum2[100001];
#define dist(x, y) (abs(i - x) + abs(j - y))
int main() {
ll w, h, n;
scanf("%lld%lld%lld", &w, &h, &... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll x[100000], y[100000], tx[100000], ty[100000], sum1[100001], sum2[100001];
#define dist(x, y) (abs(i - x) + abs(j - y))
int main() {
ll w, h, n;
scanf("%lld%lld%lld", &w, &h, &... | [["-", 0, 14, 8, 9, 0, 43, 39, 344, 141, 78], ["+", 0, 14, 8, 9, 0, 43, 39, 344, 141, 78]] | 1 | 466 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
#define int long long
using namespace std;
signed main() {
int w, h, n, x[100000], y[100000], mx[100000], my[100000];
cin >> w >> h >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
mx[i] = x[i];
my[i] = y[i];
}
sort(x, x + n);
s... | #include <algorithm>
#include <iostream>
#include <vector>
#define int long long
using namespace std;
signed main() {
int w, h, n, x[100000], y[100000], mx[100000], my[100000];
cin >> w >> h >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
mx[i] = x[i];
my[i] = y[i];
}
sort(x, x + n);
s... | [["-", 75, 76, 0, 9, 0, 43, 49, 50, 51, 13], ["+", 75, 76, 0, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 419 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <queue>
#include <vector>
#define MAX_H 1000000000 // 10^9
#define MAX_W 1000000000 // 10^9
#define MAX_N 100000 // 10^5
#define mp make_pair
#define INF 1001001001
#define LLINF 1001001001001001001
#define llint long long int
#define ppp pair<int, pa... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <queue>
#include <vector>
#define MAX_H 1000000000 // 10^9
#define MAX_W 1000000000 // 10^9
#define MAX_N 100000 // 10^5
#define mp make_pair
#define INF 1001001001
#define LLINF 1001001001001001001
#define llint long long int
#define ppp pair<int, pa... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 683 | 5 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
long long int INF = (long long)10000000000 * 100000;
long long int ans = 0;
long long int w, h;
long long int x[100001], y[100001];
vector<long long int> vx;
vector<long long int> vy;
l... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
long long int INF = (long long)10000000000 * 100000;
long long int ans = 0;
long long int w, h;
long long int x[100001], y[100001];
vector<long long int> vx;
vector<long long int> vy;
l... | [["-", 341, 342, 0, 16, 31, 23, 0, 16, 12, 22], ["+", 341, 342, 0, 16, 31, 23, 0, 16, 12, 22], ["-", 51, 23, 0, 16, 31, 23, 0, 16, 12, 22], ["+", 51, 23, 0, 16, 31, 23, 0, 16, 12, 22]] | 1 | 481 | 8 |
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int ox[100000];
int oy[100000];
int x[100000];
int y[100000];
int n;
long long calc(int a, int b) {
int md = 0, i;
long long ans = 0;
for (i = 0; i < n; i++) {
int d = abs(ox[i] - a) + abs(oy[i] - b);
md = max(md, d);
ans... | #include <algorithm>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int ox[100000];
int oy[100000];
int x[100000];
int y[100000];
int n;
long long calc(int a, int b) {
int md = 0, i;
long long ans = 0;
for (i = 0; i < n; i++) {
int d = abs(ox[i] - a) + abs(oy[i] - b);
md = max(md, d);
ans... | [["-", 0, 57, 64, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 57, 64, 9, 0, 7, 26, 27, 17, 68], ["-", 64, 9, 0, 7, 8, 7, 26, 27, 17, 29], ["+", 64, 9, 0, 7, 8, 7, 26, 27, 17, 68]] | 1 | 476 | 4 |
// AOJ 0564: Bug Party
// 2018.1.27 bal4u
#include <stdio.h>
#include <stdlib.h>
typedef struct {
int a, b;
} T;
T tbl[300002];
long long sa[300002];
int n;
#define MAX 300002
int que[MAX];
int qsize;
#define PARENT(i) ((i) >> 1)
#define LEFT(i) ((i) << 1)
#define RIGHT(i) (((i) << 1) + 1)
void max_heapify(int i... | // AOJ 0564: Bug Party
// 2018.1.27 bal4u
#include <stdio.h>
#include <stdlib.h>
typedef struct {
int a, b;
} T;
T tbl[300002];
long long sa[300002];
int n;
#define MAX 300002
int que[MAX];
int qsize;
#define PARENT(i) ((i) >> 1)
#define LEFT(i) ((i) << 1)
#define RIGHT(i) (((i) << 1) + 1)
void max_heapify(int i... | [["+", 0, 1, 0, 34, 12, 11, 12, 16, 17, 72], ["+", 0, 1, 0, 34, 12, 11, 12, 16, 12, 13]] | 0 | 639 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.