Submission #776820

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
776820	2023-07-08T10:00:05 Z	vjudge1	Sajam (COCI18_sajam)	C++17	30 / 90	11 ms	5272 KB

sajam

#include <bits/stdc++.h>

using namespace std;

typedef long long lo; 

#define fi first
#define se second
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000;
const lo li = 1005;
const lo mod = 1000000007;

int n,m,a[li][li],k,flag,t,acik[li];
int cev;
string s[li];
vector<int> v;

int main(void){
	fio();
	cin>>n>>k;
	FOR cin>>s[i];
	if(k>=(n+1)/2){cout<<"DA\n";return 0;}
	FOR{
		for(int j=0;j<n;j++){
			if(s[i][j]=='o')a[i][j]=1;
		}
	}
	for(int i=2;i<=n;i++){
		int say=0;
		for(int j=0;j<n;j++){
			if((a[1][j]^a[i][j]))say++;
		}
		cev+=min(say,n-say);
		//~ cout<<i<<" ()() "<<cev<<endl;
	}
	if(cev>k){cout<<"NE\n";return 0;}
	cout<<"DA\n";
	return 0;
	cev=k+1;
	FOR{
		v.clear();
		for(int j=0;j<n;j++){
			if(s[i][j]=='o')v.pb(acik[j]);
			else v.pb(n-acik[j]);
		}
		sort(v.begin(),v.end());
		if(n%2){
			int cur=0;
			for(auto go:v)cur+=abs(go-v[n/2]);
			//~ cout<<cur<<" AAA "<<cev<<endl;
			cev=min(cev,cur);
		}
		else{
			int cur=0;
			for(auto go:v)cur+=abs(go-v[n/2]);
			//~ cout<<cur<<" BBB "<<cev<<endl;
			cev=min(cev,cur);
			cur=0;
			for(auto go:v)cur+=abs(go-v[n/2-1]);
			//~ cout<<cur<<" CCC "<<cev<<endl;
			cev=min(cev,cur);
		}
	}
	if(cev>k)cout<<"NE\n";
	else cout<<"DA\n";
	return 0;
}

Subtask #1

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	468 KB	Output is correct
2	Correct	2 ms	2132 KB	Output is correct
3	Correct	2 ms	2644 KB	Output is correct
4	Correct	4 ms	4692 KB	Output is correct
5	Correct	2 ms	2644 KB	Output is correct
6	Correct	1 ms	1620 KB	Output is correct
7	Correct	3 ms	2516 KB	Output is correct
8	Correct	11 ms	4912 KB	Output is correct
9	Correct	1 ms	1236 KB	Output is correct
10	Correct	10 ms	4948 KB	Output is correct

Subtask #2

0 / 15.0

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

Subtask #3

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	3796 KB	Output is correct
2	Correct	4 ms	4308 KB	Output is correct
3	Correct	3 ms	3412 KB	Output is correct
4	Correct	2 ms	3284 KB	Output is correct
5	Correct	5 ms	4692 KB	Output is correct
6	Correct	2 ms	2772 KB	Output is correct
7	Correct	3 ms	3796 KB	Output is correct
8	Correct	3 ms	3924 KB	Output is correct
9	Correct	2 ms	2108 KB	Output is correct
10	Incorrect	2 ms	1364 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #4

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	4436 KB	Output is correct
2	Correct	4 ms	4436 KB	Output is correct
3	Correct	3 ms	3284 KB	Output is correct
4	Correct	3 ms	3796 KB	Output is correct
5	Correct	3 ms	3924 KB	Output is correct
6	Correct	5 ms	5136 KB	Output is correct
7	Correct	2 ms	2388 KB	Output is correct
8	Correct	4 ms	3668 KB	Output is correct
9	Correct	7 ms	3924 KB	Output is correct
10	Correct	11 ms	5272 KB	Output is correct

Subtask #5

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	724 KB	Output is correct
2	Correct	1 ms	724 KB	Output is correct
3	Correct	1 ms	1364 KB	Output is correct
4	Correct	1 ms	596 KB	Output is correct
5	Correct	1 ms	724 KB	Output is correct
6	Incorrect	1 ms	1236 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #6

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	1364 KB	Output is correct
2	Correct	2 ms	1236 KB	Output is correct
3	Correct	1 ms	1188 KB	Output is correct
4	Correct	1 ms	852 KB	Output is correct
5	Correct	1 ms	852 KB	Output is correct
6	Incorrect	1 ms	852 KB	Output isn't correct
7	Halted	0 ms	0 KB	-