oj.uz

답안 #776849

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
776849 2023-07-08T10:21:23 Z vjudge1 Sajam (COCI18_sajam) C++17
0 / 90
 3510 ms 5332 KB 
#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],tut[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 ii=1;ii<=n;ii++){
		cev=0;
		for(int i=1;i<=n;i++){
			if(i==ii)continue;
			int say=0;
			for(int j=0;j<n;j++){
				if((a[ii][j]^a[i][j]))say++;
			}
			tut[i]=say;
			cev+=min(say,n-say);
			//~ cout<<i<<" ()() "<<cev<<endl;
		}
		for(int j=0;j<n;j++){
			int yes=0;
			for(int i=1;i<=n;i++){
				if(i==ii)continue;
				if(a[ii][j]!=a[i][j]){
					if(tut[i]>n-tut[i])yes++;
					else yes--;
				}
				else{
					if(tut[i]<n-tut[i])yes++;
					else yes--;
				}
			}
			v.pb(yes);
		}
		sort(v.begin(),v.end());
		int sayac=0,say2=0;
		for(auto go:v){
			sayac++;
			say2+=go;
			//~ cout<<say2<<" :: "<<sayac<<" :: "<<cev<<endl;
			if(cev-say2<=k-sayac){cout<<"DA\n";return 0;}
		}
	}
	cout<<"NE\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
0 / 15.0

# 결과 실행 시간 메모리 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 5 ms 4692 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 3510 ms 3984 KB Output is correct
8 Incorrect 234 ms 5108 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 596 KB Output is correct
3 Correct 0 ms 724 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 596 KB Output is correct
6 Incorrect 1 ms 596 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3924 KB Output is correct
2 Correct 5 ms 4372 KB Output is correct
3 Correct 4 ms 3412 KB Output is correct
4 Correct 3 ms 3284 KB Output is correct
5 Correct 6 ms 4692 KB Output is correct
6 Incorrect 3 ms 2720 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4564 KB Output is correct
2 Correct 7 ms 4508 KB Output is correct
3 Correct 4 ms 3284 KB Output is correct
4 Correct 4 ms 3796 KB Output is correct
5 Correct 4 ms 3924 KB Output is correct
6 Incorrect 6 ms 5076 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3284 KB Output is correct
2 Correct 4 ms 3284 KB Output is correct
3 Correct 7 ms 5204 KB Output is correct
4 Correct 3 ms 2772 KB Output is correct
5 Correct 4 ms 3284 KB Output is correct
6 Incorrect 7 ms 5076 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5332 KB Output is correct
2 Correct 7 ms 5160 KB Output is correct
3 Correct 6 ms 4948 KB Output is correct
4 Correct 4 ms 3668 KB Output is correct
5 Correct 6 ms 3748 KB Output is correct
6 Incorrect 4 ms 3924 KB Output isn't correct
7 Halted 0 ms 0 KB -