제출 #246205

#제출 시각아이디문제언어결과실행 시간메모리
246205NightlightDango Maker (JOI18_dango_maker)C++14
100 / 100
971 ms54008 KiB
#include <bits/stdc++.h> using namespace std; const int MAXP = 12005; int N, M; vector<int> adj[MAXP]; char A[3005][3005]; int id[3001][3001]; int match[MAXP]; bitset<MAXP> vis; int ans = 0; int p; void edge(int u, int v) { // cout << u << " " << v << "\n"; adj[u].emplace_back(v); adj[v].emplace_back(u); } int kuhn(int u) { if(vis[u]) return 0; vis[u] = 1; for(int v : adj[u]) { if(match[v] == 0 || kuhn(match[v])) { match[u] = v; match[v] = u; return 1; } } return 0; } void maxmatch(int offset) { for(int i = 1, j = offset - 1; i <= offset; i++, j--) { if(i > N || j > M) continue; if(A[i][j] == 'R' && A[i + 1][j] == 'G' && A[i + 2][j] == 'W') { id[i][j] = ++p; id[i + 1][j] = p; id[i + 2][j] = p; } } for(int i = 1, j = offset - 1; i <= offset; i++, j--) { if(i > N || j > M) continue; if(A[i][j] == 'R' && A[i][j + 1] == 'G' && A[i][j + 2] == 'W') { p++; if(id[i][j]) edge(id[i][j], p); if(id[i][j + 1]) edge(id[i][j + 1], p); if(id[i][j + 2]) edge(id[i][j + 2], p); } } bool ok = 0; int cnt = 0; while(ok == 0) { ok = 1; vis = 0; for(int i = 1; i <= p; i++) { if(match[i] == 0 && kuhn(i)) { cnt++; ok = 0; } } } for(int i = 1; i <= p; i++) { adj[i].clear(); match[i] = 0; } ans += p - cnt; p = 0; } int main() { scanf("%d %d", &N, &M); for(int i = 1; i <= N; i++) { for(int j = 1; j <= M; j++) { scanf(" %c", &A[i][j]); } } for(int i = 2; i <= N + M; i++) maxmatch(i); printf("%d\n", ans); cin >> N; }

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

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:73:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &N, &M);
   ~~~~~^~~~~~~~~~~~~~~~~
dango_maker.cpp:76:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf(" %c", &A[i][j]);
       ~~~~~^~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...