oj.uz

Submission #162843

# Submission time Handle Problem Language Result Execution time Memory
162843 2019-11-10T06:11:58 Z abacaba Red-blue table (IZhO19_stones) C++14
11 / 100
 25 ms 4984 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;

#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ppb pop_back
#define ll long long
#define ull unsigned long long
#define cntbit(x) __builtin_popcount(x)
#define endl '\n'
#define uset unordered_set
#define umap unordered_map
#define pii pair<int, int>
#define ld long double
#define pll pair<long long, long long>

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];

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)
                a[i][j] = 1, ++red_in_row[i], ++red_in_col[j];
        for(int i = 2; i < n; i += 2)
            for(int j = 2; j <= m; j += 2)
                a[i][j] = 1, ++red_in_row[i], ++red_in_col[j];
        for(int j = 1; j <= m; ++j) {
            int cnt = 0;
            for(int i = 1; i <= n; ++i)
                if(red_in_row[i] * 2 <= m && (red_in_row[i] + 1) * 2 > m)
                    ++cnt;
            for(int i = 1; i <= n; ++i)
                if(cnt && 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];
                    --cnt;
                }
        }
        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:45:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
stones.cpp: In function 'int main()':
stones.cpp:46:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &t);
     ~~~~~^~~~~~~~~~
stones.cpp:54: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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Wrong answer in test 2 4: 2 < 4

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 504 KB Wrong answer in test 20 2: 19 < 20

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Wrong answer in test 2 4: 2 < 4

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 1748 KB Output is correct
2 Correct 24 ms 4216 KB Output is correct
3 Correct 23 ms 4984 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 1912 KB Wrong answer in test 24 24: 34 < 44
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Wrong answer in test 2 4: 2 < 4