oj.uz

Submission #321495

# Submission time Handle Problem Language Result Execution time Memory
321495 2020-11-12T15:06:42 Z ryansee Red-blue table (IZhO19_stones) C++14
17 / 100
 37 ms 1536 KB 
#include "bits/stdc++.h"
using namespace std;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

#define LLINF ((long long)1e18)
#define INF int(1e9+1e6)
#define MAXN (200006)
int main() {
	FAST
	ll t;
	cin>>t;
	while(t--){
		ll n, m;
		cin>>n>>m;
		vector<vector<char>> grid(n+1, vector<char>(m+1, 0));
		bool lol=0;
		ll ans = n + (m + 1) / 2 - 1;
		FOR(i,1,n) {
			if(lol || (n-i+1 < (m/2+1) && (n-i+1) > n/2)) {
				if(lol==0) ans -= n - i + 1, ans += m/2+1;
				lol=1;
				FOR(j,1,m) grid[i][j]='c';
				continue;
			}
			FOR(j,1,m/2+1) grid[i][j]='r'; 
			FOR(j,m/2+2,m) grid[i][j]='c';
		}
		cout<<ans<<'\n';
		FOR(i,1,n) FOR(j,1,m) { cout<<(grid[i][j]=='r'?'+':'-'); if(j==m) cout<<'\n'; }
	}
}

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 364 KB Wrong answer in test 3 45: 45 < 46

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Incorrect 2 ms 364 KB Wrong answer in test 3 45: 45 < 46

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 1388 KB Wrong answer in test 97 21: 107 < 116
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 1536 KB Wrong answer in test 24 24: 35 < 44
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Incorrect 2 ms 364 KB Wrong answer in test 3 45: 45 < 46