Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,014 | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <istream>
#include <sstream>
#include <iomanip>
#include <iterator>
#include <climits>
using namespace std;
typedef... | 922 |
Project_CodeNet | 2,013 | #include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <c... | 900 |
Project_CodeNet | 2,014 | #include <iostream>
using namespace std;
int h, w, c, p[9][9], q[9][9];
int id = 7;
void change(int x, int y, int color){
int first = p[x][y];
p[x][y] = color * (-1);
if (x < h - 1 && p[x + 1][y] == first)
change(x + 1, y, color);
if (x > 0 && p[x - 1][y] == first)
change(x - 1, y, color);
if (y < w - 1 && p[... | 935 |
Project_CodeNet | 2,011 | #include <iostream>
#include <vector>
#include <queue>
#include <cstring>
using namespace std;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
int maxc;
int count_color(vector<vector<int> > &m) {
if(m[0][0] != maxc) return 0;
int c = m[0][0];
int ret = 0;
queue<pair<int,int> > q;
q.push(make_pair(0,0)... | 649 |
Project_CodeNet | 2,012 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <queue>
using namespace std;
#define F first
#define S second
#define RANGE(a, b, c) ( (a) <= (b) && (b) <= (c) )
int w, h, c;
int ans;
int field[8][8];
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
void color_change(int from, int to) {
field[0]... | 979 |
Project_CodeNet | 2,015 | #include <algorithm>
#include <vector>
#include <cfloat>
#include <string>
#include <cmath>
#include <set>
#include <cstdlib>
#include <map>
#include <ctime>
#include <iomanip>
#include <functional>
#include <deque>
#include <iostream>
#include <cstring>
#include <queue>
#include <cstdio>
#include <stack>
#include <cli... | 1,065 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#d... | 762 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
using namespace std;
const int N = 10;
int h, w, c;
struct Point{ int x, y; };
int dy[4] = {0,1,0,-1}, d... | 553 |
Project_CodeNet | 2,016 | #include<bits/stdc++.h>
using namespace std;
int h,w,c;
int field[8][8];
int tmpfield[8][8];
int lt;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
void dfs(int a,int b,int cc){
if(a<0||h<=a||b<0||w<=b) return;
if(tmpfield[a][b]!=lt) return;
tmpfield[a][b]=cc;
for(int i=0;i<4;++i)
dfs(a+dx[i],b+dy[i],cc);
r... | 446 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
int h,w;
int p[8][8];
int cp[8][8];
int cnt[4];//最後の1回は色固定
void cppanel()
{
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
cp[i][j]=p[i][j];
}
}
bool f[8][8];
int dx[4]={1,0,-1,0};
int dy[4]={0,-1,0,1};
void dfs(int nowh,int noww,int nowcolor,int nuru)
{
f[nowh][noww... | 632 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
using pii = pair<int, int>;
using vi=vector<int>;
using vvi=vector<vector<int>>;
int h,w,c;
int mx=0;
vvi last_cond;
int dfs(vvi p,int color,int depth){
int base = p[0][0];
queue<pii>q;
... | 644 |
Project_CodeNet | 2,015 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
int h, w, c;
vvi panel;
vvi initPanel;
vvb visited;
vi change;
bool in(int i, int j){
return 0 <= i && i < h && 0 <= j && j < w;
}
int Cou... | 764 |
Project_CodeNet | 2,015 | #include <iostream>
#include <stack>
#include <vector>
#include <cassert>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
using namespace std;
struct point_t { int x, y; };
template <typename T>
bool on(point_t p, T const & xss) {
return 0 <= p.y and p.y < xss.size()
and 0 <= p.x and p.x < xss.front()... | 688 |
Project_CodeNet | 2,012 | #include <iostream>
using namespace std;
int x,y,c;
int field[10][10];
bool is_field[10][10];
void initis_field()
{
for(int i=0;i<10;i++){
for(int j=0;j<10;j++){
is_field[i][j] = false;
}
}
}
void check_field(int x,int y)
{
if(field[x][y] == c)
is_field[x][y] = true;
int vx[4] = {-1,0,1,0};
int vy[4] =... | 668 |
Project_CodeNet | 2,013 | #include <stdio.h>
#include <queue>
#include <utility>
using namespace std;
typedef pair<int,int> P;
int h, w, c;
int dy[4] = {-1,0,1,0}, dx[4] = {0,1,0,-1};
void paint(int t[8][8],int a){ // aは変更する色
int y, x, b, i, j, f[8][8]; // bは元の色
queue<P> que;
que.push(P(0,0));
b = t[0][0];
t[0][0] = a;
for(i = 0;i < ... | 816 |
Project_CodeNet | 2,016 | #include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int h,w,tc;
void cpy(char dst[10][10], const char src[10][10]) {
for(int j=0; j<10; j++)
for(int i=0; i<10; i++)
dst[j][i] = src[j][i];
}
void paint(char dst[10][10], int sc, int tc, int x, int y) {
if(x<0 || y<0 ... | 504 |
Project_CodeNet | 2,016 | #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
long long int powint(long long int a, long long int b) {
assert(b >= 0);
if (b == 0)return 1;
if (b... | 688 |
Project_CodeNet | 2,018 | //#include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<bitset>
#include<algorithm>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<string.h>
#include<cmath>
#include<utility>
#include<functional>
#include<map>
#include<set>
#include<cctype>
#define FOR(i, a, ... | 1,753 |
Project_CodeNet | 2,013 | #include<iostream>
using namespace std;
const int MAX = 8;
const int COLOR = 6;
int h,w,c;
int M[MAX][MAX];
int tmp[MAX][MAX];
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
void input(){
for(int i = 0; i < h; i++)
for(int j = 0; j < w; j++) cin >> M[i][j];
}
bool isInside(int x, int y){return 0<=x&&x<w&&0<=y... | 574 |
Project_CodeNet | 2,013 | #include<iostream>
#include<vector>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
int h,w,c;
int p[8][8];
void print(int d){
cout<<"depth:"<<d<<endl;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++)cout<<p[i][j]<<' ';
cout<<endl;
}
}
bool all(){... | 651 |
Project_CodeNet | 2,011 | #include<stdio.h>
#include<string.h>
int m[6][10][10];
int h,w,c,d[]={0,1,0,-1,0};
int C(int x,int y,int s,int f,int t)
{
int&r=m[s][y][x],i,a=1;
if(r-f)return 0;
r=t;
for(i=0;i<4;++i)a+=C(x+d[i],y+d[i+1],s,f,t);
return a;
}
int F(int s)
{
if(s>=5)return C(1,1,s,c,0);
int r=0,t,i,p=m[s][1][1];
for(i=1;i<=6;++i)... | 289 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <queue>
#include <utility>
using namespace std;
vector< vector<int> > c(int k,vector< vector<int> > M){
queue< pair<int,int> > q;
q.push(make_pair(0,0));
int f_c = M.at(0).at(0);
vector< vector<bool> > reached(M.size(),vector<bool>(M.at(0).size(),false));
... | 1,071 |
Project_CodeNet | 2,020 | /**
* author: otera
**/
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<... | 1,050 |
Project_CodeNet | 2,015 | #include<iostream>
using namespace std ;
int h,w,c ;
int table[10][10] = {} ;
int dxy[] = {0,-1,0,1,0} ;
int MAX( int a , int b ){ return ( (a>b) ? a : b ) ; }
int cnt_search( int P[][10] , int nx , int ny , int color ){
int ans = 1 ;
P[ny][nx] = 0 ;
for( int i=0 ; i<4 ; i++ ){
if( color == P[ny+dxy[i]][nx+dxy[... | 725 |
Project_CodeNet | 2,015 | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
using namespace std;
#define REP(i, x) for(int i=0;i<(int)(x);i++)
#define REPS(i, x) for(int i=1;i<=(int)(x);i++)
#define RREP(i, x) for(int i=(int)(x)-1;i>=0;i--)
#define RREPS(i, x) for(int i=(int)(x);i>0;i--)
#define FOR(it, x) for(auto it=x... | 529 |
Project_CodeNet | 2,015 | #include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr,__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!... | 788 |
Project_CodeNet | 2,015 | #include<iostream>
#include<vector>
#include<queue>
#define f first
#define s second
using namespace std;
int h,w,p[8][8],rast,ans,map[8][8];
int x[4]={1,-1,0,0};
int y[4]={0,0,1,-1};
bool color[6];
vector<pair<int,pair<int,int> > > V;
bool in(int i,int j)
{
if(i<0 || j<0 || i>=h || j>=w)return false;
return tru... | 628 |
Project_CodeNet | 2,014 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i =0;i<n;++i)
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define FOR(it,a ) for(__typeof(a.begin())it=a.begin();it!=a.end();++it)
int h,w,c;
int in[10][10];
int ans;
int dx[]={1,0,-1,0};
int dy[]={0,-1,0,1};
typed... | 599 |
Project_CodeNet | 2,017 | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f... | 842 |
Project_CodeNet | 2,015 | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
const int MAX_H = 10;
const int MAX_W = 10;
const int C = 5;
int h, w, c;
int p[MAX_H][MAX_W];
int used[MAX_H][MAX_W];
inline bool check(int hx, int hy){ return 0 <= h... | 623 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
using namespace std;
typedef pair<int, int> P;
int h, w, c;
vector<vector<int>> original_field;
int vx[4] = { 0,1,0,-1 }, vy[4] = { 1,0,-1,0 };
int ans = 0;
int ans1 = 0;
bool used[8][8];
void dfs3(vector<vector<int>> &f) {
for (int i = 0; i... | 824 |
Project_CodeNet | 2,013 | #include <cstdio>
#include <algorithm>
#include <stack>
#include <utility>
using namespace std;
typedef pair<int, int> point;
int h, w;
int p[8][8], q[8][8];
const int d[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
void change(int c)
{
stack<point> s;
int b = q[0][0];
s.push(point(0, 0));
q[0][0] = ... | 836 |
Project_CodeNet | 2,019 | #if __has_include("../library/Basic/Debug.hpp")
#include "../library/Basic/Debug.hpp"
#else
/* ----- Header Files ----- */
// IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>
// container
#include <vector>
#include <str... | 1,275 |
Project_CodeNet | 2,017 | #include<iostream>
#include<iomanip>
#include<cstdlib>
#include<stdio.h>
#include<time.h>
#include<math.h>
#include<algorithm>
#include<string>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<map>
#define REP(i, N) for(ll i = 0; i < N; ++i)
#define FOR(i, a, b) for... | 822 |
Project_CodeNet | 2,013 | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)
int dpanel[8][10][10];
int h,w,pmax,lastcol;
int dx[]={-1,0,1,0};
int dy[]={0,1,0,-1};
int _count(const int panel[10][10], int v... | 689 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <algorithm>
using namespace std;
int h, w, c;
vector<vector<int>> grid;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
vector<vector<int>> change(const vector<vector<int>>& g, in... | 792 |
Project_CodeNet | 2,013 | #include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <cstring>
using namespace std;
typedef vector<int> vint;
int h, w, c, ans;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
vint bfs(const vector<vint> &p){
vint ret;
bool visit[10][10] = {};
queue<int> q;
q.push(1 << 8 | 1);
... | 512 |
Project_CodeNet | 2,014 | #include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
int H, W, C;
int field[8][8];
int dh[] = {0, 0, 1, -1};
int dw[] = {1, -1, 0, 0};
void dfs2(int h, int w, int pc, int nc){
field[h][w] = nc;
for(int i=0; i<4; i++){
int nh = h + dh[i];
int nw = w + dw[i];
... | 525 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, k, n) for (int i = k; i < (int)(n); i++)
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
typedef long long ll;
const int dx[] = {0, 1, 0, ... | 987 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int,int>
#define ll long long
#define pal pair<double,double>
#define ppap pair<pa,int>
#define PI 3.14159265358979323846
#define paa pair<int,char>
#define mp make... | 3,170 |
Project_CodeNet | 2,014 | #include <cstdio>
int a[10][10],ans,t,x[65],y[65],e[5][3],h,w,c;
int bfs(){
int h=0,nx,ny;
bool bj[10][10]={false};
x[1]=1;
y[1]=1;
bj[1][1]=true;
t=1;
while (h<t){
h++;
for (int i=1;i<=4;i++){
nx=x[h]+e[i][1];
ny=y[h]+e[i][2];
if (a[nx][ny]==a[1][1]&&!bj[nx][ny]){
bj[nx][ny]=true;
t++;
... | 512 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#... | 872 |
Project_CodeNet | 2,017 | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#define REP(i,n) for(int i = 0;i<(n);i++)
#define FOR(i,j,n) for(int i = (j);i<(n);i++)
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
using namespace std;
int ans = 0;
const int Col = 6;
int h,w;
int TargetCol;
inline bool isRange(int y,... | 608 |
Project_CodeNet | 2,016 | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
int h,w,c;
int calc(int map[8][8], int c[6]){
bool isConnedted[8][8];
fill(isConnedted[0],isConnedted[8],false);
typedef pair<int,int> P;
queue<P> que;
int d[5]={-1,0,1,0,-1};
int num;
for(int ... | 549 |
Project_CodeNet | 2,015 | #include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
#define F first
#define S second
typedef vector<int>vi;
typedef vector<vi>vvi;
typedef pair<int,int>pii;
struct data{
int cnt;
vvi fld;
data(){}
data(int a,vvi b):cnt(a),fld(b){}
};
data check(vvi fld){
int... | 538 |
Project_CodeNet | 2,014 | #include <bits/stdc++.h>
using namespace std;
typedef vector<vector<int> > VVI;
struct State{
int x, y;
State(int x, int y): x(x), y(y){}
};
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
int H, W, c;
int org[10][10];
int field[10][10];
VVI pattern;
void dfs(vector<int> v, int color){
v.pu... | 858 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef pair<int, int>P;
int h, w, c, Max;
int dx[]{ 1,-1,0,0 }, dy[]{ 0,0,1,-1 };
vector<vector<int>>a;
void mark(int x, int y, int b, int c) {
a[x][y] = c;
rep(i, 4) {
int nx = x + dx[i], ny = y + dy[i];
if (0 <= nx&&nx < h && ... | 447 |
Project_CodeNet | 2,013 | #include <stdio.h>
#include <vector>
#include <queue>
#include <memory.h>
#include <functional>
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
using namespace std;
//FILE * in = freopen("input.txt", "r" , stdin);
typedef unsigned int Color;
struct Point{
Point(unsigned int x, unsigned int y)... | 833 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstdint>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
#include <tuple>
static size_t di[] = {size_t(-1), 0, 1, 0};
static size_t dj[] = {0, size_t(-1), 0, 1};
std::vector<std::vector<int>> paint(std::vector<std::vector<int>> p, int c) {
size_t h = p.size();
... | 751 |
Project_CodeNet | 2,012 | #include <iostream>
#include <cstring>
using namespace std;
int W, H, C;
int field[9][9];
bool visited[9][9];
const int dx[] = { -1, 0, 1, 0 };
const int dy[] = { 0, -1, 0, 1 };
void recolor(int x, int y, int org, int col)
{
field[x][y] = col;
for(int i=0; i<4; i++) {
int tx = x + dx[i];
int ty = y + ... | 496 |
Project_CodeNet | 2,015 | // {{{ include
#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
// }}}
using namespace std;
typedef long long ll;
inline int in(){int x;scanf("%d",&x);return x;}
const int dx[] = {1, -1, 0... | 714 |
Project_CodeNet | 2,014 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,a) repi(i,0,a)
#define repd(... | 665 |
Project_CodeNet | 2,012 | // AOJ 1174
#include <iostream>
#include <algorithm>
using namespace std;
int data[10][10], done[10][10];
int h, w, c;
int ret, cnt;
void coloring(int x, int y, int color, int from);
void calc(int x, int y, int color);
void rec(int deep)
{
if (deep == 5){
for (int i = 0; i < 10; i++){
for (int j = 0; j < 10; ... | 738 |
Project_CodeNet | 2,013 | #include<iostream>
#include<vector>
using namespace std;
#define REP(i, j) for(int i = 0; i < j; i++)
#define FOR(i, j, k) for(int i = j; i < k; i++)
int h, w, c;
int Cnt(vector< vector<int> > &f, int y, int x, int color){
f[y][x] = -1;
int ret = 1;
int my[] = {0, 0, 1, -1};
int mx[] = {1, -1, 0, 0};
... | 640 |
Project_CodeNet | 2,014 | #include<iostream>
#include<vector>
using namespace std;
int ans;
int H,W,C;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
void change(vector<vector<int> > &panels,vector<vector<bool> > &done,int x,int y,int color,int before_color){
if(x<0 || y<0 || x>=W || y>=H) return;
if(done[y][x]) return;
done[y][x]=true;
if(p... | 484 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
int h, w, c;
int p[8][8];
int cnt, ans;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
bool done[8][8];
void cntclr(int x, int y, int f, int t)
{
if(p[y][x] != f) return;
done[y][x] = true;
p[y][x] = t; cnt++;
for(int i = 0; i < 4; i++) {
int nx = x + ... | 481 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double>... | 594 |
Project_CodeNet | 2,014 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <utility>
#include <vector>
usin... | 885 |
Project_CodeNet | 2,015 | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
int max(int a,int b){
if(b>a)return b;
return a;
}
int p[10][10];
int cp[10][10];
int flag[10][10];
int h,w,c;
struct data{
int x,y;
};
struct data que[5000000];
int f,t;
void push(int xx,int yy){
que[t].x=xx;
que[t].y=yy;
t++;
}
struct data pop(){
... | 570 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
//---------------------------------------------------------------
// ------ disjoint set ------ //
struct UnionFind {
vector<int> data;
int __size;
UnionFind(int size) : data(size, -1), __size(size) { }
boo... | 892 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <tuple>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <numeric>
#include <utility>
#include <iterator>
#include <cstdio>
#i... | 989 |
Project_CodeNet | 2,014 | #include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int pan[10][10];
int H, W, C;
int change(int c0, int c1, int x, int y, int panel[10][10]) {
if ( x > 9 || y > 9 ) { return 0; }
if ( x < 0 || y < 0 ) { return 0; }
if ( panel[x][y] == c0 ) {
panel[x][y] = c1;
int ret = 1;... | 998 |
Project_CodeNet | 2,011 | #include<vector>
#include<list>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int e(int a[][10],int d[][10],int x,int y,int c){
if(a[x][y]==c&&d[x][y]==0){
d[x][y]=1;
return 1+e(a,d,x-1,y,c)+e(a,d,x,y-1,c)+e(a,... | 544 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
typedef pair<int, int> P;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int h, w, c, p[8][8];
bool used[8][8];
int search(int color) {
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++) used[i][j] = false;
int before = p[0]... | 628 |
Project_CodeNet | 2,017 | #include <iostream>
#include <queue>
#include <utility>
#include <stdlib.h>
using namespace std;
bool pass(const int h, const int w, pair<int,int> &next) {
if (next.first < 0 || next.first >= h)
return false;
if (next.second < 0 || next.second >= w)
return false;
return true;
}
int search(const int h... | 1,257 |
Project_CodeNet | 2,014 | #include <bits/stdc++.h>
using namespace std;
bool vis[8][8];
int mp[8][8];
int h, w, c, prv;
int dy[4] = {0, 1, 0, -1}, dx[4] = {1, 0, -1, 0};
int ch(int y, int x)
{
vis[y][x] = true;
int ret = 1;
mp[y][x] = mp[0][0];
for (int i = 0; i < 4; i++){
int ny = y + dy[i], nx = x + dx[i];... | 571 |
Project_CodeNet | 2,016 | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#d... | 519 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<queue>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vvi = vector<vector<int>>;
using vi = vector<int>;
int f_dir[2][4] = {{-1, 0, 0, 1}, {0, -1, 1, 0}};
bool is_in_field(int y, int x, int h... | 837 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=10005,INF=1<<29;
typedef vector<vector<int>> mat;
vector<int> dh={0,1,0,-1},dw={1,0,-1,0};
int ans,H,W,X;
void DFS(mat S,int turn){
if(turn==4){
mat cha(H,vector<int>(W));
... | 841 |
Project_CodeNet | 2,016 | // IdenticallyColoredPanelsConnection.cpp
#include <iostream>
using namespace std;
#define SCAST(type, data) static_cast<type>((data))
const int MAX_MATRIX = 8;//??????????????§??°
typedef enum __COLOR{//???
YELLOW=1, PEACH, RED, PURPLE, GREEN, BLUE, NONE_COLOR
} COLOR;
typedef enum __CONNECT{//????????????????????... | 2,612 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limit... | 941 |
Project_CodeNet | 2,016 | #include<iostream>
#include<vector>
#define MAX_H 10
#define MAX_W 10
int h, w, c, cnt, ans;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
using namespace std;
int in_map(int x, int y)
{
return (0 <= x && x < w && 0 <= y && y < h);
}
void connection(vector< vector<int> > &map, int x, int y, int color, int... | 642 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <cctype>
#include <utility>
#include <vector>
#include <unordered_set>
#include <functional>
#include <complex>
using namespace std;
const auto gcu = getchar_unlocked;
const auto pcu = putchar_unlocked;
#define _DEF(r, n, ...) inline r n(__VA_ARGS__) noexcept
#define _T template <typename T>... | 1,331 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
int H, W, C;
int panel[8][8];
int ans;
int used[8][8];
int dfs2(int x, int y, int c) {
int ret = 0;
used[y][x] = 1;
for ( int i = 0; i < 4; i++ ) {
int nx = x+dx[i], ny = y+dy[i];
if ( nx < 0 || ny < 0 || nx... | 647 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
... | 542 |
Project_CodeNet | 2,013 | #include<cstdio>
#include<vector>
#include<algorithm>
#include<cstring>
using namespace std;
int n,m,c;
bool vis[11][11];
int dx[]={0,0,-1,1};
int dy[]={-1,1,0,0};
int ans;
void change(int x, int y, int cur, int to, vector< vector<int> > &B) {
B[x][y]=to;
vis[x][y]=1;
for(int i=0;i<4;++i) {
int nx=x+dx[i];
in... | 503 |
Project_CodeNet | 2,011 | #include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
const int MAX_SIZE = 8;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
typedef struct
{
int x, y;
} Point;
typedef struct
{
Point p;
int color;
} Log;
bool visited[MAX_SIZE][MAX_SIZE];
int h, w, c, ... | 1,168 |
Project_CodeNet | 2,017 | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... | 835 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#pragma gcc optimize("Ofast")
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int h, w, c, ans =... | 823 |
Project_CodeNet | 2,011 | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include... | 916 |
Project_CodeNet | 2,019 | #include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#in... | 2,013 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
struct UnionFind {
const int n;
V<> t; // root ? -sz : par
UnionFind(int n) : n(n), t(n, -1) {}
int find(int v) { return t[v] < 0 ? v : t[v] = find(t[... | 769 |
Project_CodeNet | 2,016 | #include <map>
#include <set>
#include <list>
#include <cstdio>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cctype>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <sstream>
#include <iostream>
#include <algorithm>... | 644 |
Project_CodeNet | 2,013 | #include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include ... | 1,106 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
struct UnionFind {
vector<int> par;
vector<int> rank;
vector<ll> Size;
UnionFind(int n = 1) {
init(n);
}
void init(int n = 1) {
par.resize(n + 1); rank.resiz... | 886 |
Project_CodeNet | 2,017 | #include <iostream>
#define REP(i, a, n) for(int i = (a); i < (n); i++)
using namespace std;
int H, W, C, P[7][8][8];
int isin(int y, int x) {
return 0 <= y && y < H && 0 <= x && x < W;
}
int color(int n, int c, int d, int y, int x) {
if(P[n + 1][y][x] != d) return 0;
int dd[5] = { 0, 1, 0, -1, 0 };
int ret... | 479 |
Project_CodeNet | 2,016 |
#include <iostream>
#include <queue>
#include <cmath>
using namespace std;
#define COMBI_SIZE 3750
int combi[COMBI_SIZE][5];
int dx[] = { 0, 1, 0, -1 };
int dy[] = { -1, 0, 1, 0 };
void precalc() {
int s = 0;
for (int i = 1; i <= 6; i++) {
for (int j = 1; j <= 6; j++) {
if (j == i) cont... | 843 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <array>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <tuple>
#include <bitset>
#include <memory>
#include <cmath>
#include <algorithm>
#include <functional>
#in... | 756 |
Project_CodeNet | 2,012 | #include <queue>
#include <iostream>
#include <utility>
using namespace std;
int h,w,c,ans;
void dfs(int dep,int a[][8]){
int x,y,dx[]={0,1,0,-1},dy[]={1,0,-1,0};
if(dep==5){
int t=1;
if(c==a[0][0]){
queue<pair<int,int> > q;
q.push(make_pair(0,0));
a[0][0]=-1;
while(!q.empty()){
x=q.front().fir... | 568 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<queue>
using namespace std;
#define inRange(x,a,b) (a <= x && x < b)
int di[8] = {0,0,1,-1,1,1,-1,-1};
int dj[8] = {1,-1,0,0,1,-1,1,-1};
vector<vector<int>> mat(8, vector<int>(8));
int h, w, c, ans = 0;
void dfs(int cur){
if(cur == 5){
vector<vector<int>> cp = ... | 742 |
Project_CodeNet | 2,017 | //#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#defi... | 1,172 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int map[9][9];
int h,w,C;
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
main()
{
while(cin>>h>>w>>C,h)
{
for(int i=0;i<h;i++)for(int j=0;j<w;j++)cin>>map[i][j];
int ans=0;
for(int a=1;a<7;a++)for(int b=1;b<7;b++)for(int c=1;c<7;c++)
for(int d=1;d<7;d++)
{
int now=0;
... | 1,052 |
Project_CodeNet | 2,015 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vec;
typedef vector<vec> mat;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int h, w, c;
bool ok(int i, int j)
{
return i >= 0 && j >= 0 && i < h && j < w;
}
void show(mat& a)
{
for (int i = 0; i < a.size(); i++){
for (int j = 0;... | 713 |
Project_CodeNet | 2,011 | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int MAX_N = 8;
int H, W, C;
int G[MAX_N][MAX_N];
bool vis[MAX_N][MAX_N];
int dfs(int x, int y, int c) {
const static int dx[] = {1,0,-1,0};
const static int dy[] = {0,1,0,-1};
int res = 1;
vis[y][x] = true;
for(int i = 0;... | 564 |
Project_CodeNet | 2,015 | #include <cstdio>
#include <algorithm>
using namespace std;
int h, w, c;
void copy_panel(int s[10][10], int d[10][10]) {
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
d[i][j] = s[i][j];
}
}
}
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
void change_color(i... | 660 |
Project_CodeNet | 2,014 | #include<iostream>
#include<cstring>
using namespace std;
int h,w,c;
const int dx[] = {0,0,1,-1};
const int dy[] = {1,-1,0,0};
int change(int maps[9][9],int color,int x,int y)
{
int tmp=maps[x][y];
maps[x][y]=color;
int sum=1;
for(int i=0;i<4;i++)
{
if(x+dx[i]>=0 && y+dy[i]>=0 &&
x+dx[i]<h... | 491 |
Project_CodeNet | 2,017 | /*
Identically Colored Panels Connection
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1174&lang=jp
*/
#include <iostream>
using namespace std;
int h,w,c;
int pre[8][8];
int p[8][8];
int ans[4][4][4][4];
// ???????????????
void adj(int x, int y, int c, int tc){
p[x][y] = c;
if(tc != c){
if(x ... | 850 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define SP <<" "<<
#define MOD 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
typedef long long LL;
typedef long double LD;
struct sta{
int x;
int y;
int d;
};
int main(){
while(1){
int h,w,c;
cin... | 559 |
Project_CodeNet | 2,012 | #include <iostream>
#include <queue>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
int f[10][10];
int h,w,c;
int ret=-1;
int dx[4] = {1,0,-1,0};
int dy[4] = {0,-1,0,1};
void pr(){
for(int i=1;i<=h;i++){
for(int j=1;j<=w;j++){
cout << f[i][j];
}
... | 577 |
Project_CodeNet | 2,015 | #include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
// #define LOG(...)
#define FOR(i, a, b) for(int i=(int)(a); i<(int)(b); ++i)
#define REP(i, n) for(int i=0; i<(int)(n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) (... | 598 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.