제출 #367756

#제출 시각아이디문제언어결과실행 시간메모리
367756arnold518Paint (COI20_paint)C++14
0 / 100
129 ms50088 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int MAXN = 200000; const int dy[] = {-1, 1, 0, 0}; const int dx[] = {0, 0, -1, 1}; int N, M, Q; vector<vector<int>> A; int f(int y, int x) { return x+(y-1)*M; } int C[MAXN+10]; struct Data { int y, x, c; }; Data B[MAXN+10]; set<int> adj[MAXN+10]; int par[MAXN+10]; int Find(int x) { if(x==par[x]) return x; return par[x]=Find(par[x]); } void Union(int x, int y) { x=Find(x); y=Find(y); if(adj[x].size()>adj[y].size()) swap(x, y); for(auto it : adj[x]) { int t=Find(it); if(t==y) continue; adj[y].insert(t); } par[x]=y; } int main() { scanf("%d%d", &N, &M); A=vector<vector<int>>(N+10, vector<int>(M+10)); for(int i=1; i<=N; i++) { for(int j=1; j<=M; j++) { scanf("%d", &A[i][j]); } } for(int i=1; i<=N*M; i++) par[i]=i; for(int i=1; i<=N; i++) { for(int j=1; j<=M; j++) { if(i!=N) { if(A[i][j]!=A[i+1][j]) { adj[f(i, j)].insert(f(i+1, j)); adj[f(i+1, j)].insert(f(i, j)); } } if(j!=M) { if(A[i][j]!=A[i][j+1]) { adj[f(i, j+1)].insert(f(i, j)); adj[f(i, j)].insert(f(i, j+1)); } } } } for(int i=1; i<=N; i++) for(int j=1; j<=M; j++) C[f(i, j)]=A[i][j]; for(int i=1; i<=N; i++) { for(int j=1; j<=M; j++) { if(i!=N) { if(A[i][j]==A[i+1][j]) { Union(f(i, j), f(i+1, j)); } } if(j!=M) { if(A[i][j]==A[i][j+1]) { Union(f(i, j), f(i, j+1)); } } } } scanf("%d", &Q); for(int i=1; i<=Q; i++) { scanf("%d%d%d", &B[i].y, &B[i].x, &B[i].c); } for(int i=1; i<=Q; i++) { int v=Find(f(B[i].y, B[i].x)); if(C[v]==B[i].c) continue; queue<int> QQ; int col=C[v]; C[v]=B[i].c; while(!QQ.empty()) { int now=QQ.front(); QQ.pop(); for(auto nxt : adj[now]) { nxt=Find(nxt); if(C[nxt]==col) { C[nxt]=B[i].c; Union(nxt, now); QQ.push(nxt); } } } } for(int i=1; i<=N; i++) { for(int j=1; j<=M; j++) { printf("%d ", C[Find(f(i, j))]); } printf("\n"); } }

컴파일 시 표준 에러 (stderr) 메시지

paint.cpp: In function 'int main()':
paint.cpp:51:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   51 |  scanf("%d%d", &N, &M);
      |  ~~~~~^~~~~~~~~~~~~~~~
paint.cpp:58:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   58 |    scanf("%d", &A[i][j]);
      |    ~~~~~^~~~~~~~~~~~~~~~
paint.cpp:108:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  108 |  scanf("%d", &Q);
      |  ~~~~~^~~~~~~~~~
paint.cpp:111:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  111 |   scanf("%d%d%d", &B[i].y, &B[i].x, &B[i].c);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...