oj.uz

Submission #776671

# Submission time Handle Problem Language Result Execution time Memory
776671 2023-07-08T06:52:02 Z vjudge1 Sajam (COCI18_sajam) C++17
15 / 90
 9 ms 5176 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define OYY 1000000000005
#define faster ios_base::sync_with_stdio(false); cin.tie(NULL);
#define mid (start+end)/2
#define mod 1000000007

int32_t main(){
    faster
    int n,k;
    cin>>n>>k;
    string s[n],ger[n],sor1[n];
    int cev=0;
    for(int i=0;i<n;i++){
        cin>>s[i];
        string f="";
        for(int j=0;j<n;j++){
            if(s[i][j]=='x'){
                f+='o';
            }
            else f+='x';
        }
        ger[i]=f;
    }
    int gec=n*n;
    if(gec%2!=0)gec++;
    gec/=2;
    if(k>=gec){
        cout<<"DA"<<'\n';
    }
    else{
    for(int i=0;i<n;i++){
        if(ger[i][0]=='o'){
            sor1[i]=ger[i];
        }
        else{
            sor1[i]=s[i];
        }
    }
    bool stop=true;
    for(int i=1;i<n && stop;i++){
        for(int j=0;j<n && stop;j++){
            if(sor1[i][j]==sor1[i-1][j]){
                stop=true;
            }
            else {
                cev++;
                //cout<<i<<" "<<j<<endl;
            }
        }
    }
    if(cev<=k)cout<<"DA"<<'\n';
    else cout<<"NE"<<'\n';
    }
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 976 KB Output is correct
3 Correct 2 ms 1384 KB Output is correct
4 Correct 5 ms 3668 KB Output is correct
5 Correct 2 ms 1356 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 3 ms 1364 KB Output is correct
8 Correct 9 ms 3824 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 9 ms 3924 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 320 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 2564 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 3320 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1996 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 5176 KB Output isn't correct
2 Halted 0 ms 0 KB -