oj.uz

Submission #776723

# Submission time Handle Problem Language Result Execution time Memory
776723 2023-07-08T07:56:21 Z vjudge1 Sajam (COCI18_sajam) C++17
45 / 90
 20 ms 4180 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,xi=0,oi=0,cev1=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;
    int gec=OYY;
    for(int i=0;i<n;i++){
        gec=OYY;
        xi=0,oi=0;
        for(int j=0;j<n;j++){
            if(sor1[j][i]=='x')xi++;
            else oi++;
            //cout<<sor1[j][i]<<" ";
        }
        //cout<<endl;
        gec=min(oi,xi);
        cev+=gec;
        //cout<<cev<<" "<<oi<<" "<<xi<<'\n';
    }
    for(int i=0;i<n;i++){
        gec=OYY;
        xi=0,oi=0;
        for(int j=0;j<n;j++){
            if(sor1[i][j]=='x')xi++;
            else oi++;
            //cout<<sor1[j][i]<<" ";
        }
        //cout<<endl;
        gec=min(oi,xi);
        cev1+=gec;
        //cout<<cev<<" "<<oi<<" "<<xi<<'\n';
    }
    if(min(cev,cev1)<=k)cout<<"DA"<<'\n';
    else cout<<"NE"<<'\n';
    }
    return 0;
}

Compilation message

sajam.cpp: In function 'int32_t main()':
sajam.cpp:41:10: warning: unused variable 'stop' [-Wunused-variable]
   41 |     bool stop=true;
      |          ^~~~

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 852 KB Output is correct
3 Correct 2 ms 1108 KB Output is correct
4 Correct 5 ms 2900 KB Output is correct
5 Correct 2 ms 1108 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 5 ms 1108 KB Output is correct
8 Correct 15 ms 2988 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 15 ms 3028 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2004 KB Output is correct
2 Correct 4 ms 2388 KB Output is correct
3 Correct 3 ms 1748 KB Output is correct
4 Correct 4 ms 1492 KB Output is correct
5 Correct 5 ms 2772 KB Output is correct
6 Correct 2 ms 1236 KB Output is correct
7 Correct 4 ms 2004 KB Output is correct
8 Correct 4 ms 2124 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 18 ms 4180 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2644 KB Output is correct
2 Correct 6 ms 2644 KB Output is correct
3 Correct 3 ms 1620 KB Output is correct
4 Correct 5 ms 1944 KB Output is correct
5 Correct 4 ms 2004 KB Output is correct
6 Correct 7 ms 3156 KB Output is correct
7 Correct 2 ms 980 KB Output is correct
8 Correct 5 ms 1876 KB Output is correct
9 Correct 11 ms 2004 KB Output is correct
10 Correct 20 ms 4180 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1620 KB Output is correct
2 Correct 3 ms 1620 KB Output is correct
3 Incorrect 7 ms 4180 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4180 KB Output is correct
2 Correct 7 ms 4052 KB Output is correct
3 Incorrect 6 ms 3040 KB Output isn't correct
4 Halted 0 ms 0 KB -