結果
問題 | No.1266 7 Colors |
ユーザー | rniya |
提出日時 | 2020-10-23 23:35:07 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 174 ms / 3,000 ms |
コード長 | 3,949 bytes |
コンパイル時間 | 2,547 ms |
コンパイル使用メモリ | 206,704 KB |
実行使用メモリ | 17,556 KB |
最終ジャッジ日時 | 2023-09-28 18:50:34 |
合計ジャッジ時間 | 6,803 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 84 ms
6,008 KB |
testcase_04 | AC | 155 ms
13,064 KB |
testcase_05 | AC | 90 ms
6,468 KB |
testcase_06 | AC | 163 ms
14,140 KB |
testcase_07 | AC | 174 ms
15,692 KB |
testcase_08 | AC | 158 ms
13,336 KB |
testcase_09 | AC | 136 ms
11,004 KB |
testcase_10 | AC | 129 ms
10,160 KB |
testcase_11 | AC | 100 ms
7,532 KB |
testcase_12 | AC | 107 ms
8,332 KB |
testcase_13 | AC | 114 ms
9,108 KB |
testcase_14 | AC | 90 ms
6,472 KB |
testcase_15 | AC | 169 ms
15,904 KB |
testcase_16 | AC | 108 ms
8,580 KB |
testcase_17 | AC | 171 ms
15,256 KB |
testcase_18 | AC | 78 ms
17,556 KB |
testcase_19 | AC | 79 ms
17,144 KB |
testcase_20 | AC | 80 ms
17,224 KB |
testcase_21 | AC | 41 ms
4,376 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define LOCAL #pragma region Macros typedef long long ll; #define ALL(x) (x).begin(),(x).end() const long long MOD=1000000007; // const long long MOD=998244353; const int INF=1e9; const long long IINF=1e18; const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1}; const char dir[4]={'D','R','U','L'}; template<typename T> istream &operator>>(istream &is,vector<T> &v){ for (T &x:v) is >> x; return is; } template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){ for (int i=0;i<v.size();++i){ os << v[i] << (i+1==v.size()?"": " "); } return os; } template<typename T,typename U> ostream &operator<<(ostream &os,const pair<T,U> &p){ os << '(' << p.first << ',' << p.second << ')'; return os; } template<typename T,typename U> ostream &operator<<(ostream &os,const map<T,U> &m){ os << '{'; for (auto itr=m.begin();itr!=m.end();++itr){ os << '(' << itr->first << ',' << itr->second << ')'; if (++itr!=m.end()) os << ','; --itr; } os << '}'; return os; } template<typename T> ostream &operator<<(ostream &os,const set<T> &s){ os << '{'; for (auto itr=s.begin();itr!=s.end();++itr){ os << *itr; if (++itr!=s.end()) os << ','; --itr; } os << '}'; return os; } void debug_out(){cerr << '\n';} template<class Head,class... Tail> void debug_out(Head&& head,Tail&&... tail){ cerr << head; if (sizeof...(Tail)>0) cerr << ", "; debug_out(move(tail)...); } #ifdef LOCAL #define debug(...) cerr << " ";\ cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\ cerr << " ";\ debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;} template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;} template<class T1,class T2> inline bool chmin(T1 &a,T2 b){ if (a>b){a=b; return true;} return false; } template<class T1,class T2> inline bool chmax(T1 &a,T2 b){ if (a<b){a=b; return true;} return false; } #pragma endregion struct UnionFind{ int num; vector<int> par,rank; UnionFind(int n):num(n),par(n),rank(n,1){ iota(par.begin(),par.end(),0); } int root(int x){ return (par[x]==x?x:par[x]=root(par[x])); } bool merge(int x, int y){ x=root(x); y=root(y); if (x==y) return false; if (rank[x]<rank[y]) swap(x,y); par[y]=x; rank[x]+=rank[y]; --num; return true; } bool same(int x, int y){return root(x)==root(y);} int size(int x){return rank[root(x)];} int count(){return num;} }; int main(){ cin.tie(0); ios::sync_with_stdio(false); int N,M,Q; cin >> N >> M >> Q; vector<string> s(N); cin >> s; vector<vector<int>> G(N); for (int i=0;i<M;++i){ int u,v; cin >> u >> v; --u,--v; G[u].emplace_back(v); G[v].emplace_back(u); } auto id=[](int x,int y){return x*7+y;}; UnionFind UF(7*N); for (int i=0;i<N;++i){ for (int j=0;j<7;++j){ if (s[i][j]=='1'&&s[i][(j+1)%7]=='1'){ UF.merge(id(i,j),id(i,(j+1)%7)); } } } for (int v=0;v<N;++v){ for (int u:G[v]){ for (int j=0;j<7;++j){ if (s[v][j]=='1'&&s[u][j]=='1'){ UF.merge(id(v,j),id(u,j)); } } } } auto add=[&](int x,int y){ s[x][y]='1'; if (s[x][(y+6)%7]=='1') UF.merge(id(x,y),id(x,(y+6)%7)); if (s[x][(y+1)%7]=='1') UF.merge(id(x,y),id(x,(y+1)%7)); for (int u:G[x]){ if (s[u][y]=='1'){ UF.merge(id(x,y),id(u,y)); } } }; auto query=[&](int x){return UF.size(id(x,0));}; for (;Q--;){ int t,x,y; cin >> t >> x >> y; --x,--y; if (t==1) add(x,y); else cout << query(x) << '\n'; } }