###ICPC国内予選 --- 順位表 http://icpc.logic.cs.tsukuba.ac.jp/standings/
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<bits/stdc++.h> | |
using namespace std; | |
#define MAX_N 100005 | |
#define MAX_M 100005 | |
int n,m,ans; | |
int x[MAX_M],y[MAX_M],w[MAX_M]; | |
vector<int> G[MAX_N]; | |
vector<int> g[MAX_N]; | |
vector<int> group[MAX_N]; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<bits/stdc++.h> | |
using namespace std; | |
typedef pair<int,int> P; | |
int h,w,n; | |
int ax,ay,bx,by; | |
struct segtree{ | |
bool check(set< P > &T,int a,int b){ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<bits/stdc++.h> | |
using namespace std; | |
int N,cc,t[2]; | |
bool visited[1005]; | |
char a[1005][1005]; | |
void dfs(int pos){ | |
if(visited[pos])return; | |
visited[pos]=true; | |
cc++; | |
for(int i=0;i<N;i++) |
OlderNewer