oj.uz

Submission #777446

# Submission time Handle Problem Language Result Execution time Memory
777446 2023-07-09T09:11:03 Z vjudge1 Sajam (COCI18_sajam) C++17
15 / 90
 19 ms 4504 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 ilk[n];
	string str;cin>>str;
	for(int i=0;i<n;i++){
		ilk[i]=(str[i]=='o');
	}
	int arr[n-1][n];
	for(int i=0;i<n-1;i++){
		cin>>str;
		for(int j=0;j<n;j++){
			int a=(str[j]=='o');
			arr[i][j]=ilk[j]^a;
		}
	}
	//cout<<ilk[0]<<" "<<ilk[1]<<endl;
	//cout<<arr[0][0]<<" "<<arr[0][1]<<endl;
	ll int cev=0;
	for(int i=0;i<n-1;i++){
		for(int j=0;j<n;j++){
			dp[i]+=arr[i][j];
		}
		if(dp[i]<=n-dp[i])cev+=dp[i];
		else cev+=(n-dp[i]);
	}
	if(cev<=k){
		cout<<"DA"<<endl;
		return 0;
	}
	for(int i=0;i<n;i++){
		int fark=0;
		for(int j=0;j<n-1;j++){
			if(dp[j]==n-dp[j]){
				fark--;continue;
			}
			if(dp[j]){
				if(dp[j]>n-dp[j])fark--;
				else fark++;
				continue;
			}
			if(dp[j]>n-dp[j])fark++;
			else fark--;
		}
		if(fark<0){
			cev+=fark;
		}

	}
	if(cev<=k)cout<<"DA"<<endl;
	else cout<<"NE"<<endl;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 4 ms 1108 KB Output is correct
3 Correct 5 ms 1456 KB Output is correct
4 Correct 14 ms 3720 KB Output is correct
5 Correct 5 ms 1480 KB Output is correct
6 Correct 2 ms 812 KB Output is correct
7 Correct 5 ms 1364 KB Output is correct
8 Correct 15 ms 3924 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 16 ms 3940 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 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2712 KB Output is correct
2 Correct 12 ms 3236 KB Output is correct
3 Correct 8 ms 2256 KB Output is correct
4 Correct 7 ms 2012 KB Output is correct
5 Correct 14 ms 3676 KB Output is correct
6 Incorrect 7 ms 1536 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3464 KB Output is correct
2 Correct 13 ms 3360 KB Output is correct
3 Correct 11 ms 1972 KB Output is correct
4 Correct 9 ms 2644 KB Output is correct
5 Correct 10 ms 2756 KB Output is correct
6 Incorrect 17 ms 4192 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

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

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 4504 KB Output is correct
2 Correct 19 ms 4300 KB Output is correct
3 Incorrect 15 ms 3932 KB Output isn't correct
4 Halted 0 ms 0 KB -