oj.uz

Submission #777494

# Submission time Handle Problem Language Result Execution time Memory
777494 2023-07-09T09:40:49 Z vjudge1 Sajam (COCI18_sajam) C++17
90 / 90
 18 ms 4180 KB 
#include<bits/stdc++.h>
using namespace std;
#define lalala ios_base::sync_with_stdio(false);cin.tie(NULL);
//#define endl "\n"
#define ll long long
#define pb push_back
#define N 1005
#define f first
#define s second
#define M 17
int dp[N];
int main(){
	int n,k;cin>>n>>k;
	int arr[n][n];
	for(int i=0;i<n;i++){
		string str;cin>>str;
		for(int j=0;j<n;j++){
			arr[i][j]=(str[j]=='o');
		}
	}
	for(int uwu=0;uwu<1;uwu++){
		for(int i=0;i<n;i++){
			int bir=0;
			for(int j=0;j<n;j++){
				bir+=arr[i][j];
			}
			if(bir>n-bir){
				for(int j=0;j<n;j++){
					arr[i][j]^=1;
				}
			}
		}
		for(int i=0;i<n;i++){
			int bir=0;
			for(int j=0;j<n;j++){
				bir+=arr[j][i];
			}
			if(bir>n-bir){
				for(int j=0;j<n;j++){
					arr[j][i]^=1;
				}
			}
		}
	}
	int bir=0;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			bir+=arr[i][j];
		}
	}
	if(bir>n*n-bir)bir=n*n-bir;
	if(bir<=k)cout<<"DA"<<endl;
	else cout<<"NE"<<endl;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 5 ms 980 KB Output is correct
3 Correct 5 ms 1324 KB Output is correct
4 Correct 15 ms 3524 KB Output is correct
5 Correct 5 ms 1236 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 5 ms 1236 KB Output is correct
8 Correct 15 ms 3676 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 15 ms 3732 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2492 KB Output is correct
2 Correct 18 ms 2900 KB Output is correct
3 Correct 8 ms 2004 KB Output is correct
4 Correct 7 ms 1876 KB Output is correct
5 Correct 14 ms 3472 KB Output is correct
6 Correct 5 ms 1432 KB Output is correct
7 Correct 15 ms 2440 KB Output is correct
8 Correct 11 ms 2636 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 17 ms 4128 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3240 KB Output is correct
2 Correct 14 ms 3156 KB Output is correct
3 Correct 7 ms 1936 KB Output is correct
4 Correct 10 ms 2388 KB Output is correct
5 Correct 12 ms 2552 KB Output is correct
6 Correct 17 ms 3960 KB Output is correct
7 Correct 4 ms 1108 KB Output is correct
8 Correct 9 ms 2320 KB Output is correct
9 Correct 10 ms 2516 KB Output is correct
10 Correct 17 ms 4124 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1876 KB Output is correct
2 Correct 8 ms 1960 KB Output is correct
3 Correct 18 ms 4088 KB Output is correct
4 Correct 6 ms 1364 KB Output is correct
5 Correct 8 ms 1876 KB Output is correct
6 Correct 17 ms 3936 KB Output is correct
7 Correct 7 ms 1400 KB Output is correct
8 Correct 7 ms 1492 KB Output is correct
9 Correct 6 ms 1492 KB Output is correct
10 Correct 6 ms 1492 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 4180 KB Output is correct
2 Correct 16 ms 3924 KB Output is correct
3 Correct 15 ms 3696 KB Output is correct
4 Correct 9 ms 2260 KB Output is correct
5 Correct 10 ms 2384 KB Output is correct
6 Correct 10 ms 2516 KB Output is correct
7 Correct 6 ms 1364 KB Output is correct
8 Correct 15 ms 3292 KB Output is correct
9 Correct 7 ms 1908 KB Output is correct
10 Correct 16 ms 3876 KB Output is correct