Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,013 | #include<iostream>
#include<vector>
#include<stack>
#include<utility>
using namespace std;
vector< vector<bool> > getunion(const vector< vector<int> >& base){
vector< vector<bool> > ret;
stack< pair<int,int> > nxt;
int xmax=base[0].size();
int ymax=base.size();
int tar=base[0][0];
int curx,cury;
ret.resize(ymax... | 687 |
Project_CodeNet | 2,012 | #include <iostream>
#include <algorithm>
using namespace std;
int data[8][8], odr[5], h, w, c, dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1}, tmp[8][8];
bool vis[8][8];
bool check(int y, int x){
if(y<0 || y>=h) return false;
if(x<0 || x>=w) return false;
return true;
}
void dfs(int y, int x, int p, int s){
vis... | 632 |
Project_CodeNet | 2,016 | #include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<((int)(n));i++)
#define reg(i,a,b) for(int i=((int)(a));i<=((int)(b));i++)
#define... | 611 |
Project_CodeNet | 2,015 | #include <iostream>
#include <queue>
using namespace std;
int h,w,c;
int dis[10][10];
int ans;
int count;
struct po{
int mp[10][10];
};
struct xy{
int x,y;
};
void deb(po t) {
for(int i=0;i<h;i++){
for(int j=0;j<w;j++)
cout << t.mp[i][j] << " ";
cout << endl;
}
cout <<"-----------------"<<endl... | 689 |
Project_CodeNet | 2,014 | #include <stdio.h>
#include <iostream>
#include <stack>
using namespace std;
#define max(a,b)(a>b?a:b)
struct POINT{
int x;
int y;
int c;
POINT(int X,int Y,int C){
x = X;y = Y;c=C;
}
};
stack<POINT> st;
int h,w,c;
int panel[8][8][2]={0};
int ans=0;
void show(int ans){
cout << "--- panel contents"<<endl;... | 1,033 |
Project_CodeNet | 2,012 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int DR[] = {-1, 0, 1, 0};
const int DC[] = {0, -1, 0, 1};
int paint(vector<vector<int> > &field, vector<vector<int> > &visited, int r, int c, int color) {
const int H = field.size();
const int W = field[0].size();
visit... | 546 |
Project_CodeNet | 2,012 | #include <iostream>
#include <vector>
using namespace std;
int paint(vector< vector<int> > &field, int x, int y, int c){
int W = field[0].size(), H = field.size();
if(x < 0 || x >= W || y < 0 || y >= H || field[y][x] != c){ return 0; }
field[y][x] = -1;
int count = 1;
count += paint(field, x - 1, y, c);
count +... | 539 |
Project_CodeNet | 2,016 | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#define REP(i,n) for(int i=0;i<(n);i++)
using namespace std;
const int dx[4] = {1,-1,0,0};
const int dy[4] = {0,0,1,-1};
const int NUMC = 6;
int h,w,c;
vector<vector<int> > mp;
int dfs(int def_i,int def_j,int depth,int col){
if(col == mp[def... | 666 |
Project_CodeNet | 2,018 | //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <... | 1,047 |
Project_CodeNet | 2,011 | #include <cstring>
#include <iostream>
#include <queue>
using namespace std;
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
int h, w, c;
int panel[8][8];
class node {
public:
int panel[8][8], tmpPanel[8][8];
int d;
int area;
node(int src[8][8]){
memcpy(panel, src, sizeof(panel));
memcpy(tmpPanel, panel, s... | 812 |
Project_CodeNet | 2,013 | #include<iostream>
#include<cstring>
#include<queue>
#include<map>
#include<vector>
using namespace std;
#define fr first
#define sc second
typedef pair<string,int> P;
int h,w,c,ans,d[]={0,1,0,-1},cnt;
bool used[8][8];
vector<vector<int> > kgym_map;
void kgym_cnt(int x,int y){
used[x][y] = true;
cnt++;
for(int i ... | 545 |
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,019 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,b,e) for(int i=(b);i<(e);++i)
#define rep(i,e) for(int i=0;i<(e);++i)
struct UnionFind{
vector<int> par;
vector<int> rank;
vector<int> sizes;
UnionFind(int n) : par(n, -1), rank(n, 0), sizes(n, 1){}
int find(int x){
if(par[x] < 0) return x;
... | 734 |
Project_CodeNet | 2,017 | #include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<functional>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<utility>
#include<sstream>
#include<complex>
#include<fstream>
#include<bitset>
#include <iostream>
using namespace std;
ty... | 876 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
int H, W, C, ans, cnt;
const int dx[] = {-1,0,0,1};
const int dy[] = {0,-1,1,0};
bool used[8][8];
typedef pair<int,int> P;
bool inField(int y, int x){
return 0 <= y && y < H && 0 <= x && x < W;
}
void color_count(vector<vector<int> > &vec, int y, int x){
if(... | 724 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#define reps(i,j,k) for(int i=(j); i<(k); i++)
#define rep(i,j) reps(i,0,j)
#define fs first
#define fr fs
#define sc second
#define pb push_back
#define mk make_pair
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
int h,w,c;
int inp[9][9], bd[1... | 716 |
Project_CodeNet | 2,014 | #include <bitset>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <iostream>
#define VARIABLE(x) cerr << #x << "=" << x << endl
#define BINARY(x) cerr << #x << "=" << static_cast<b... | 854 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define INF 1e9
int di[4] = {0, -1, 0, 1};
int dj[4] = {1, 0, -1, 0};
int temp, h, w, from, to, c;
void count(int i, int j, vector<vector<int> >& b, int& temp){
temp++;
b[i][j] = -1;
for(int l = 0; l < 4; l++){
int ni = i + di[l];
int nj = j + ... | 992 |
Project_CodeNet | 2,017 | #include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
typedef long long int ll;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000001
using namespace std;
int H,W,C,diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};
struct Info... | 1,423 |
Project_CodeNet | 2,012 | #include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int n, m, c;
int p[16][16], f[16][16];
int a[16], vis[16][16];
void draw(int x, i... | 545 |
Project_CodeNet | 2,013 | #include <iostream>
#include <map>
#include <queue>
#include <algorithm>
using namespace std;
typedef pair<int,int> P;
struct state{
int table[8][8];
};
int h,w,c;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int change(state tmp,int num,int col){
int cmax=0;
if(num==5){
if(col==c){
queue<P> q;
int count=0;... | 505 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int c;
int ans;
void dfs(int n, vector<vector<int>> grid){
int x = (int)grid.size();
int y = (int)grid[0].size();
vector<vector<bool>> connect(x, vector<bool>(y, false));
queue<P> que;
connect[0][0] = true;
que.push({0, 0})... | 1,054 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <stack>
#include <vector>
using namespace std;
int main()
{
while (true) {
int h;
int w;
int c;
scanf("%d %d %d", &h, &w, &c);
if (h == 0 && w == 0 && c == 0) {
break;
}
vector<vector<int>> cp;
cp.resize(h);
... | 978 |
Project_CodeNet | 2,013 | #include <iostream>
#include <cstdio>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <cctype>
#include <complex>
#include <string>
#include <sstream>
using n... | 912 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::nu... | 787 |
Project_CodeNet | 2,014 | #include<iostream>
#include<stack>
#include<vector>
using namespace std;
#define MAX 8
struct S{
int field[MAX][MAX];
int cnt;
};
struct S2{
int x, y;
};
int main(){
int h, w, c;
S panel,tmp;
stack<S> sv;
S2 point,tmp2;
stack<S2> n;
int color;
int dx[] = { 0, 0, 1, -1 };
int dy[] = { 1, -1, 0, 0 };
i... | 724 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll ,P> P3;
typedef pair<P ,P> PP;
const ll MOD = 998244353;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(1e6 + 5);
const double EPS = 1e-6;
const int di... | 1,006 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
using namespace std;
typedef long... | 727 |
Project_CodeNet | 2,015 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#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>
#includ... | 1,291 |
Project_CodeNet | 2,011 | #include <iostream>
#include <vector>
#include <queue>
#include <cstring>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> P;
#define REP(i,n,m) for(int i=n;i<m;i++)
#define rep(i,n) REP(i,0,n)
int h,w,c;
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
int area(vvi &v){
int... | 580 |
Project_CodeNet | 2,015 | #include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<string>
#include<cmath>
#include<cstdint>
//#include<>
using namespace std;
typedef vector< vector<int> > Mat;
typedef pair<int,int> pii;
typedef int64_t i64;typedef int32_t i32;
typedef... | 776 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
typedef vector<vector<int> > vvi;
typedef pair<int, int> P;
int h, w, c;
vector<vector<int> > p;
int dy[4] = {1, -1 ,0, 0};
int dx[4] = {0, 0, 1, -1};
bool contain(int y, int x){
return (0 <= y && y < h && 0 <= x && x < w... | 653 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, a, n) for(int i=(a); i<(n); i++)
int h, w, c;
int p[10][10];
int q[10][10];
bool visited[10][10];
void change(int i, int j, int c) {
if(visited[i][j]) return;
visited[i][j] = true;
if(i>0 && q[i-1][j]==q[i][j]) c... | 637 |
Project_CodeNet | 2,014 | #include <bits/stdc++.h>
using namespace std;
int H, W, C, ans, cnt;
const int dx[] = {-1,0,0,1};
const int dy[] = {0,-1,1,0};
bool used[8][8];
typedef pair<int,int> P;
bool inField(int y, int x){
return 0 <= y && y < H && 0 <= x && x < W;
}
void color_count(vector<vector<int> > &vec, int y, int x){
if(used[y][... | 743 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
struct data{
int panel[8][8];
bool check[8][8];
int count;
};
int h,w,c;
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
void DFS(data& d,int x,int y, const int color, const int base_color){
d.panel[y][x] = color;
for(int i=0; i<4; i++){
if(x... | 721 |
Project_CodeNet | 2,015 | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
using namespace std;
typedef pair<int, int> P;
int vx[]={1,0,-1,0}, vy[]={0,1,0,-1};
// ??¶???????????????????§???????
struct status{
int count, to;
int p[10][10];
status(int c=0, int t=0, status *old=NULL){ //???????????????????????§??¨... | 787 |
Project_CodeNet | 2,012 | #include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
using namespace std;
#define FOR(i,k,n) for(int i=(k); i<(int)n; +... | 848 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
struct S {
int p[8][8];
S() { fill_n((int*)p, 8 * 8, -1); }
// bool operator < (const S &s) const {
// for (int i = 0; i < 8; i++) {
// for (int j = 0; j < 8; j++) {
// if (p[i][j] != s.p[i][j]) retu... | 693 |
Project_CodeNet | 2,013 | #include <iostream>
#include <string.h>
#define loop(x) for(int x=1;x<=6;x++)
using namespace std;
void change(int[10][10],int,int,int);
int count(int[10][10],int,int);
int main(void){
for(int h,w,c;cin >> h >> w >> c,h||w||c;){
int fld[10][10]={0};
int max=0,tmp;
for(int i=1;i<=h;i++)
for(int j=1;j<=w;j... | 586 |
Project_CodeNet | 2,014 | #include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
using namespace std;
#define INF 100000000
#define... | 900 |
Project_CodeNet | 2,013 | #include<iostream>
using namespace std;
#define REP(i,b,e) for ( int i = b; i < e; i++)
#define rep(i,n) REP(i,0,n)
static const int MAX = 10;
static const int di[4] = {0, -1, 0, 1};
static const int dj[4] = {1, 0, -1, 0};
int H, W, C, G[MAX][MAX], V[MAX+2][MAX];
int cnt, ans;
void init(){
REP(i, 1, H+1) REP(j, 1,... | 498 |
Project_CodeNet | 2,014 | #include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
int panel[6][8][8];
int h,w,c;
int counting;
int maximum;
int ans;
void roll(int num,int x,int y,int a){
int dx[]={0,0,-1,1};
int dy[]={-1,1,0,0}... | 776 |
Project_CodeNet | 2,014 | #include <iostream>
#include <cstdio>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#include <complex>
#include <map>
#include <climits>
using namespace std;
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#d... | 771 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#define REP(i,n) for(long long i=0;i<n;++i)
#define REPR(i,n) for(long... | 902 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mkp make_pair
int H,W,C;
int P[10][10];
int ans;
void draw(int col){
int tar=P[0][0];
bool used[10][10]={};
queue<pair<int,int>> Q;
Q.push(mkp(0,0));
used[0][0]=true;
while(!Q.empty()){
int x,y;
tie(x... | 832 |
Project_CodeNet | 2,011 | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAX_WID = 8;
int W, H, C;
int board[MAX_WID][MAX_WID];
int dx[] = {0,0,1,-1};
int dy[] = {1,-1,0,0};
int count(int y, int x){
int ret = 0;
if(board[y][x] == C){
board[y][x] = 0;
ret++;
}
for(int k=0; k<4; k++){
int ny ... | 500 |
Project_CodeNet | 2,013 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int dx[4] = {0,-1,1,0};
int dy[4] = {-1,0,0,1};
int w,h,c,ans,color_cnt;
int colorConut(const vector<vector<int> >& a){
int s=0;
for(int y=0 ; y < h ; y++ ){
for(int x=0 ; x < w ; x++ ){
if( a[y][x] == -1 ) s++;
}
}
return s;
}... | 518 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max()/2;
const int MOD = 1e9+7;
int h,w,c;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int count(vector<vector<int>> &v){
int res=0;
queue<P> q;
q.push(P... | 592 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <ra... | 1,553 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0,i##_cond=(n);i<i##_cond;++i)
#define FOR(i,a,b) for(int i=(a),i##_cond=(b);i<i##_cond;++i)
int h,w,c;
vector<int> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
bool isin(int x, int y){
bool ans;
if(0 <= x and x < h and 0 <= y and y < w) ans = tru... | 472 |
Project_CodeNet | 2,015 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <cstring>
#include <cmath>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define reps(i,s,n) for(int i=s; i<n; i++)
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef unsigned long long ... | 732 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
int h, w, color;
int ps[256];
void fill(int r, int c, int p, int xs[256], int y) {
int i = (r << 4) | c;
if( xs[i] != p ) return;
xs[i] = y;
int dr[4] = {1, 0, -1, 0};
int dc[4] = {0, 1, 0, -1};
for(int k = 0; k < 4; ++k) {
int nr = r + dr[k];
int nc = c + dc[k];
if( n... | 704 |
Project_CodeNet | 2,018 | // clang-format off
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)... | 1,058 |
Project_CodeNet | 2,013 | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
int h,w,c,grid[8][8];
bool vis[8][8];
int Count(int x,int y, int col){
int cnt=1;
vis[y][x]=true;
rep(i,4){
int nx=x+dx[i],ny=y+dy[... | 464 |
Project_CodeNet | 2,013 | #include <iostream>
#include <queue>
#define MAX_N 8
#define MAX_M 8
#define MAX_C 6
#define INF 1000000
using namespace std;
int N, M, C, ans = 1, nd, flag = 0;
int field[MAX_N][MAX_M], d[MAX_N][MAX_M], dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
class Graphs
{
public:
int g[MAX_N][MAX_M];
int sum;
int node;
i... | 1,003 |
Project_CodeNet | 2,012 | #include<iostream>
#include<algorithm>
using namespace std;
int h,w,c;
int p[10][10];
int dfs(int y,int x,int prv,int nx){
p[y][x] = nx;
int dy[] = {-1,0,1,0}, dx[] = {0,1,0,-1};
int res = 0;
for(int i=0;i<4;i++){
int ty = y+dy[i], tx = x+dx[i];
if(ty<0 || tx<0 || h<=ty || w<=tx)continue;
if(p[ty... | 395 |
Project_CodeNet | 2,016 |
#include <iostream>
#include <vector>
#include <math.h>
#include <iomanip>
#include <queue>
#include <stack>
#include <utility>
using namespace std;
typedef vector<vector<int>> mat;
typedef pair<int,int> pii;
typedef vector<int> vi;
vector<pii> d(4);
int solve();
int getCols( const int target, const mat & m );
void... | 988 |
Project_CodeNet | 2,018 | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | 925 |
Project_CodeNet | 2,017 | #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
typedef pair<int,int> pii;
int h, w, c;
vector<vector<int> > p;
int merged[8][8];
bool check[8][8];
int dfs(int i, int j) {
if(check[i][j]) return 0;
int res = 0;
check[i][j] = true;
res++;
int dxy[] = {1,0,-1,0... | 896 |
Project_CodeNet | 2,015 | //同じ連結成分を違う色で塗る工程は、bfsでできるが、実装は
//連結成分を列挙し終えてから新しい色を塗ったほうが、連結成分を列挙中に新しい色を塗っていくよりも断然楽。
#include<iostream>
#include<cstdio>
#include<queue>
using namespace std;
class Input {
public:
int h, w, aimColor;
int colors[64]; //color[i*w + j] = i行j列の色
bool input(FILE *fp) {
fscanf(fp, "%d%d%d", &h, &w, &aimColor);
if ... | 818 |
Project_CodeNet | 2,017 | #include <iostream>
#include <stack>
#include <algorithm>
#include <vector>
constexpr int NUM = 1 << (3*4);
int panel[8][8] = {0};
int w, h, c;
int dx[] = { 1, 0, -1, 0 }, dy[] = { 0, 1, 0, -1 };
int changeColor(int colors) {
int newPanel[8][8];
int colorCount = 1;
for (int i = 0; i < h; i++) for (int j = 0; j < w... | 679 |
Project_CodeNet | 2,016 | #include<iostream>
#include<queue>
using namespace std;
int x[10][10], y[10][10], z[10][10], p[6] = { 1,6,36,216,1296,7776 };
int a[6], H, W, C, cnt, res; queue<pair<int, int>>Q;
void h(int A, int B, int C) { if (z[A][B] == 0 && y[A][B] == C) { z[A][B] = 1; Q.push(make_pair(A, B)); } }
int main() {
while (true) {
fo... | 815 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
struct UnionFind{
// 頂点数(1-indexed)
const int V;
// par[x]:=xのroot
vector<int> par;
// sz[x]:=xを含む集合のサイズ
vector<int> sz;
UnionFind(const int V):V(V){
par.resize(V+1);
for(int i=0;i<=V;i++) par[i]=i;
sz.resize(V+1,1);
... | 853 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int h, w, c;
int ans, a, counta;
vector<vector<int>> p;
vector<vector<int>> check(vector<vector<int>> tmp, int i, int j, int color, int nowcolor){
tmp[i][j] = color;
counta++;
if(i != 0){
if(tmp[i - ... | 549 |
Project_CodeNet | 2,016 | #include<iostream>
#include<queue>
#include<utility>
#include<algorithm>
#define FOR(i,s,e) for(int i=(s);i<(e);i++)
using namespace std;
int h,w,c;
int ans;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool canmove(int x,int y){
return (0 <= x && x < w && 0 <= y && y < h);
}
void copy(int from[8][8],int to[8][8]){... | 611 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int)(N);i++)
#define ck(n,a,b) ((a)<=(n)&&(n)<(b))
#define p(s) cout<<(s)<<endl
#define F first
#define S second
typedef long long ll;
using namespace std;
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
int H, W, C, P[10][10];
int tans = 0, ans = 0;
bool fl... | 659 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define re... | 850 |
Project_CodeNet | 2,014 | #include<cstdio>
#include<queue>
#include<stack>
#include<algorithm>
#include<iostream>
#include<vector>
using namespace std;
#define rep(i,a,b) for(int (i)=(a);(i)<(b);i++)
int h, w,c;
int max_n = 0;
struct Area{ int c, f; };
Area area[8][8] = { 0 };
typedef pair <int,int>P;
void solve(int cr, int level){
queue<P> ... | 778 |
Project_CodeNet | 2,013 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=... | 702 |
Project_CodeNet | 2,019 | #define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
... | 957 |
Project_CodeNet | 2,012 | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include... | 875 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#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(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
u... | 827 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? 1e9:1e18)
#... | 704 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdlib>
// #define DEBUG
using namespace std;
int h, w, c;
int p[9][9];
void Coloring(int y, int x, int c, bool checked[9][9]) {
if (checked[y][x]) {
return;
}
int dy[] = { -1, 0, 1, 0 };
int dx[] = { 0, 1, 0, -1};
int ret = 0;
... | 855 |
Project_CodeNet | 2,015 | #include <bits/stdc++.h>
using namespace std;
int h, w, c;
bool isIn(int x, int y){
return 0 <= x && x < h && 0 <= y && y < w;
}
int change(int n, int color, vector<vector<int> > field){
vector<pair<int, int> > samecolor;
samecolor.push_back(make_pair(0, 0));
while(1){
vector<pair<int, int>... | 579 |
Project_CodeNet | 2,013 | #include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int h, w, c;
int ans = 0;
int pc = 0;
vector< vector<int> > cp;
int flag = 0;
void change(vector< vector<int> > &p, int color, int y, int x, int tmp) {
p[y][x] = color;
if(x+1 < w) if(tmp == p[y][x+1])
change(p, color, y, x+1, tmp);
... | 832 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int h,w,c;
int dy[4]={-1,1,0,0},dx[4]={0,0,-1,1};
vector<vector<int>> tile(10,vector<int>(10));
int BFS(vector<vector<int>> &T, int color){
queue< pair<int,int> > Q;
Q.push({0,0});
vector<vector<bool>> visited(10,vector<bool>(10));
visited[0][0]=1;
int cnt=1;
while... | 458 |
Project_CodeNet | 2,016 | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
... | 589 |
Project_CodeNet | 2,016 | #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long l... | 663 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int h, w, c;
int p[10][10];
bool used[10][10];
int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
int dfs2(int x, int y, int c, int nc, int p[10][10])
{
used[x][y] = true;
p[x][y] = nc;
int nx, ny, ret = 1;
for(int i = 0; i < 4; i++){
nx = x + dx[i], ny = y + dy[i];
if(n... | 522 |
Project_CodeNet | 2,019 | #include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip... | 1,904 |
Project_CodeNet | 2,016 | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int H, W, c, a[9][9], b[9][9], g[6][9][9], v[9][9];
int dx[4] = { 1, 0, -1, 0 }, dy[4] = { 0, 1, 0, -1 };
int rec1(int x, int y) {
int ret = 1; v[y][x] = 1;
for (int i = 0; i < 4; i++) {
int tx = x + dx[i], ty = y + dy[i];
if (0 <= tx ... | 663 |
Project_CodeNet | 2,012 | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>
#include<stack>
using name... | 799 |
Project_CodeNet | 2,012 | #include <cstdio>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#include <algorithm>
using namespace std;
typedef pair<int, int> P;
int field[10][10];
int H, W, C;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, -1, 0, 1};
int count_field() {
int c = field[1][1];
bool visit[10][10];
fill(... | 1,020 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=(a);i<(b);++i)
int h, w, c;
const int dx[4] = {0,-1,0,1};
const int dy[4] = {-1,0,1,0};
bool in_range(int x, int y) { return 0 <= x && x < w && 0 <= y && y < h; }
int countDFS(vector< vector< int > >& p, int x, int y, int cur) {
p[y][x] = ... | 525 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
const int THUNDER=5;
int h,w,c;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
bool isrange(int x,int y){return 0<=x && x<h && 0<=y && y<w;}
int elec(int time,vector<vector<int>> p){
if(time==THUNDER){
queue<pair<int,int>> que;
int color=p[0][0];
if(color!=c) r... | 554 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int h,w,c;
int search_union(vector<int> panels){
stack<int> s;
int color=panels[0];
vector<int> visited(h*w);
int cnt=1;
s.push(0);
while(!s.empty()){
int v=s.top();
s.pop();
int y=v/w,x=v%w;
visited[... | 654 |
Project_CodeNet | 2,018 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vs=vector<string>;
using msi=map<string,int>;
using mii=map<int,int>;
using psi=pair<string,int>;
using pii=pair<int,int>;
using vlai=valarray<int>;
#define rep(i,n) for(int i=0;i<n;i++)
#define range(i... | 728 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
#define INF 1000000010
#define EPS 1e-9
#define F first
#define S second
#define debug(x) cout<<x<<endl;
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define lp(i,n) repi(i,0,n)
#define repn(i,n) for(in... | 841 |
Project_CodeNet | 2,018 | #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,017 | #include <bits/stdc++.h>
#define rep(i, from, to) for (int i = from; i < to; ++i)
#define REP(i, from, to) for (int i = from; i <= to; ++i)
using namespace std;
typedef pair<int, int> P;
int data[9][9];
queue<P> que;
int dx[] = {-1, 0,1, 0};
int dy[] = {0, -1, 0, 1};
int x, y;
int datax, datay, endC;
void pData(int... | 1,252 |
Project_CodeNet | 2,012 | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
int H, W;
vector<pair<int,int> > bfs(const int grid[8][8])
{
int dist[8][8];
for (int i = 0; i < H; i++) {
fill_n(dist[i], W, 0);
}
dist[0][0] = true;
queue<pair<int,int> > q;
q.push(make_pair(0, 0));
co... | 593 |
Project_CodeNet | 2,016 | #include<iostream>
#include<vector>
#include<map>
#include<queue>
using namespace std;
typedef pair<int,int> i_i;
int o,h,w,c;
void rec(int st[8][8],int d){
if(d==5){
queue<i_i> q;
vector<i_i> v;
int u[8][8]={{}};
i_i p,b;
p.first=0;p.second=0;
if(st[p.first][p.second]==c) q.push(p);
u[p.f... | 754 |
Project_CodeNet | 2,017 | /*
2017_02_27_AC
??????????????????
????????°??¢??°??§?????????????????°???????????¨????????????????§???????????????????
????????????????????¨?????§??????????????£??????????????¶???????????£????????????????????????
??????????????????dfs()?????§paint()????????¶?????????paint()???????????????????????¨???
????????????????... | 1,197 |
Project_CodeNet | 2,013 | #include <iostream>
using namespace std;
int panel[8][8];
int check[8][8][6];
int h,w,c,color,cnt_max;
int change( int mae, int ato, int x ) {
for( int i = 0; i < h; i++ ) {
for ( int j = 0; j < w; j++ ) {
if ( check[j][i][x] == mae ) check[j][i][x] = ato;
}
}
return 0;
}
int changep( int x, int ... | 1,024 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n, m) for (int i = (int) (n) ; i < (int) (m); i++)
using namespace std;
vector<vector<int>> v;
int h, w, c;
bool init() {
v.clear();
cin >> h >> w >> c;
if (h == 0) return false;
v.resize(h, vector<int>(w));
rep(i, h... | 597 |
Project_CodeNet | 2,015 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begin(),X.end()
#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 pb push_back
#define pii pair<int,int>
#define mp make_... | 804 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define chmin(a, b) ((a)=min((a), (b)))
#define chmax(a, b) ((a)=max((a), (b)))
#define fs first
#define sc second
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
const ll MOD=1e9+7;
const ll INF=1e18;
int dx[]={... | 910 |
Project_CodeNet | 2,019 | #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>... | 868 |
Project_CodeNet | 2,016 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#define int long long
#define MOD7 1000000007
#define... | 714 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.