oj.uz

Submission #508821

# Submission time Handle Problem Language Result Execution time Memory
508821 2022-01-13T21:01:13 Z inksamurai Sajam (COCI18_sajam) C++17
15 / 90
 17 ms 19960 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _34raRxL ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;

void print(){
	cout<<"\n";
}
template<class te,class ...ti>
void print(const te&v, const ti&...nv) { 
	cout<<v;
	if(sizeof...(nv)){
		cout<<" ";
		print(nv...);
	}
}

#define yare {cout<<"DA\n"; exit(0);}
#define nare {cout<<"NE\n"; exit(0);}

using pii=pair<int,int>;
using vi=vector<int>;
using vll=vector<long long>;

signed main(){
_34raRxL;
	int n,k;
	cin>>n>>k;
	int h=n,w=n;
	vec(vi) a(h,vi(w));
	rep(i,h){
		string s;
		cin>>s;
		rep(j,w){
			a[i][j]=s[j]=='o';
		}
	}
	vec(vi) tbl(2*n,vi(2*n));
	rep(i,h){
		rep(j,w){
			int x=a[i][j];
			// co = j + n ..
			int ro=i,co=j+n;
			tbl[ro][co]=tbl[co][ro]=x;
		}
	}
	vi c(n);
	{
		rep(i,n){
			rep(j,n){
				c[i]+=(tbl[i][j+n]!=tbl[0][j+n]);
				// c[i].pb((tbl[i][j+n]!=tbl[0][j+n]));
			}
		}
	}
	int ans=0;
	rep(i,n){
		ans+=min(c[i],n-c[i]);
	}
	if(ans==0){
		yare;
	}
	nare;
	// auto affine=[&](vec(vi) a){
	// 	vec(vi) rbe(n,vi(2));
	// 	rep(i,n){
	// 		rep(j,n){
	// 			rbe[j][a[i][j]]++;
	// 		}
	// 	}
	// 	int now=0;
	// 	rep(i,n){
	// 		now+=min(rbe[i][0],rbe[i][1]);
	// 	}
	// 	return now;
	// };
	// if(affine(c)<=k){
	// 	yare;
	// }
	// nare;
//	
	return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 3 ms 3916 KB Output is correct
3 Correct 5 ms 5572 KB Output is correct
4 Correct 17 ms 16828 KB Output is correct
5 Correct 5 ms 5732 KB Output is correct
6 Correct 2 ms 2500 KB Output is correct
7 Correct 5 ms 5324 KB Output is correct
8 Correct 16 ms 17540 KB Output is correct
9 Correct 1 ms 1356 KB Output is correct
10 Correct 16 ms 17868 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Incorrect 0 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 11436 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 15052 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 8524 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 19960 KB Output isn't correct
2 Halted 0 ms 0 KB -