Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,019 | #include<iostream>
#include<iomanip>
#include<string>
#include<cstring>
#include<vector>
#include<set>
#include<cmath>
using namespace std;
typedef vector<int> vi;
const int MAX_V=1e3+5;
const int INF=1e9;
vector< vector<int> > board(10,vector<int>(10,0) );
//vector< vector<bool> > same(10,vector<bool>(10,false) );
int... | 819 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;
templ... | 722 |
Project_CodeNet | 2,015 | #include <bits/stdc++.h>
#define REP(a,b,c) for(int a=b; a<(int)c; a++)
#define REPE(a,b,c) for(int a=b; a<=(int)c; a++)
#define REPD(a,b,c) for(int a=b; a>=(int)c; a--)
#define rep(a,b) REP(a,0,b)
#define repd(a,b) REPD(a,b,0)
typedef long long int ll;
using namespace std;
typedef vector<vector<int> > board;
typedef v... | 1,454 |
Project_CodeNet | 2,019 | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include... | 1,114 |
Project_CodeNet | 2,017 | #include<iostream>
#include<queue>
#include<vector>
using namespace std;
#define REP(i, n) for(int i=0; i<n; i++)
struct status {
int k;
vector<int> log;
int map[8][8];
};
int h, w, c;
int d[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
bool gone[8][8];
void change_color(int ac, int (&map)[8][8]){
in... | 1,026 |
Project_CodeNet | 2,019 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define... | 942 |
Project_CodeNet | 2,017 | #include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<utility>
using namespace std;
int panel_loc[8][8];
int visit[8][8];
int color[5];
int maxcolor[5];
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int getarea(const vector<vector<int>> panel,int h, int w){
int c,c_before,sum=0,tmp;
queue<p... | 930 |
Project_CodeNet | 2,012 | /*
* Problem : AOJ1174
* Title : The Balance of the World (世界の天秤)
* Author : mizo0203
* Copyright : Your copyright free
* Description : やるだけ
*/
#include <stdio.h>
#include <memory.h>
#include <algorithm>
using namespace std;
int h, w, c, maxc;
int p[8][8];
bool input() {
int i, j;
scanf("... | 712 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <queue>
using namespace std;
typedef long long ll;
const int INF = 1<<30;
const int MOD = 1e9 + 7;
const int MAX_N = 9... | 769 |
Project_CodeNet | 2,013 | // 2013/06/21 Tazoe
#include <iostream>
using namespace std;
int cnt_max;
int C;
void DFS2(int q[10][10], int y, int x, int b, int c)
{
if(q[y][x]!=b)
return;
q[y][x] = c;
DFS2(q, y, x+1, b, c);
DFS2(q, y+1, x, b, c);
DFS2(q, y, x-1, b, c);
DFS2(q, y-1, x, b, c);
}
void DFS(int n, const int p[10][10], int... | 555 |
Project_CodeNet | 2,018 | #include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<deque>
using namespace std;
typedef uns... | 768 |
Project_CodeNet | 2,016 | #include <iostream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
using namespace std;
const int MAX = 8;
const int dy[4] = { 0,1,0,-1 };
const int dx[4] = { 1,0,-1,0 };
int h, w, c;
int solve(vector<vector<int>> grid, int p[])
{
int ans = 0;
for (int cnt = 0; cnt < 5; cnt++) {
queu... | 878 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int ma, h, w, c, aaa;
void huga(int p[10][10], int tempt[10][10], int x, int y, int a){
if(tempt[x][y] == a) return;
tempt[x][y] = a;//cout<<x<<" "<<y<<endl;
if(p[x][y] == p[x][y+1])huga(p, tempt, x, y+1, a);
if(p[x][y] == p[x][y-1])huga(p, tempt, x, y-1, a);
if(... | 2,134 |
Project_CodeNet | 2,013 | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<queue>
using namespace std;
const int dx[]={0,0,-1,1};
const int dy[]={-1,1,0,0};
pair<int,int> joint[70];
int h,w,c;
int p[8][8];
bool f[8][8];
int solve(int now,int prev,int cnt){
int ret=cnt;
if(now==6){
return cnt;
}
for(int color=1;colo... | 475 |
Project_CodeNet | 2,020 | // >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (... | 2,066 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int fill(int y, int x, int from, int to, vector<vector<int> > &panel){
if(panel[y][x] != from) return 0;
panel[y][x] = to;
int ret = 1;
for(int d=0; d<4; d++){
ret += fill(y+dy[d]... | 397 |
Project_CodeNet | 2,014 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
usi... | 650 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
template<typename T>
using priority_queue_rev = priority_queue<T, vector<T>, greater<T> >;
static const int INTINF = (21... | 1,347 |
Project_CodeNet | 2,015 | #include <iostream>
#include <cstdio>
#include <queue>
#define xx first
#define yy second
#define mp make_pair
#define pb push
using namespace std;
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
int anss=0;
void play(int h, int w, int c,int mas[10][10],int cnt){
//cout << "x" << endl;
//cout << endl;
int con[... | 845 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define all(a) (a).begin(),(a).end()
#define lb(s,x) lower_bound(all(s),x)-s.begin()
#define ub(s,x) upper_bound(all(s),x)-s.begin()
#define uniq(a) a.erase(unique(all(a)),a.end())
#define debug(x... | 559 |
Project_CodeNet | 2,011 | #include <vector>
#include <bitset>
#include <iostream>
#include <string>
#include <stack>
#include <queue>
using namespace std;
class Point{
public:
int y, x;
Point(){}
Point(int y0, int x0){
y = y0;
x = x0;
}
};
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
int solve(int n, ve... | 498 |
Project_CodeNet | 2,017 | #include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <cmath>
using namespace std;
typedef pair<int,int> pii;
int h,w,c;
vector<vector<int> > g;
int ans;
int dy[4] = {-1, 0, 1, 0};
int dx[4] = { 0, 1, 0,-1};
bool r(int y, int x) {
if (y >= 0 && y < h && x >= 0 && x < w) return true;
... | 573 |
Project_CodeNet | 2,017 | #include<iostream>
#include<vector>
#include<cstring>
using namespace std;
bool used[10][10];
int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
int dfs(vector<vector<int> > &grid, int bef, int aft, int x = 0, int y = 0){
int res = 0;
used[y][x] = true;
grid[y][x] = aft;
for (int i = 0; i < 4; i++) {
int nx ... | 524 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,n1,n2) for(int i=n1;i<n2;i++)
#define bFOR(i,n1,n2) for(int i=n1;i>=n2;i--)
#define speed_up ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0... | 826 |
Project_CodeNet | 2,016 | #include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <func... | 891 |
Project_CodeNet | 2,012 | #include <stdio.h>
#include <string.h>
#define rep(i,n) for(int i=0;i<(int)n;++i)
int max(const int a, const int b) {
return a > b ? a : b ;
}
int H, W, C;
int base[10][10];
int copy[10][10], visit[10][10];
const int di[] = {1, -1, 0, 0};
const int dj[] = {0, 0, -1, 1};
void rec(int base_color, int color, int i, i... | 796 |
Project_CodeNet | 2,014 | ////////////////////////////////////////
/// tu3 pro-con template ///
////////////////////////////////////////
#include <cassert>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <functional>
#include <vector>
#incl... | 1,748 |
Project_CodeNet | 2,012 | #include <iostream>
#include <queue>
#include <cstring>
using namespace std;
typedef struct a
{
int x;
int y;
}coordin;
int h,w,c;
int res = 0;
int maze [8][8];
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
void changeColor(int tmp[8][8],int color)
{
int originColor = tmp[0][0];
queue <coordin> q;
coordin c... | 648 |
Project_CodeNet | 2,014 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef pair<int,int> P;
int dx[] = {0,0,1,-1};
int dy[] = {1,-1,0,0};
int h,w,c;
int tile[10][10];
int cnt_tile() {
bool visit[10][10] = {};
int t = tile[0][0];
int ret = 1;
queue<P> que;
que.push(P(0,0));
... | 634 |
Project_CodeNet | 2,020 | // 左上の色を変える順番を全列挙
// 列挙したものについて、それぞれシミュレート
#include <bits/stdc++.h>
using namespace std;
int main() {
while (true) {
int h, w, c;
cin >> h >> w >> c;
if (!(h || w || c)) break;
vector<vector<int>> p(h, vector<int>(w));
for (int i = 0; i < h; ++i) {
for (int j = ... | 1,004 |
Project_CodeNet | 2,014 | #include <cstdio>
#include <iostream>
#include <vector>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vv;
int h,w,c,dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
bool visited[8][8];
void dfs2(vv& vc,int be,int to,int x,int y){
if(visited[x][y]) return;
visited[x][y]=true;... | 752 |
Project_CodeNet | 2,015 | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
#include <stack>
using namespace std;
template <typename T>
class UF{
public:
ve... | 948 |
Project_CodeNet | 2,011 | #define _USE_MATH_DEFINES
#include <iostream>
#include <complex>
#include <algorithm>
#include <vector>
#include <stack>
#include <string>
#include <queue>
#include <cmath>
#include <math.h>
#include <numeric>
#include <list>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <climits>
#include <set>
#in... | 1,014 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
using namespace std;
typedef pair<int,int>P;
typedef pair<P,int>pii;
const int MAX_N = 8;
const int dx[] = {1,-1,0,0};
const int dy[] = {0,0,1,-1};
int h,w,c,opt;
... | 857 |
Project_CodeNet | 2,015 | #include <iostream>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define L(a,d) ((a)<<((d)*3))
#define R(a,d) (((a)>>((d)*3))&7)
int h,w,c,f[16][16],ofs[4][2]={{0,1},{1,0},{-1,0},{0,-1}};
void P(int d){int m=~L(7,d+1);rep(i,h)rep(j,w){f[i][j]&=m;f[i][j]|=L(R(f[i][j],d),d+1);}}
int F(int x,int... | 392 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> mt;
ll h,w,c;
mt p;
vector<mt> dp;
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
ll ans;
bool is_in(ll x, ll y){
return x >= 0 && x < h && y >= 0 && y < w;
}
void change(ll d, ll c){
ll orig = d... | 786 |
Project_CodeNet | 2,015 | #include <bits/stdc++.h>
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 pair<int, int> P;
typedef long ... | 837 |
Project_CodeNet | 2,015 | #define NDEBUG 1
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cassert>
using namespace std;
#define loop(i,a,b) for(int i=(a);i<int(b);i++)
#define rep(i,b) loop(i,0,b)
typedef long long ll;
struct UnionFind {
vector<int> par;
int cnt;
UnionFind(int size_) : pa... | 712 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
int p[10][10];
int d[5] = {0, 1, 0, -1, 0};
int h, w, c;
int dfs(int cnt) {
if (cnt == 5) {
if (p[0][0] != c) return 0;
int ret = 1;
int vis[10][10] = {};
queue<int> qi;
queue<int> qj;
qi.push(0);
qj.push(0);
... | 699 |
Project_CodeNet | 2,015 | #include <bits/stdc++.h>
using namespace std;
const int MAXH = 8;
const int MAXW = 8;
const int di[] = {0,1,0,-1};
const int dj[] = {1,0,-1,0};
int h, w, c;
int p[10][MAXH][MAXW];
int ans;
int dfs(int i, int j, int a, int b, int g[MAXH][MAXW]) {
g[i][j] = b;
int res = 1;
for(int k = 0; k < 4; ++k) {
int ni... | 521 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
class Solve {
private:
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vb = std::vector<bool>;
using vvb = std::vector<vb>;
int H, W, C;
int calcSize(vvi &board, int h, int w)
{
vvb visited(H + 2, vb(W + 2));
std::stack<std::pair<int, int>> previsit;
previsit.pu... | 731 |
Project_CodeNet | 2,014 | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
int H, W, C;
VVI p;
int const dx[] = {-1,0,1,0};
int const dy[] = {0,-1,0,1};
int ans;
inline bool inF(int x, int y) {
return 0<=x && x<W && 0<=y && y<H;
}
void dfs2(int x, int y, int ... | 590 |
Project_CodeNet | 2,013 | #include<iostream>
using namespace std;
int h,w,c;
int board[8][8];
bool vis[8][8];
int dy[] = {-1,0,1,0}, dx[] = {0,1,0,-1};
int dfs(int y,int x, int col){
if(vis[y][x] || board[y][x] != col)return 0;
vis[y][x] = true;
int res = 1;
for(int i=0;i<4;i++){
int ny = y+dy[i], nx = x+dx[i];
if(ny<0 || nx<... | 507 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <queue>
using namespace std;
typedef pair<int, int> P;
vector< vector<int> > change(vector< vector<int> > p, int c) {
int cc = p[0][0];
int h = p.size();
int w = p[0].size();
int dx[] = { 1,0,-1,0 };
int dy[] = { 0,1,0,-1 };
v... | 893 |
Project_CodeNet | 2,011 | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <... | 600 |
Project_CodeNet | 2,013 | #include <iostream>
using namespace std;
#define M 8
int h,w,c;
int p[M][M];
int buf[M][M];
int maxv,maxi;
void change(int oc,int nc,int i,int j){
if(buf[i][j]!=oc)return;
buf[i][j]=nc;
if(i>=1)change(oc,nc,i-1,j);
if(j>=1)change(oc,nc,i,j-1);
if(i<=h-2)change(oc,nc,i+1,j);
if(j<=w-2)change... | 515 |
Project_CodeNet | 2,014 | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef pair<int, int> P;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
int h, w, c;
void Debug(const vector<vector<int>> &b)
{
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j)
cout << b[... | 815 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
using namespace std;
int dx[4]={1, 0, 0, -1};
int dy[4]={0, -1, 1, 0};
int change(int panel[10][10], int y, int x, int c){
int sum=1;
int color=panel[y][x];
panel[y][x]=c;
for(int i=0; i<4; i++){
if(panel[y+dy[i]][x+dx[i]] == color){
sum+=change(panel, y+dy[i], x+dx[... | 404 |
Project_CodeNet | 2,015 | //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <... | 784 |
Project_CodeNet | 2,012 | #include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
using namespace std;
int h, w, c;
int dx[] = {0,1,0,-1};
int dy[] = {-1,0,1,0};
int dfs(vector<vector<int> >& p, vector<vector<bool> >& visited, int x, int y, int color) {
int ret = 1;
for (int i = 0; i < 4; i++) {
int nx = x + dx[i... | 588 |
Project_CodeNet | 2,018 | #include<iostream>
#include <list>
#include<stack>
#include<queue>
#include <vector>
#include <set>
#include<algorithm>
#include<math.h>
#include<stdlib.h>
#include<string>
#include <functional>
#include<fstream>
#define FOR(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define REP(i,n) FOR((i),0,(n))
#define LL long long
#de... | 1,023 |
Project_CodeNet | 2,020 | //tempaa
//#pragma GCC optimize ("-O3")
#ifdef _DEBUG
#include<cassert>
#include "bits_stdc++.h"
#else
#include <bits/stdc++.h>
#endif
#define r_ return
#define v_ vector
#define t_T template<class T>
using namespace std;
//@起動時
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
... | 7,318 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
#define REP(i,n) for(ll i=0;i<ll(n);++i)
#define RREP(i,n) for(ll i=ll(n)-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<ll(n);++i)
#define RFOR(i,m,n) for(ll i=ll(n)-1;i>=ll(m);--i)
#define ALL(v) (v).begin(),(v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v... | 925 |
Project_CodeNet | 2,012 | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <sstream>
#include <vector>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <algorithm>
#include <functional>
using namespace std;
#define REP(i,n) for((i)=0;(i)<(int)(n);(i)++)
int Y,X,... | 483 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define reps(i,s,n) for(int (i)=(s);(i)<(n);++(i))
#define rep(i,n) reps(i,0,n)
#define rept(i,n) rep(i,(n)+1)
#define repst(i,s,n) reps(i,s,(n)+1)
#define reprt(i,n,t) for(int (i)=(n);(i)>=(t);--(i))
#define repr(i,n) reprt(i,n,0)
#define each(itr,... | 1,375 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <algorithm>
using namespace std;
int H,W,C;
int board[8][8];
int b[8][8];
int check[8][8];
int ord[5];
int ans;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
bool in(int x, int y){
return 0 <= x && x < W && 0 <= y && y <... | 595 |
Project_CodeNet | 2,015 | #include <iostream>
#include <string>
#include <string.h>
#include <vector>
#include <algorithm>
#include <sstream>
#include <set>
#include <queue>
using namespace std;
#define For(i,a,n) for(int i = a;i < n;i++)
#define rep(i,n) For(i,0,n)
#define clr(n) memset(n,0,sizeof n)
#define all(n) (n).begin(),(n).end()
c... | 686 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
int h, w, c;
int ans;
map<pair<int, int>, bool> visited;
void dfs(vector<vector<int>> &p, int y, int x, int now, int next)
{
if (visited[{y, x}] == true)
{
r... | 746 |
Project_CodeNet | 2,011 | #include <iostream>
#include <fstream>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | 582 |
Project_CodeNet | 2,016 | #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()
#define dbg(x) cout<<#x... | 690 |
Project_CodeNet | 2,019 | #include <iostream>
#include <queue>
using namespace std;
int H,W,C;
int ti[4000][5] = {};
int F[10][10] = {};
int dx[4] = {-1,1,0,0},dy[4] = {0,0,-1,1};
int con[10][10] = {};
bool in(int x,int y){
return 1<=x && x<=H && 1<=y && y<=W;
}
int main(){
int cnt = 1;
for(int a=1;a<=6;a++){
for(int b=1;... | 658 |
Project_CodeNet | 2,014 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define all(c) (c).begin(), (c).end()
const int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
int h, w, c;
vector<vector<int> > p, vis;
vector<int> col(6, 0);
bool inrect(int x, int y){
ret... | 463 |
Project_CodeNet | 2,013 | #include<iostream>
#include<sstream>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<complex>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cassert>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define mp make_pair
#define pb push_back
#define... | 587 |
Project_CodeNet | 2,013 | #include<stdio.h>
#include<algorithm>
#include<queue>
using namespace std;
int m[10][10];
int dx[]={1,0,0,-1};
int dy[]={0,1,-1,0};
struct wolf{
int m[10][10];
};
int ret=0;
int a,b,c;
void solve(int p,wolf t){
if(!p){
int V=0;
int S=c;
queue<pair<int,int> > Q;
Q.push(make_pair(1,1));
t.m[1][1]=-1;
while(... | 514 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
using namespace std;
int di[] = {-1, 0, 1, 0};
int dj[] = {0, -1, 0, 1};
int h, w, c;
void draw(vector<vector<int> > &p, int color) {
vector<vector<bool> > used(h, vector<bool>(w, false));
queue<pii> que;
que.push(pii(0, 0));
int... | 710 |
Project_CodeNet | 2,017 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i, s, e) for (ll(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (ll(i) = (s); (i) > (e); (i)--)
#define debug(x) cout << #x << ": " << x << endl
#define mp make_pair
#define p... | 1,192 |
Project_CodeNet | 2,011 | #include<iostream>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)
const int N = 8;
bool vis[N][N];
const int dx[]={0,0,1,-1};
const int dy[]={1,-1,0,0};
int ans;
void countup(int r,int c,int y,int x,int &cnt,int tar,
int m[N][N]){
if (vis[y][x])return;
vis[y... | 620 |
Project_CodeNet | 2,016 | #include<iostream>
#include<fstream>
using namespace std;
#define fin cin
int panel[8][8];
int h, w, last;
bool come[8][8];
void come_init() {
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
come[i][j] = false;
}
}
}
//????????????????????????????????£??\????????????????¨????
int getCount(int... | 1,407 |
Project_CodeNet | 2,017 | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
void fill(vector<vector<int>>& color, int x, int y, int pc, int c) {
if(pc == c) {
return;
}
color[y][x] = c;
int dx[4] = {0, 1, 0, -1},
dy[4] = {1, 0, -1, 0};
for(int i=0; i<4; ++i) {
... | 481 |
Project_CodeNet | 2,011 | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <cassert>
#include <vector>
#include <algorithm>
#include <complex>
#include <string>
#include <map>
#include <set>
using namespace std;
int h, w, c;
int p[10][10][10];
int dfs(int y, int x, int depth, int from, int to... | 489 |
Project_CodeNet | 2,014 | #include <cassert>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
const int dx[4] = {0,1,-1,0};
const int dy[4] = {-1,0,0,1};
int ac = 0;
int ans = 0;
void print(vector<vector<int> > field){
cout << "-------------------------" <<endl;
for(int i = 0;i < field.size();i++){
for(int j =... | 724 |
Project_CodeNet | 2,015 | #include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
int dy[]={-1,0,1,0};
int dx[]={0,1,0,-1};
int h,w,c,ans;
int t[10][10];
void check(){
int cnt=0,flg[10][10];
for(int i=0;i<10;i++)for(int j=0;j<10;j++)flg[i][j]=false;
queue<int> qy,qx;
qy.push(0);qx.push(0);
while(!qy.empty()){
... | 634 |
Project_CodeNet | 2,013 | #include <stdio.h>
#include <algorithm>
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
int h,w,c,cnt;
int Panel[8][8];
int P[8][8];
void dfs(int y, int x, int color, int precolor){
if (color==precolor)
return ;
P[y][x]=color;
for (int i=0;i<4;i++){
int mx=x+dx[i];
int my=y+dy[i];
if (0<=mx && mx<w &... | 540 |
Project_CodeNet | 2,011 | #include <iostream>
#include <algorithm>
using namespace std;
int xdir[4] = {0, 1, 0, -1}, ydir[4] = {1, 0, -1, 0};
void change(int b[8][8], bool vis[8][8], int h, int w, int s, int t, int c)
{
for(int i = 0; i < 4; i++){
int dx = t+xdir[i], dy = s+ydir[i];
if(0 <= dx && dx < w && 0 <= dy && dy < h && vis[d... | 787 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll... | 886 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <list>
#include <cstring>
#include <stack>
using namesp... | 795 |
Project_CodeNet | 2,012 | #include <vector>
#include <iostream>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
int h,w,c;
void fill_map(int x,int y,vvi &map,int from,int to){
map[x][y]=to;
for(int i=0;i<4;i++){
int nx=x+dx[i],ny=y+dy[i];
if(nx>=0&&nx<w&&ny>=0&&ny<h){
... | 385 |
Project_CodeNet | 2,011 | #include<queue>
#include<cstdio>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int h,w,c;
struct Panel{ int a[8][8]; };
struct Point{ int x,y; };
int count(const Panel &pnl){
int ans=1;
bool visited[8][8]={}; visited[0][0]=true;
queue<Point> qu; qu.pus... | 573 |
Project_CodeNet | 2,013 | #include <iostream>
#include <algorithm>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define REP(i,n) for(int i = 0; i < (int)n; ++i)
#define REP2(i,n) for(i = 0; i < (int)n; ++i)
#define DEBUG(x) cerr << #x << " = " << x << endl
int count_board(const vector<ve... | 912 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
int hyou[10][10];
int H, W, C, ans;
int D[4] = {1, 0, -1, 0};
bool used[10][10];
void bfs(int c , int (&H3)[10][10]) {
H3[1][1] = 0;
rep(i, 10) rep(j, 10) used[i][j] = false;
... | 631 |
Project_CodeNet | 2,015 | #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
double EPS=1e-8;
int INF = 1e9;... | 635 |
Project_CodeNet | 2,016 | #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 mp make_pair
#define pb push_back
#define fi first
#define se second
typed... | 716 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int h,w,c;
int col[10][10];
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
bool b[10][10];
bool contain(int y,int x){
return (y>=0 && y<h && x>=0 && x<w);
}
int dfs(int y,int x){
if(col[y][x]!=c)return 0;
if(b[y][x])return 0;
b[y][x]=true;
in... | 561 |
Project_CodeNet | 2,012 | #include<iostream>
#include<cstring>
int field[10][10][6] = {0};
int h,w,c;
void copyfield(int num);
void color(int draw, int x, int y, int fand, int num);
int colorval(int lot);
int color_c(int x, int y, int fand, int sum);
using namespace std;
int main(){
while(cin >>h>>w>>c){
if(!h && !w && !c){break;}
for(int ... | 726 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i ++)
#define FOR(i,a,n) for(int i = a; i < n; i ++)
typedef long long ll;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
int h,w,final_c;
int di[] = {0,0,-1,1};
int dj[] = {-1,1,0,0};
VVI change(int col... | 753 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,x,n) for(int i=(x);i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define int long long
using namespace std;
const int MOD=1e9+7;
const int INF=1e9;
const double ESP=1e-5;
template<typename T> void cmax(T &a, T b) {a = max(a, b);}
template... | 486 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<iomanip>
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
#define loop(i,a,b) for(long long i=a... | 454 |
Project_CodeNet | 2,014 | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <utility>
using namespace std;
typedef long long ll;
#define ALL(c) begin((c)), end((c))
#define REP(i,n) for(ll i=0;i<(ll)n;++i)
inline int getInt() { int s; scanf("%d", &s); return s; }
#define SIZ... | 541 |
Project_CodeNet | 2,012 | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<cstdlib>
#define _A_ true
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define MAX 10
#define INF 1<<30
using namespace std;
typedef pair<int,int> P;
int h,w,c;
int p[MAX][MAX];
int Ans;
const int dx[4] = {1,0,-1,0}... | 1,107 |
Project_CodeNet | 2,013 | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#include <map>
#include <set>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define all(v) (v).begin(), (v).end()
#def... | 773 |
Project_CodeNet | 2,017 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb emplace_back
#define INF (1e9+1)
//#define INF (1LL<<59)
ll power(ll a,ll b/*,ll mod*/){
ll ret=1;
if(b>0){
ret = po... | 701 |
Project_CodeNet | 2,012 | #include<iostream>
#include<vector>
#include<queue>
using namespace std;
typedef pair<int,int> Pos;
int h,w,c;
int ans;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
vector< vector<int> > change(vector< vector<int> > panel, int pre, int after)
{
vector< vector<int> > visited(h+2,vector<int>(w+2,0));
queue<Pos> q;
... | 579 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };
int h, w, c;
int dfs(int x, int y, vector<vector<int>>& used, const vector<vector<int>>& b) {
used[x][y] = 1;
int res = 1;
for (int i = 0; i < 4; i++) {
int tx = x + dx[... | 579 |
Project_CodeNet | 2,014 | #include<bits/stdc++.h>
using namespace std;
int h,w,c;
int panel[10][10], sub[10][10];
vector<int> seq;
bool vis[10][10];
const int dy[] = {-1,0,1,0}, dx[] = {0,1,0,-1};
int dfs(int y, int x, int col){
if(vis[y][x])return 0;
vis[y][x] = true;
int res = 1;
for(int i=0;i<4;i++){
int ny = y+dy[i], nx = x+d... | 438 |
Project_CodeNet | 2,015 | #include <bits/stdc++.h>
using namespace std;
const int H = 8;
const int W = 8;
const int C = 6;
const int dy[4] = {0,1,0,-1};
const int dx[4] = {1,0,-1,0};
int h,w,c;
int v[H][W];
void init_next(int field[H][W], int next[H][W]){
for(int i=0;i<h;i++) for(int j=0;j<w;j++) next[i][j] = field[i][j];
}
bool check(int... | 701 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
int g[8][8];
int h,w,c;
bool used[8][8];
const int dx[]={-1,0,1,0},dy[]={0,-1,0,1};
int dfs(int cnt,int tg[8][8]){
int re... | 584 |
Project_CodeNet | 2,011 | #include <iostream>
using namespace std;
const int MAXH=8;
const int MAXCOL=6;
const int MAXT=7;
const int dx[4]={-1,1,0,0};
const int dy[4]={0,0,-1,1};
int H,W,C;
int map[MAXH][MAXH][MAXT];
bool visited[MAXH][MAXH];
void copymap(int moto,int to){
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
map[i][j][t... | 737 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
typedef pair<int, int> P;
int p[10][10], visited[10][10];
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int h, w, c;
int dfs(int count) {
if(count == 5) {
int ret = 0;
if(p[0][0] != c) return 0;
... | 618 |
Project_CodeNet | 2,012 | #include <iostream>
#include <cstring>
using namespace std;
int H,W,C;
const int dx[] = {+1, 0,-1, 0};
const int dy[] = { 0,+1, 0,-1};
void dfs(int data[8][8], int x, int y, int c)
{
int tc = data[x][y];
data[x][y] = c;
for(int i=0; i<4; i++)
{
int nx = x+dx[i];
int ny = y+dy[i];
if(0<=nx && nx<W && 0<=ny &... | 495 |
Project_CodeNet | 2,012 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int w,h,c,ans;
int dx[4] = {0,0,-1,1};
int dy[4] = {-1,1,0,0};
void debug(vector< vector<int> >& p){
for(int y=0 ; y < h ; y++ ){
for(int x=0 ; x < w ; x++ ){
cout << p[y][x];
}
cout << endl;
}
}
void dfs_2(vector< vector<int>... | 664 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.