# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
776790 |
2023-07-08T09:29:56 Z |
vjudge1 |
Sajam (COCI18_sajam) |
C++17 |
|
21 ms |
5096 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];
}
//cout<<sor1[i]<<'\n';
}
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++;
}
gec=min(oi,xi);
cev+=gec;
}
for(int i=0;i<n;i++){
if(ger[0][i]=='o'){
for(int j=0;j<n;j++){
sor1[j][i]=ger[j][i];
}
}
else{
for(int j=0;j<n;j++){
sor1[j][i]=s[j][i];
}
}
}
gec=OYY;
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++;
}
gec=min(xi,oi);
cev1+=gec;
//cout<<xi<<" "<<oi<<endl;
}
if(min(cev,cev1)<=k)cout<<"DA"<<'\n';
else cout<<"NE"<<'\n';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 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 |
6 ms |
2900 KB |
Output is correct |
5 |
Correct |
3 ms |
1108 KB |
Output is correct |
6 |
Correct |
1 ms |
596 KB |
Output is correct |
7 |
Correct |
6 ms |
1108 KB |
Output is correct |
8 |
Correct |
18 ms |
3016 KB |
Output is correct |
9 |
Correct |
1 ms |
468 KB |
Output is correct |
10 |
Correct |
18 ms |
3092 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
2004 KB |
Output is correct |
2 |
Correct |
6 ms |
2388 KB |
Output is correct |
3 |
Correct |
4 ms |
1748 KB |
Output is correct |
4 |
Correct |
4 ms |
1492 KB |
Output is correct |
5 |
Correct |
7 ms |
2772 KB |
Output is correct |
6 |
Correct |
3 ms |
1236 KB |
Output is correct |
7 |
Correct |
5 ms |
2564 KB |
Output is correct |
8 |
Correct |
5 ms |
2772 KB |
Output is correct |
9 |
Correct |
5 ms |
1048 KB |
Output is correct |
10 |
Correct |
21 ms |
5068 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
2644 KB |
Output is correct |
2 |
Correct |
6 ms |
2644 KB |
Output is correct |
3 |
Correct |
4 ms |
1620 KB |
Output is correct |
4 |
Correct |
5 ms |
2004 KB |
Output is correct |
5 |
Correct |
5 ms |
2120 KB |
Output is correct |
6 |
Correct |
8 ms |
3156 KB |
Output is correct |
7 |
Correct |
2 ms |
1236 KB |
Output is correct |
8 |
Correct |
5 ms |
2384 KB |
Output is correct |
9 |
Correct |
13 ms |
2684 KB |
Output is correct |
10 |
Correct |
21 ms |
5096 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
1620 KB |
Output is correct |
2 |
Correct |
4 ms |
1688 KB |
Output is correct |
3 |
Incorrect |
8 ms |
4132 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
4212 KB |
Output is correct |
2 |
Correct |
8 ms |
4052 KB |
Output is correct |
3 |
Incorrect |
7 ms |
3028 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |