oj.uz

답안 #246154

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
246154 2020-07-08T10:12:32 Z Nightlight Dango Maker (JOI18_dango_maker) C++14
0 / 100
 63 ms 71192 KB 
#include <bits/stdc++.h>
using namespace std;

int N, M;
vector<int> adj[3000001];
char A[3005][3005];
int id[3001][3001];
int match[3000001];
bitset<3000001> vis;
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;
}

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 = 1; i <= N; i++) {
    for(int j = 1; j <= M; j++) {
      if(A[i][j] == 'G') {
        if(A[i - 1][j] == 'R' && A[i + 1][j] == 'W') {
          id[i - 1][j] = ++p;
          id[i][j] = p;
          id[i + 1][j] = p;
        }
      }
    }
  }
  for(int i = 1; i <= N; i++) {
    for(int j = 1; j <= M; j++) {
      if(A[i][j] == 'R' && A[i][j + 1] == 'G' && A[i][j + 2] == 'W') {
        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;
      }
    }
  }
  printf("%d\n", p - cnt);
//  cin >> N;
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:32: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:35:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf(" %c", &A[i][j]);
       ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 71160 KB Output is correct
2 Correct 46 ms 71160 KB Output is correct
3 Correct 50 ms 71168 KB Output is correct
4 Correct 57 ms 71160 KB Output is correct
5 Correct 55 ms 71160 KB Output is correct
6 Incorrect 47 ms 71192 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 71160 KB Output is correct
2 Correct 46 ms 71160 KB Output is correct
3 Correct 50 ms 71168 KB Output is correct
4 Correct 57 ms 71160 KB Output is correct
5 Correct 55 ms 71160 KB Output is correct
6 Incorrect 47 ms 71192 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 71160 KB Output is correct
2 Correct 46 ms 71160 KB Output is correct
3 Correct 50 ms 71168 KB Output is correct
4 Correct 57 ms 71160 KB Output is correct
5 Correct 55 ms 71160 KB Output is correct
6 Incorrect 47 ms 71192 KB Output isn't correct
7 Halted 0 ms 0 KB -