oj.uz

답안 #162849

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
162849 2019-11-10T06:30:16 Z abacaba Red-blue table (IZhO19_stones) C++14
0 / 100
 25 ms 1912 KB 
#include <chrono>
#include <random>
#include <iostream>
#include <string>
#include <unordered_map>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio>
#include <stdio.h>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <deque>
#include <cassert>
#include <stack>
using namespace std;

const int mod = 1e9 + 7;
const int inf = 1e9;
const int N = 1e3 + 15;
int t, n, m, a[N][N];
int red_in_row[N], red_in_col[N];

inline void paint_odd() {
    for(int i = 2; i < n; i += 2)
        for(int j = 2; j <= m; j += 2)
            if(2 * (red_in_col[j] + 1) < n)
                a[i][j] = 1, ++red_in_row[i], ++red_in_col[j];
    for(int j = 1; j <= m; ++j)
        for(int i = 1; i <= n; ++i)
            if(red_in_row[i] * 2 <= m && (red_in_row[i] + 1) * 2 > m && !a[i][j])
                a[i][j] = 1, ++red_in_row[i], ++red_in_col[j];
}

inline void paint_even() {
    if(n >= m)
        for(int i = 1; i <= n; ++i)
            for(int j = 1; j <= m / 2 + 1; ++j)
                a[i][j] = 1, ++red_in_row[i], ++red_in_col[j];
    else
        for(int i = 1; i < (n + 1) / 2; ++i)
            for(int j = 1; j <= m / 2 + 1; ++j)
                a[i][j] = 1, ++red_in_row[i], ++red_in_col[j];
}

main() {
    scanf("%d", &t);
    while(t--) {
        int ans = 0;
        for(int i = 1; i <= n; ++i) {
            red_in_row[i] = 0;
            for(int j = 1; j <= m; ++j)
                a[i][j] = red_in_col[j] = 0;
        }
        scanf("%d %d", &n, &m);
        for(int i = 1; i < n; i += 2)
            for(int j = 1; j <= m; j += 2)
                if(2 * (red_in_col[j] + 1) < n)
                    a[i][j] = 1, ++red_in_row[i], ++red_in_col[j];
        paint_even();
        for(int i = 1; i <= n; ++i)
            ans += (2 * red_in_row[i] > m);
        for(int j = 1; j <= m; ++j)
            ans += (2 * red_in_col[j] < n);
        printf("%d\n", ans);
        for(int i = 1; i <= n; ++i, puts(""))
            for(int j = 1; j <= m; ++j)
                putchar(a[i][j] == 1 ? '+' : '-');
    }
    return 0;
}

Compilation message

stones.cpp:50:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
stones.cpp: In function 'int main()':
stones.cpp:51:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &t);
     ~~~~~^~~~~~~~~~
stones.cpp:59:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &n, &m);
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 17.0

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

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 504 KB in the table A+B is not equal to 34

Subtask #3
0 / 16.0

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

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 1808 KB Wrong answer in test 97 21: 107 < 116
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 1912 KB Wrong answer in test 24 24: 35 < 44
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

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