oj.uz

Submission #1108148

# Submission time Handle Problem Language Result Execution time Memory
1108148 2024-11-03T03:30:24 Z kuka_123 Red-blue table (IZhO19_stones) C++14
54 / 100
 24 ms 2128 KB 
  /*Bismillahir Rahmanir Raheem*/
#include <bits/stdc++.h>
  
using namespace std;
 
#define kuka ios::sync_with_stdio(false);cin.tie(0), cout.tie(0);
#define pb push_back
#define sz(x) x.size()
#define all(x) x.begin(), x.end()
#define FOR(n) for(int i = 0; i < n; i++)
#define ff(x, y) for( int y = 0; y < x; y++)
#define fff(x, y) for( int y = x; y <= 0; y--)
#define F first
#define S second
#define int long long  
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const ll INF = LLONG_MAX;
const int inf = INT_MAX;
const double PI = acos(-1);
const int N = 1002;
const int MOD = 1e9 ;	 
 
char a[N][N];
int col[N];
 
void oyan(){
	int n, m, ans = 0;
    cin >> n >> m;
    if (n > m) {
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= m; ++j) {
                a[i][j] = '+';
            }
            col[i] = (m - 1) / 2;
        }
	    ans = n;
	    for (int j = 1; j <= m; ++j) {
		    int cnt = 0;
		    if (j % 2 == 0) {
		        for (int i = 1; i <= n; ++i) {
		            if (cnt > n / 2) {
		                ans++;cnt = 0;
		                break;
		            }
		            if (col[i] != 0) {
		                col[i]--;
		                a[i][j] = '-';
		                cnt++;
		            }
		        }
		    } else {
		        for (int i = n; i >= 1; --i) {
		            if (cnt > n / 2) {
		                ans++;cnt = 0;
		                break;
		            }
		            if (col[i] != 0) {
		                col[i]--;
		                a[i][j] = '-';
		                cnt++;
		            }
		        }
		    }
		    if (cnt > n / 2) {
	           ans++;
		    }
		}
    }  else if(n < m){
    	for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= m; ++j) {
                a[i][j] = '-';
                col[j] = (n - 1) / 2;
            }
        }
	    ans = m;
	    for (int j = 1; j <= n; ++j) {
		    int cnt = 0;
		    if (j % 2 == 0) {
		        for (int i = 1; i <= m; ++i) {
		            if (cnt > m / 2) {
		                ans++;cnt = 0;
		                break;
		            }
		            if (col[i] != 0) {
		                col[i]--;
		                a[j][i] = '+';
		                cnt++;
		            }
		        }
		    } else {
		        for (int i = m; i >= 1; --i) {
		            if (cnt > m / 2) {
		                ans++;cnt = 0;
		                break;
		            }
		            if (col[i] != 0) {
		                col[i]--;
		                a[j][i] = '+';
		                cnt++;
		            }
		        }
		    }
		    if (cnt > m / 2) {
		    	ans++;
		    }
		}
	}else{
		for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= m; ++j) {
                a[i][j] = '-';
                col[j] = (n - 1) / 2;
            }
        }
        ans = m;
	    for (int j = 1; j <= n; ++j) {
	    	int cnt = 0;
	    	if (j % 2 == 0) {
	        	bool ok = 0;
			    for (int i = 1; i <= m; ++i) {
			    	if(i == m / 2 and col[i] == 0){
			    		ok = 1;
			    		break;
					}
			       	if (cnt > m / 2) {
			            ans++;cnt = 0;
			            break;
			        }
			        if (col[i] != 0) {
			            col[i]--;
		                a[j][i] = '+';
		                cnt++;
		            }
		        }
	        if(ok){
	        	for(int i = m; i >= 1; i--){
	        		if (cnt > m / 2) {
		                ans++;cnt = 0;
		                break;
	            	}
		            if (col[i] != 0) {
		                col[i]--;
		                a[j][i] = '+';
		                cnt++;
		            }
				}
			}
	    } else {
	    	bool ok = 0;
	        for (int i = m; i >= 1; --i) {
	        	if(i == m / 2 + (1 - m%2) and col[i] == 0){
			  		ok = 1;
			 		break;
				}
	            if (cnt > m / 2) {
	                ans++;cnt = 0;
	                break;
	            }
	            if (col[i] != 0) {
	                col[i]--;
	                a[j][i] = '+';
	                cnt++;
	            }
	        }
	        if(ok){
	        	for(int i = 1; i <= m; i++){
	        		if (cnt > m / 2) {
		                ans++;cnt = 0;
		                break;
	            	}
		            if (col[i] != 0) {
		                col[i]--;
		                a[j][i] = '+';
		                cnt++;
		            }
				}
			}
	    }
			if (cnt > m / 2) {
			    ans++;
			}
		}
	}
 
    cout << ans << "\n";
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            cout << a[i][j];
        }
    	cout << "\n";
	}
}
 
main(){
    //kuka;
	//freopen("test.txt", "r", stdin);
	//freopen("distance.in", "r", stdin);
    //freopen("distance.out", "w", stdout);
    int oylan = 1;
   	cin>>oylan;
    while(oylan--){
        oyan();
    }
}
/*
NOTES
a/b module == (a*b^(module - 2)) % (module);
*/

Compilation message

stones.cpp:199:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  199 | main(){
      | ^~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 336 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 2 ms 336 KB Output is correct
4 Correct 3 ms 336 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 1404 KB Output is correct
2 Correct 20 ms 2020 KB Output is correct
3 Correct 18 ms 2128 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 1360 KB in the table A+B is not equal to 44
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 2 ms 336 KB Output is correct
4 Correct 3 ms 336 KB Output is correct
5 Correct 23 ms 1404 KB Output is correct
6 Correct 20 ms 2020 KB Output is correct
7 Correct 18 ms 2128 KB Output is correct
8 Incorrect 24 ms 1360 KB in the table A+B is not equal to 44
9 Halted 0 ms 0 KB -