oj.uz

답안 #919532

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
919532 2024-02-01T05:39:49 Z AnarTz Red-blue table (IZhO19_stones) C++17
0 / 100
 45 ms 2384 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;
int main() {
    long long t;
    cin >> t;

    while (t--) {
        int ans,n,m,i,j,maxl,addl,needed,check,q,w,plus;
        ans = 0;
        cin >> n >> m; 
        char table[n][m];
        bool bosoo;
        if (n>m)
        {
            maxl = n;
            addl = ((m-(m/2+1))*n)/(n/2+1);
            bosoo = true;
            memset(table,'+',sizeof table);
            needed = n/2+1;
        }else{
            maxl = m;
            addl = ((n-(n/2+1))*m)/(m/2+1);
            bosoo = false;
            memset(table,'-',sizeof table);
            needed = m/2+1;
        }
        ans = maxl + addl;
        cout << ans<<endl;
        check = needed*addl;
        q=0;
        w=0;
        
        while (check>0 && bosoo == false)
        {
            
            table[q][w]='+';
            w++;
            check--;
            plus++;
            if (plus==maxl/2+1)
            {
                q++;
                plus=0;
            }
            if (w==maxl)
            {
                w=0;        
            }
            
                
            
        }
        while (check>0 && bosoo == true)
        {
            
            table[w][q]='-';
            w++;
            check--;
            plus++;
            if (plus==maxl/2+1)
            {
                q++;
                plus=0;
            }
            if (w==maxl)
            {
                w=0;        
            }
            
                
            
        }













        for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cout << table[i][j] << ' ';
        }
        cout << '\n';
    }
        
        
        






















    }

    return 0;
}

Compilation message

stones.cpp: In function 'int main()':
stones.cpp:11:21: warning: unused variable 'i' [-Wunused-variable]
   11 |         int ans,n,m,i,j,maxl,addl,needed,check,q,w,plus;
      |                     ^
stones.cpp:11:23: warning: unused variable 'j' [-Wunused-variable]
   11 |         int ans,n,m,i,j,maxl,addl,needed,check,q,w,plus;
      |                       ^
stones.cpp:62:17: warning: 'plus' may be used uninitialized in this function [-Wmaybe-uninitialized]
   62 |             plus++;
      |             ~~~~^~

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 344 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 45 ms 2384 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 45 ms 2336 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Wrong answer
2 Halted 0 ms 0 KB -