oj.uz

Submission #878189

# Submission time Handle Problem Language Result Execution time Memory
878189 2023-11-24T06:59:21 Z _unknown_2010 Chessboard (IZhO18_chessboard) C++17
39 / 100
 111 ms 262144 KB 
//#ifndef LOCAL
//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#endif

#include <bits/stdc++.h>
using namespace std;
using vecp = vector<pair<int,int>>;
#define vecm(a,n,m) vector<vector<int>>a(n,vector<int>(m,0));
#define int int64_t
#define pb  push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mpii map<int,int>
#define lb lower_bound
#define ub upper_bound
#define foor(i,a,b) for(int i=a;i<b; i++)
#define foor(i,a) foor(i,0,a)
#define ins insert
#define ss second
#define ff first
#define until(x, a) for (auto x : a)
#define ln(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define seea(a,n) for(int i=0;i<n;i++){cin>>a[i];}
#define seev(v,n) for(int i=0;i<n;i++){int x; cin>>x; v.push_back(x);}
const int mod = 1E9+7;
bool tub(int n){
    for(int i=2; i*i<=n; i++){
        if(n%i==0)return false;
    }
    return true;
}
void solution(){
    int n,k;
    cin >> n >> k;
    vector<vector<int>> vec(n,vector<int>(n,0));
    vector<int> mx;
    int cnt=0;
    int x=k;
    while(k--){
        int a,b,c,d;
        cin >> a >> b >> c >> d;
        a--;b--;c--;d--;
        for(int i=a; i<=c; i++){
            for(int j=b; j<=d; j++){
                vec[i][j]=1;
            }
        }
        if(a==d && b==d)cnt++;
    }
    if(tub(n) && cnt==x && cnt!=x){
        int f=n/2*(n/2+1)*2;
        k=x;
        int s=(n/2+1)*(n/2+1)+(n/2)*(n/2);
    while(k--){
        int a,b,c,d;
        cin >> a >> b >> c >> d;
        a--;b--;
        if(a%2==b%2){
            s--;f++;
        }
        else {
            s++;f--;
        }
    }
        cout << min(s,f);
        return;
    }
    cnt=0;
    for(int i=1; i<=n/2; i++){
        if(n%i==0){
            int x=n/i;
            int f=1e18,s=1e18;
            if(x%2==0){
                f=s=(i*i)*x/2*n/i;
            }
            else {
                s=x/2*(x/2+1)*2*(i*i);
                f=(i*i)*((x/2+1)*(x/2+1)+(x/2)*(x/2));
            }
            for(int k=0; k<n; k++){
                for(int j=0; j<n; j++){
                    int fg=k/i+1;
                    int sg=j/i+1;
                    if(vec[k][j]==1){
                        cnt++;
                        if(fg%2==sg%2){
                            s++;f--;
                        }
                        else {
                            f++;s--;
                        }
                    }
                }
            }
            mx.push_back(f);
            mx.push_back(s);
        }
        cnt=0;
    }
    sort(all(mx));
    cout << mx[0];
}
int32_t main(){
    clock_t tStart = clock();
    std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int q = 1; // cin >> q;
    while(q--) {
        solution();
        cout << '\n';
    }
    cerr<<fixed<<setprecision(3)<<"\nTime Taken: "<<(double)(clock()- tStart)/CLOCKS_PER_SEC<<endl;
}
/*

██╗  ██╗ █████╗  ██████╗     ██╗██╗   ██╗ ██████╗████████╗
██║░░██║██╔══██╗██╔════╝░░░░░██║██║░░░██║██╔════╝╚══██╔══╝
███████║██║░░██║╚█████╗░░░░░░██║██║░░░██║╚█████╗░░░░██║░░░
██╔══██║██║░░██║░╚═══██╗██╗░░██║██║░░░██║░╚═══██╗░░░██║░░░
██║░░██║╚█████╔╝██████╔╝╚█████╔╝╚██████╔╝██████╔╝░░░██║░░░
╚═╝░░╚═╝░╚════╝░╚═════╝░░╚════╝░░╚═════╝░╚═════╝░░░░╚═╝░░░
*/

Compilation message

chessboard.cpp:19: warning: "foor" redefined
   19 | #define foor(i,a) foor(i,0,a)
      | 
chessboard.cpp:18: note: this is the location of the previous definition
   18 | #define foor(i,a,b) for(int i=a;i<b; i++)
      |

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 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 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 Runtime error 111 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 10 ms 7576 KB Output is correct
17 Correct 21 ms 8028 KB Output is correct
18 Correct 31 ms 8028 KB Output is correct
19 Correct 63 ms 7516 KB Output is correct
20 Correct 64 ms 7512 KB Output is correct
21 Correct 22 ms 8028 KB Output is correct
22 Correct 9 ms 8284 KB Output is correct
23 Correct 17 ms 7692 KB Output is correct
24 Correct 26 ms 8028 KB Output is correct
25 Correct 8 ms 7772 KB Output is correct
26 Correct 17 ms 7516 KB Output is correct
27 Correct 22 ms 7776 KB Output is correct
28 Correct 27 ms 7516 KB Output is correct
29 Correct 11 ms 7768 KB Output is correct
30 Correct 4 ms 8028 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 111 ms 262144 KB Execution killed with signal 9
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 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Runtime error 111 ms 262144 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -