oj.uz

답안 #308763

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
308763 2020-10-01T21:24:03 Z nikatamliani Red-blue table (IZhO19_stones) C++14
0 / 100
 1 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;
int main() {
    int T = 1;
    cin >> T;
    while(T--) {
        int n, m, cntI = 0, best = 0;
        cin >> n >> m; 
        char ans[n + 1][m + 1];
        memset(ans, 0, sizeof ans);
        for(int i = 0; i <= n; ++i) {
            int sum = i * ((m + 1) / 2);
            int cnt_less = m - sum % m;
            int cnt_more = sum % m;
            int less = sum / n;
            int more = less + 1; 
            int rem = n * m - sum, now = i;
            int can = n / 2, have = n - can;
            sum = max(0, sum - can * m);
            now += m - (sum + have - 1) / have;
            if(best < now) {
                best = now, cntI = i;
            }
        }
        int prev = 1;
        for(int i = 1; i <= cntI; ++i) {
            int cnt = (m + 1) / 2;
            for(int j = prev; cnt--; j = (j == m ? 1 : j + 1)) {
                prev = j + 1;
                ans[i][j] = '+';
            }
        }
        cout << best << '\n';
        for(int i = 1; i <= n; ++i) {
            for(int j = 1; j <= m; ++j) {
                if(ans[i][j] != '+') {
                    cout << '-';
                } else {
                    cout << '+';
                }
            }
            cout << '\n';
        }
    }
}

Compilation message

stones.cpp: In function 'int main()':
stones.cpp:13:17: warning: unused variable 'cnt_less' [-Wunused-variable]
   13 |             int cnt_less = m - sum % m;
      |                 ^~~~~~~~
stones.cpp:14:17: warning: unused variable 'cnt_more' [-Wunused-variable]
   14 |             int cnt_more = sum % m;
      |                 ^~~~~~~~
stones.cpp:16:17: warning: unused variable 'more' [-Wunused-variable]
   16 |             int more = less + 1;
      |                 ^~~~
stones.cpp:17:17: warning: unused variable 'rem' [-Wunused-variable]
   17 |             int rem = n * m - sum, now = i;
      |                 ^~~

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 288 KB in the table A+B is not equal to 2

Subtask #2
0 / 10.0

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

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 288 KB in the table A+B is not equal to 2

Subtask #4
0 / 11.0

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

Subtask #5
0 / 15.0

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

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 288 KB in the table A+B is not equal to 2