oj.uz

Submission #503941

# Submission time Handle Problem Language Result Execution time Memory
503941 2022-01-09T08:38:41 Z tmn2005 Red-blue table (IZhO19_stones) C++17
17 / 100
 0 ms 204 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

#define ar array
#define fr first
#define sc second

#define vec vector
#define ret return

#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front

#define int long long

#define pii pair<int,int>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N=1e6+12,INF=1e9,mod = 1e9+7;
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n, m, k, x, y, l, r, o, ans, res, ok, mx, mn = INF;
int a, b, c;

main(){
	NeedForSpeed
    cin>>o;
    while(o--){
    	cin>>n>>m;
    	if(n == 1){
    		if(m == 1){
    			cout<<max(n, m) + max(0ll, (min(n, m) - min(n, m) / 2 - 1))<<endl;
	    		cout<<"+"<<endl;
			}
			else if(m == 2){
				cout<<max(n, m) + max(0ll, (min(n, m) - min(n, m) / 2 - 1))<<endl;
				cout<<"--"<<endl;
			}
			else if(m == 3){
				cout<<max(n, m) + max(0ll, (min(n, m) - min(n, m) / 2 - 1))<<endl;
				cout<<"---"<<endl;
			}
			else if(m == 4){
				cout<<max(n, m) + max(0ll, (min(n, m) - min(n, m) / 2 - 1))<<endl;
				cout<<"----"<<endl;
			}
		}
		else if(n == 2){
			if(m == 1){
				cout<<max(n, m) + max(0ll, (min(n, m) - min(n, m) / 2 - 1))<<endl;
	    		cout<<"+"<<endl<<"+"<<endl;
			}
			else if(m == 2){
				cout<<max(n, m) + max(0ll, (min(n, m) - min(n, m) / 2 - 1))<<endl;
				cout<<"++"<<endl<<"++"<<endl;
			}
			else if(m == 3){
				cout<<max(n, m) + max(0ll, (min(n, m) - max(n, m) / 2 - 1))<<endl;
				cout<<"---"<<endl<<"---"<<endl;
			}
			else if(m == 4){
				cout<<max(n, m) + max(0ll, (min(n, m) - min(n, m) / 2 - 1))<<endl;
				cout<<"----"<<endl<<"----"<<endl;
			}
		}
		else if(n == 3){
			if(m == 1){
				cout<<max(n, m) + max(0ll, (min(n, m) - min(n, m) / 2 - 1))<<endl;
    			cout<<"+"<<endl<<"+"<<endl<<"+"<<endl;
			}
			else if(m == 2){
				cout<<max(n, m) + max(0ll, (min(n, m) - min(n, m) / 2 - 1))<<endl;
				cout<<"++"<<endl<<"++"<<endl<<"++"<<endl;
			}
			else if(m == 3){
				cout<<max(n, m) + max(0ll, (min(n, m) - min(n, m) / 2 - 1))<<endl;
				cout<<"++-"<<endl<<"++-"<<endl<<"++-"<<endl;
			}
			else if(m == 4){
				cout<<max(n, m) + max(0ll, (min(n, m) - min(n, m) / 2 - 1))<<endl;
				cout<<"++++"<<endl<<"----"<<endl<<"----"<<endl;
			}
		}
		else if(n == 4){
			if(m == 1){
				cout<<max(n, m) + max(0ll, (min(n, m) - min(n, m) / 2 - 1))<<endl;
	    		cout<<"+"<<endl<<"+"<<endl<<"+"<<endl<<"+"<<endl;
			}
			else if(m == 2){
				cout<<max(n, m) + max(0ll, (min(n, m) - min(n, m) / 2 - 1))<<endl;
				cout<<"++"<<endl<<"++"<<endl<<"++"<<endl<<"++"<<endl;
			}
			else if(m == 3){
				cout<<max(n, m) + max(0ll, (min(n, m) - min(n, m) / 2 - 1))<<endl;
				cout<<"++-"<<endl<<"++-"<<endl<<"++-"<<endl<<"++-"<<endl;
			}
			else if(m == 4){
				cout<<max(n, m) + max(0ll, (min(n, m) - min(n, m) / 2 - 1))<<endl;
				cout<<"+++-"<<endl<<"+++-"<<endl<<"+++-"<<endl<<"+++-"<<endl;
			}
		}
	}




	return 0;
}

Compilation message

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

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Wrong answer

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Wrong answer

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Wrong answer