oj.uz

답안 #1025326

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1025326 2024-07-16T20:02:54 Z hasan2006 Red-blue table (IZhO19_stones) C++17
27 / 100
 19 ms 7760 KB 
#include <bits/stdc++.h>

using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define se second
#define fi first
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 1e3 + 9 , mod = 1e9 + 7;
int a[N][N] , b[N] , dp[N] , c[N] , d[N][N] ;


void solve()
{
    ll n , q , i , j ,l ,r , x , y , s = 0 , f , k , m , mn = 1e18, mx = 0 ;
    cin>>n>>m;
    ll N = n, M = m;
    if(n < m)
        swap(n , m);
    for(i = 1; i <= n; i++)
        for(j = 1; j <= m; j++)
            a[i][j] = 0 ,b[i] = m ,  c[j] = 0;
    f =  n / 2 + 1;
    x = m / 2 - (m % 2 == 0) , y = 1;
    deque<int>v[M];
    for(i = 1; i <= n; i++){
        for(j = y; j < y + x; j++)
            a[i][j] = 1 , c[j]++ , b[i]-- , v[j].pb(i);
        if(c[y] >= f)
            y = y + x;
    }
    for(i = 1; i <= n; i++)
        for(j = 1; j <= m; j++)
            d[i][j] = a[i][j];
    for(i = 1; i <= n; i++)
        s += (b[i] > m / 2);
    for(i = 1; i <= m; i++)
        s += (c[i] > n / 2);
    i = 1;
    x = min(m - y + 1 , x);
    while(y <= m && f < c[y]){
        for(j = 1; j < y + x; j++)
            b[i] -= (d[i][j] == 0) , c[j] += (d[i][j] == 0) , d[i][j];
        l = y;
        for(j = 1; j < y; j++)
            if(v[j].size() && c[j] > f && v[j].back() > i){
                c[j]--;
                c[l]++;
                d[v[j].back()][j] = 0;
                d[v[j].back()][l] = 1;
                l++;
                v[j].pop_back();
                if(l == y + x)
                    l == y;
            }
        i++;
        y = y + x;
    }
    ll ans = 0;
    for(i = 1; i <= n; i++)
        ans += (b[i] > m / 2);
    for(i = 1; i <= m; i++)
        ans += (c[i] > n / 2);
    if(ans >= s){
        s = ans;
        for(i = 1; i <= n; i++)
            for(j = 1; j <= m; j++)
            a[i][j] = d[i][j];
    }
    cout<<s<<"\n";
    for(i = 1; i <= N; i++){
        for(j = 1; j <= M; j++){
            x = (N < M ? a[j][i] : 1 - a[i][j]);
            cout<<(x == 1 ? "+"  : "-");
        }
        cout<<"\n";
    }
}

int main(){
    TL;
    int t = 1;
    cin>>t;
    while(t--)
     {
        solve();
     }
}
// Author : حسن

Compilation message

stones.cpp: In function 'void solve()':
stones.cpp:55:69: warning: right operand of comma operator has no effect [-Wunused-value]
   55 |             b[i] -= (d[i][j] == 0) , c[j] += (d[i][j] == 0) , d[i][j];
      |                                                               ~~~~~~^
stones.cpp:66:23: warning: statement has no effect [-Wunused-value]
   66 |                     l == y;
      |                     ~~^~~~
stones.cpp:27:12: warning: unused variable 'q' [-Wunused-variable]
   27 |     ll n , q , i , j ,l ,r , x , y , s = 0 , f , k , m , mn = 1e18, mx = 0 ;
      |            ^
stones.cpp:27:26: warning: unused variable 'r' [-Wunused-variable]
   27 |     ll n , q , i , j ,l ,r , x , y , s = 0 , f , k , m , mn = 1e18, mx = 0 ;
      |                          ^
stones.cpp:27:50: warning: unused variable 'k' [-Wunused-variable]
   27 |     ll n , q , i , j ,l ,r , x , y , s = 0 , f , k , m , mn = 1e18, mx = 0 ;
      |                                                  ^
stones.cpp:27:58: warning: unused variable 'mn' [-Wunused-variable]
   27 |     ll n , q , i , j ,l ,r , x , y , s = 0 , f , k , m , mn = 1e18, mx = 0 ;
      |                                                          ^~
stones.cpp:27:69: warning: unused variable 'mx' [-Wunused-variable]
   27 |     ll n , q , i , j ,l ,r , x , y , s = 0 , f , k , m , mn = 1e18, mx = 0 ;
      |                                                                     ^~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4700 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Incorrect 2 ms 4700 KB Wrong answer in test 5 29: 31 < 32
5 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

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

Subtask #5
0 / 15.0

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

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Incorrect 2 ms 4700 KB Wrong answer in test 5 29: 31 < 32
5 Halted 0 ms 0 KB -