oj.uz

답안 #945981

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
945981 2024-03-14T09:19:36 Z thunopro Gardening (RMI21_gardening) C++14
5 / 100
 13 ms 860 KB 
#include<bits/stdc++.h>
using namespace std ; 
#define maxn 200009 
#define ll long long 
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1
#define right id<<1|1 
#define re exit(0); 
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()
#define TIME 1.0*clock()/CLOCKS_PER_SEC

const int mod = 1e9+7; 
const int INF = 1e9; 

typedef vector<int> vi; 
typedef pair<int,int> pii;
typedef vector<pii> vii;  
typedef vector<ll> vl;

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a > mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

template <typename T> void chkmin ( T &a , T b ) { if ( a > b ) a = b ; }
template <typename T> void chkmax ( T &a , T b ) { if ( a < b ) a = b ; }

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ;
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

void rf () 
{
	freopen ("bai1.inp","r",stdin) ;
}

int n , m , k ; 

int main () 
{
	ios_base::sync_with_stdio(0); 
	cin.tie(0);cout.tie(0);
//	rf () ; 
	int test ; cin >> test ; 
	while ( test -- ) 
	{
		cin >> n >> m >> k ; 
		if ( n % 2 || m % 2 ) 
		{
			cout << "NO\n" ; continue ; 
		}
		if ( k == 1 && n + m == 4 ) 
		{
			cout << "YES\n" ; 
			for ( int i = 1 ; i <= n ; i ++ ) 
			{
				for ( int j = 1 ; j <= m ; j ++ ) 
				{
					cout << 1 << " " ; 
				}
				cout << "\n" ; 
			}
		}
		else if ( k == 2 && n + m == 6 ) 
		{
			cout << "YES\n" ; 
			for ( int i = 1 ; i <= n ; i ++ ) 
			{
				for ( int j = 1 ; j <= m ; j ++ ) 
				{
					if ( i > 2 || j > 2 ) cout << 2 << " " ; 
					else cout << 1 << " " ; 
				}
				cout << "\n" ; 
			}
		}
		else if ( k == 2 && n + m == 8 ) 
		{
			cout << "YES\n" ; 
			for ( int i = 1 ; i <= n ; i ++ ) 
			{
				for ( int j = 1 ; j <= m ; j ++ ) 
				{
					if ( i == 1 || i == n || j == 1 || j == m ) cout << 1 << " " ; 
					else cout << 2 << " " ; 
				}
				cout << "\n" ; 
			}
		}
		else if ( k == 4 && n + m == 8 ) 
		{
			cout << "YES\n" ; 
			for ( int i = 1 ; i <= n ; i ++ ) 
			{
				for ( int j = 1 ; j <= m ; j ++ ) 
				{
					int value = (i-1)/2*2 + (j-1)/2 + 1 ; 
					cout << value << " " ; 
				}
				cout << "\n" ; 
			}
		}
		else cout << "NO\n" ; 	
	}
}

Compilation message

Main.cpp: In function 'void rf()':
Main.cpp:42:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 860 KB Correct! Azusa and Laika like the garden :)

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 860 KB Correct! Azusa and Laika like the garden :)
2 Failed 1 ms 348 KB Incorrect output
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 860 KB Correct! Azusa and Laika like the garden :)
2 Failed 1 ms 348 KB Incorrect output
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

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

Subtask #5
0 / 39.0

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

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 860 KB Correct! Azusa and Laika like the garden :)
2 Failed 1 ms 348 KB Incorrect output
3 Halted 0 ms 0 KB -