# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
256773 |
2020-08-03T07:52:58 Z |
leaked |
Sajam (COCI18_sajam) |
C++14 |
|
45 ms |
9208 KB |
#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("fast-math")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (int)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)
//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
void umin(int &a,int b){a=min(a,b);}
bool is_prime(ll val){for(ll i=2;i<=sqrt(val);i++)if(val%i==0)return 0; return 1;}
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll tx[4]={0,1,-1,1};
const ll ty[4]={-1,0,1,1};
const char rev_to[4]={'E','W','N','S'};
int M=1e9;
const int N=1e6+2;
const int pp=73;
const int lg=19;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
auto rnd=bind(uniform_int_distribution<ll>(1,N),mt19937(time(0)));
void bad(){
cout<<"NE";
exit(0);
}
int c[N],r[N];
signed main()
{
// freopen("in.txt","r",stdin);
fast_io;
int n,k;
cin>>n>>k;
vector<vector<int>>a(n,vector<int>(n)),b;
char cc;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>cc;
if(cc=='x') a[i][j]=1,c[j]++,r[i]++;
if(cc=='o') a[i][j]=0;
}
}b=a;
/// rows
for(int i=0;i<n;i++){
int cnt=0;
for(int j=0;j<n;j++) cnt+=a[i][j];
if(cnt<=n-cnt) for(int j=0;j<n;j++)a[i][j]^=1;
}
///columns;
for(int j=0;j<n;j++){
int cnt=0;
for(int i=0;i<n;i++) cnt+=a[i][j];
if(cnt<=n-cnt) for(int i=0;i<n;i++)a[i][j]^=1;
}
///columns;
for(int j=0;j<n;j++){
int cnt=0;
for(int i=0;i<n;i++) cnt+=b[i][j];
if(cnt<=n-cnt) for(int i=0;i<n;i++)b[i][j]^=1;
}
/// rows
for(int i=0;i<n;i++){
int cnt=0;
for(int j=0;j<n;j++) cnt+=b[i][j];
if(cnt<=n-cnt) for(int j=0;j<n;j++)b[i][j]^=1;
}
int a1=0,b1=0;
for(int i=0;i<n;i++) for(int j=0;j<n;j++) a1+=a[i][j],b1+=b[i][j];
a1=max(a1,b1);
cout<<(a1+k>=1ll*n*n?"DA":"NE");
return 0;
}
/*
ababababab
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
6 ms |
1920 KB |
Output is correct |
3 |
Correct |
11 ms |
2688 KB |
Output is correct |
4 |
Correct |
30 ms |
7900 KB |
Output is correct |
5 |
Correct |
10 ms |
2816 KB |
Output is correct |
6 |
Correct |
4 ms |
1280 KB |
Output is correct |
7 |
Correct |
10 ms |
2560 KB |
Output is correct |
8 |
Correct |
34 ms |
8056 KB |
Output is correct |
9 |
Correct |
2 ms |
768 KB |
Output is correct |
10 |
Correct |
34 ms |
8192 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
0 ms |
384 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
6 |
Correct |
1 ms |
384 KB |
Output is correct |
7 |
Correct |
1 ms |
384 KB |
Output is correct |
8 |
Correct |
1 ms |
384 KB |
Output is correct |
9 |
Correct |
1 ms |
384 KB |
Output is correct |
10 |
Correct |
1 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
5376 KB |
Output is correct |
2 |
Correct |
25 ms |
6528 KB |
Output is correct |
3 |
Correct |
16 ms |
4480 KB |
Output is correct |
4 |
Correct |
15 ms |
3968 KB |
Output is correct |
5 |
Correct |
29 ms |
7544 KB |
Output is correct |
6 |
Correct |
11 ms |
2944 KB |
Output is correct |
7 |
Correct |
21 ms |
5248 KB |
Output is correct |
8 |
Correct |
22 ms |
5760 KB |
Output is correct |
9 |
Correct |
6 ms |
1792 KB |
Output is correct |
10 |
Correct |
34 ms |
9088 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
27 ms |
7032 KB |
Output is correct |
2 |
Correct |
26 ms |
6904 KB |
Output is correct |
3 |
Correct |
15 ms |
4096 KB |
Output is correct |
4 |
Correct |
20 ms |
5120 KB |
Output is correct |
5 |
Correct |
21 ms |
5496 KB |
Output is correct |
6 |
Correct |
35 ms |
8696 KB |
Output is correct |
7 |
Correct |
9 ms |
2304 KB |
Output is correct |
8 |
Correct |
19 ms |
4984 KB |
Output is correct |
9 |
Correct |
21 ms |
5504 KB |
Output is correct |
10 |
Correct |
34 ms |
9080 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
4096 KB |
Output is correct |
2 |
Correct |
24 ms |
4224 KB |
Output is correct |
3 |
Correct |
36 ms |
8952 KB |
Output is correct |
4 |
Correct |
12 ms |
3072 KB |
Output is correct |
5 |
Correct |
17 ms |
4224 KB |
Output is correct |
6 |
Correct |
35 ms |
8568 KB |
Output is correct |
7 |
Correct |
11 ms |
2816 KB |
Output is correct |
8 |
Correct |
16 ms |
3200 KB |
Output is correct |
9 |
Correct |
13 ms |
3328 KB |
Output is correct |
10 |
Correct |
15 ms |
3200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
37 ms |
9208 KB |
Output is correct |
2 |
Correct |
45 ms |
8824 KB |
Output is correct |
3 |
Correct |
32 ms |
8056 KB |
Output is correct |
4 |
Correct |
26 ms |
5120 KB |
Output is correct |
5 |
Correct |
19 ms |
5120 KB |
Output is correct |
6 |
Correct |
21 ms |
5376 KB |
Output is correct |
7 |
Correct |
11 ms |
2944 KB |
Output is correct |
8 |
Correct |
29 ms |
7168 KB |
Output is correct |
9 |
Correct |
16 ms |
4096 KB |
Output is correct |
10 |
Correct |
34 ms |
8440 KB |
Output is correct |