oj.uz

Submission #872664

# Submission time Handle Problem Language Result Execution time Memory
872664 2023-11-13T13:55:32 Z epicci23 Chessboard (IZhO18_chessboard) C++17
39 / 100
 2000 ms 18108 KB 
#include "bits/stdc++.h"
using namespace std;
#define int long long
#pragma GCC optimize ("O3") 
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define endl '\n'

/*
 implement and debug smart
 DONT GET STUCK ON ONE APPROACH
 write smth on paper
 edge cases (n=1?)
 rewrite the problem
 simplify
 transform the problem into other problem
*/


void solve(){

  int n,k;
  cin >> n >> k;
 
  vector<array<int,4>> v;

  int ans = n * n;

  for(int i=1;i<=k;i++){
     int a,b,c,d;
     cin >> a >> b >> c >> d;
     a--;
     b--;
     c--;
     d--;
     v.pb({a,b,c,d});
  }  
  
   auto f = [](array<int,4> a,array<int,4> b)->array<int,4>{
     int xl,xr,yl,yr;
     xl=max(a[0],b[0]);
     xr=min(a[2],b[2]);
     yl=max(a[1],b[1]);
     yr=min(a[3],b[3]);
     if(xl<=xr && yl<=yr) return {xl,yl,xr,yr};
     else return {-1,-1,-1,-1};
  };

  for(int i=1;i<n;i++){

  	if(n%i) continue;
    
    // 1 siyah
    // 0 beyaz

    int cur = 0;
    map<array<int,2>,vector<array<int,4>>> mp;

    int kac_siyah = (n / i) * ( (n / i) / 2);
    if((n/i)&1) kac_siyah +=  (n / i) / 2;

    for(auto x : v){
      int aa = x[0]-(x[0]%i);
      int bb = x[1]-(x[1]%i);

      for(int a=aa;a<=n;a+=i){
	       for(int b=bb;b<=n;b+=i){
		      if(f(x,{a,b,a+i-1,b+i-1})[0]!=-1)
		       mp[{a,b}].pb(f(x,{a,b,a+i-1,b+i-1}));
		      else break;
	       }
      }
    }

    for(auto x:mp){
      int col = (x.first[0] / i + x.first[1] / i) & 1;
      int hm = 0;
      for(auto y:x.second) hm+=(y[2]-y[0]+1)*(y[3]-y[1]+1);
      if(col) cur+=i*i-hm;
      else cur+=hm;
      if(col) kac_siyah--;
    }
    
    //cout << i << ": " << kac_siyah << endl;
    cur += kac_siyah * i * i;
    ans=min(ans,cur);
    
    cur=0;
    kac_siyah = (n / i) * ( (n/i) / 2);
    if((n/i)&1) kac_siyah +=  (n / i + 1) / 2;

    for(auto x:mp){
      int col = (x.first[0] / i + x.first[1] / i) & 1;
      col^=1;
      int hm = 0;
      for(auto y:x.second) hm+=(y[2]-y[0]+1)*(y[3]-y[1]+1);
      if(col) cur+=i*i-hm;
      else cur+=hm;
      if(col) kac_siyah--;
    }

    cur += kac_siyah * i * i;
    //cout << i << ": " << kac_siyah << endl;
    ans=min(ans,cur);
  }

  cout << ans << endl;
}

int32_t main(){
  cin.tie(0);
  ios::sync_with_stdio(0);
  
  int t=1;//cin >> t;
  while(t--) solve();
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2068 ms 5340 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 376 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 428 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 376 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 428 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 77 ms 4740 KB Output is correct
17 Correct 175 ms 13500 KB Output is correct
18 Correct 288 ms 16580 KB Output is correct
19 Correct 816 ms 16380 KB Output is correct
20 Correct 903 ms 16832 KB Output is correct
21 Correct 163 ms 12992 KB Output is correct
22 Correct 3 ms 344 KB Output is correct
23 Correct 188 ms 9156 KB Output is correct
24 Correct 262 ms 14600 KB Output is correct
25 Correct 31 ms 1756 KB Output is correct
26 Correct 159 ms 9160 KB Output is correct
27 Correct 281 ms 14780 KB Output is correct
28 Correct 332 ms 18108 KB Output is correct
29 Correct 65 ms 5528 KB Output is correct
30 Correct 8 ms 856 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2068 ms 5340 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Execution timed out 2068 ms 5340 KB Time limit exceeded
10 Halted 0 ms 0 KB -