oj.uz

답안 #156379

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
156379 2019-10-05T11:56:53 Z ASDF123 Red-blue table (IZhO19_stones) C++14
0 / 100
 2000 ms 1656 KB 
#include <bits/stdc++.h>
//#define int long long
#define pii pair<int, int>
#define fr first
#define sc second
#define all(s) s.begin(), s.end()
#define szof(s) (int)s.size()
#define Ok puts("Ok")
using namespace std;

const int N = (int)1e3 + 5;
const int INF = 0x3f3f3f3f;
const int MOD = (int)1e9 + 9;

int tests = 1;
int n, m, ans;
char a[N][N], c[N][N];



inline void solve() {
  int n, m, ans = 0;
  cin >> n >> m;
  vector <pair<int, int>> row, col;

  if (m >= n) {
    ans = m;
    int can = n - (n / 2 + 1);
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        c[i][j] = '-';
      }
    }

    for (int j = 1; j <= m; j++) {
      col.push_back({j, can});
    }

    int need = m / 2 + 1;
    for (int i = 1; i <= n; i++) {
      if (col.empty() || col.size() < need) {
        break;
      }
      int cnt = 0;
      sort (all(col), [&](pii A, pii B) {
          return A.sc > B.sc;
        });
      for (int j = 0; j < need; j++) {
        if (col[j].sc) {
          cnt++;
        }
      }
      if (cnt == need) {
        ans++;
        for (int j = 0; j < need; j++) {
          c[i][col[j].fr] = '+';
          col[j].sc--;
        }
      } else {
        break;
      }

      while (col.back().sc == 0) {
        col.pop_back();
      }
    }
  }
  else {
    ans = n;
    int can = m - (m / 2 + 1);
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        c[i][j] = '+';
      }
    }

    for (int i = 1; i <= n; i++) {
      row.push_back({i, can});
    }

    int need = n / 2 + 1;
    for (int j = 1; j <= m; j++) {
      if (row.empty() || row.size() < need) {
        break;
      }

      int cnt = 0;
      sort (all(row), [&](pii A, pii B) {
        return A.sc > B.sc;
      });
      for (int i = 0; i < need; j++) {
        if (row[i].sc) {
          cnt++;
        }
      }
      if (cnt == need) {
        ans++;
        for (int i = 0; i < need; i++) {
          c[col[i].fr][j] = '-';
          row[j].sc--;
        }
      } else {
        break;
      }

      while (row.back().sc == 0) {
        row.pop_back();
      }
    }
  }

  printf("%d\n", ans);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      putchar(c[i][j]);
    }printf("\n");
  }
}

main() {
  cin >> tests;
  while (tests--) {
    solve();
  }
}

Compilation message

stones.cpp: In function 'void solve()':
stones.cpp:41:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       if (col.empty() || col.size() < need) {
                          ~~~~~~~~~~~^~~~~~
stones.cpp:83:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       if (row.empty() || row.size() < need) {
                          ~~~~~~~~~~~^~~~~~
stones.cpp: At global scope:
stones.cpp:120:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Execution timed out 2041 ms 376 KB Time limit exceeded

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2043 ms 256 KB Time limit exceeded

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Execution timed out 2041 ms 376 KB Time limit exceeded

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2019 ms 376 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 28 ms 1656 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Execution timed out 2041 ms 376 KB Time limit exceeded