oj.uz

Submission #1101639

# Submission time Handle Problem Language Result Execution time Memory
1101639 2024-10-16T12:32:26 Z Ciprian Gardening (RMI21_gardening) C++17
5 / 100
 120 ms 840 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long 
 
int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin>>t;
    for(int i=0; i<t; i++){
        int n,m, k;
        cin>>n>>m>>k;
        if(m%2==1 || n%2==1){
            cout<<"NO"<<endl;
        }else if(n<=4){
            if(n==2){
                if(m/2==k){
                    int cnt=1;
                    cout<<"YES"<<endl;
                    for(int x=0;x<k; x++){
                        cout<<cnt<<" "<<cnt<<" ";
                        cnt++;
                    }cout<<endl;
                    cnt=1;
                    for(int x=0;x<k; x++){
                        cout<<cnt<<" "<<cnt<<" ";
                        cnt++;
                    }cout<<endl;
                }else{
                    cout<<"NO"<<endl;
                }
            }else{
                if((m-2)/2==k-1 && k>1){
                    cout<<"YES"<<endl;
                    for(int j=0; j<m; j++){
                        cout<<1<<" ";
                        
                    }cout<<endl;
                    cout<<1<<" ";
                    int cnt=2;
                    for(int j=1;j<k; j++){
                        cout<<cnt<<" "<<cnt<<" ";
                        cnt++;
                        
                    }cout<<1<<endl;
                    cout<<1<<" ";
                    cnt=2;
                    for(int j=1;j<k; j++){
                        cout<<cnt<<" "<<cnt<<" ";
                        cnt++;
                        
                    }cout<<1<<endl;
                    for(int j=0; j<m; j++){
                        cout<<1<<" ";
                        
                    }cout<<endl;
                }else if(m==k){
                    cout<<"YES"<<endl;
                    int cnt=1;
                    for(int j=0; j<k/2; j++){
                        cout<<cnt<<" "<<cnt<<" ";
                        cnt++;
                    }cnt=1;
                    cout<<endl;
                    for(int j=0; j<k/2; j++){
                        cout<<cnt<<" "<<cnt<<" ";
                        cnt++;
                    }int x=cnt;
                    cout<<endl;
                    for(int j=0; j<k/2; j++){
                        cout<<cnt<<" "<<cnt<<" ";
                        cnt++;
                    }cout<<endl;
                    for(int j=0; j<k/2; j++){
                        cout<<x<<" "<<x<<" ";
                        x++;
                    }cout<<endl;
            
                }else if((m+2)/2==k && m>4){
                    cout<<"YES"<<endl;
                    int cnt=1, tr=1;
                    vector<int> v(m+4);
                    for(int j=1; j<=(m-2)/4; j++){
                        for(int q=1; q<=4; q++){
                            cout<<cnt<<" ";
                            v[tr]=cnt;
                            tr++;
                        }
                        cnt++;
                    }int t=1;
                    int x=cnt;
                    cout<<k-1<<" "<<k-1<<endl;
                    for(int j=1; j<=(m-2)/4; j++){
                        cout<<v[t]<<" "<<cnt<<" "<<cnt<<" "<<v[t]<<" ";
                        t+=4;
                        cnt++;
                    } t=1;
                
                    cout<<k-1<<" "<<k-1<<endl;
                    for(int j=1; j<=(m-2)/4; j++){
                        cout<<v[t]<<" "<<x<<" "<<x<<" "<<v[t]<<" ";
                        t+=4;
                        x++;
                    }cout<<k<<" "<<k<<endl;
                    for(int j=1; j<m-1; j++){
                        cout<<v[j]<<" ";
                    }cout<<k<<" "<<k<<endl;
                }else{
                    cout<<"NO"<<endl;
                }
            }
        }
    }
 
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 840 KB Correct! Azusa and Laika like the garden :)

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 840 KB Correct! Azusa and Laika like the garden :)
2 Failed 15 ms 608 KB Incorrect output
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 840 KB Correct! Azusa and Laika like the garden :)
2 Failed 15 ms 608 KB Incorrect output
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Failed 1 ms 504 KB Incorrect output
2 Halted 0 ms 0 KB -

Subtask #5
0 / 39.0

# Verdict Execution time Memory Grader output
1 Failed 1 ms 336 KB Incorrect output
2 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 840 KB Correct! Azusa and Laika like the garden :)
2 Failed 15 ms 608 KB Incorrect output
3 Halted 0 ms 0 KB -