Submission #777460

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
777460	2023-07-09T09:17:59 Z	vjudge1	Sajam (COCI18_sajam)	C++17	15 / 90	19 ms	4204 KB

sajam

#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;
		}
	}
	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(arr[j][i]){
				if(dp[j]>n-dp[j])fark--;
				else fark++;
				continue;
			}
			if(dp[j]>n-dp[j])fark++;
			else fark--;
		}
			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	0 ms	212 KB	Output is correct
2	Correct	3 ms	980 KB	Output is correct
3	Correct	4 ms	1328 KB	Output is correct
4	Correct	13 ms	3412 KB	Output is correct
5	Correct	4 ms	1364 KB	Output is correct
6	Correct	2 ms	596 KB	Output is correct
7	Correct	6 ms	1236 KB	Output is correct
8	Correct	18 ms	3676 KB	Output is correct
9	Correct	1 ms	468 KB	Output is correct
10	Correct	19 ms	3732 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	1 ms	212 KB	Output is correct
3	Correct	0 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	Incorrect	0 ms	212 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #3

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	2492 KB	Output is correct
2	Correct	11 ms	2900 KB	Output is correct
3	Correct	8 ms	2004 KB	Output is correct
4	Correct	9 ms	1876 KB	Output is correct
5	Correct	13 ms	3472 KB	Output is correct
6	Incorrect	6 ms	1364 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #4

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	3156 KB	Output is correct
2	Correct	12 ms	3164 KB	Output is correct
3	Correct	7 ms	1876 KB	Output is correct
4	Correct	9 ms	2388 KB	Output is correct
5	Correct	10 ms	2552 KB	Output is correct
6	Incorrect	19 ms	3956 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	1944 KB	Output is correct
2	Correct	7 ms	1876 KB	Output is correct
3	Correct	17 ms	4088 KB	Output is correct
4	Correct	5 ms	1364 KB	Output is correct
5	Correct	8 ms	1876 KB	Output is correct
6	Incorrect	16 ms	3924 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #6

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	4204 KB	Output is correct
2	Correct	15 ms	3924 KB	Output is correct
3	Correct	15 ms	3668 KB	Output is correct
4	Correct	9 ms	2368 KB	Output is correct
5	Correct	9 ms	2388 KB	Output is correct
6	Incorrect	10 ms	2512 KB	Output isn't correct
7	Halted	0 ms	0 KB	-