oj.uz

Submission #58128

# Submission time Handle Problem Language Result Execution time Memory
58128 2018-07-16T23:50:58 Z Benq Chessboard (IZhO18_chessboard) C++14
39 / 100
 198 ms 19252 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

ll N,K,ans;
vector<pair<pi,pi>> v;

ll solve(int x, int y, int len) {
    int X = x%(2*len), Y = y%(2*len);
    // suppose bottom left square is black 
    ll z = (x/(2*len))*len;
    z += min(X,len);
    
    ll res = (y/(2*len))*len*x;
    res += min(Y,len)*z;
    res += max(Y-len,0)*(x-z);
    return res;
}

ll correct(pair<pi,pi> a, int len) {
    return solve(a.f.s,a.s.s,len)-solve(a.f.f-1,a.s.s,len)-solve(a.f.s,a.s.f-1,len)+solve(a.f.f-1,a.s.f-1,len);
}

ll area(pair<pi,pi> a) {
    return (ll)(a.f.s-a.f.f+1)*(a.s.s-a.s.f+1);
}

ll solve(int len) {
    ll ans = N*N-correct({{1,N},{1,N}},len);
    for (auto a: v) {
        ll x = correct(a,len);
        ans -= (area(a)-x);
        ans += x;
    }
    return ans;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> K;
    F0R(i,K) {
        pair<pi,pi> t; cin >> t.f.f >> t.s.f >> t.f.s >> t.s.s;
        v.pb(t);
    }
    FOR(i,1,N) if (N % i == 0) {
        ll t = solve(i);
        t = max(t,N*N-t);
        ans = max(ans,t);
    }
    cout << N*N-ans;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 4 ms 600 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 804 KB Output is correct
7 Correct 2 ms 804 KB Output is correct
8 Correct 3 ms 804 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 3300 KB Output is correct
2 Correct 18 ms 3300 KB Output is correct
3 Incorrect 28 ms 4660 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4660 KB Output is correct
2 Correct 3 ms 4660 KB Output is correct
3 Correct 3 ms 4660 KB Output is correct
4 Correct 3 ms 4660 KB Output is correct
5 Correct 3 ms 4660 KB Output is correct
6 Correct 3 ms 4660 KB Output is correct
7 Correct 3 ms 4660 KB Output is correct
8 Correct 3 ms 4660 KB Output is correct
9 Correct 2 ms 4660 KB Output is correct
10 Correct 3 ms 4660 KB Output is correct
11 Correct 3 ms 4660 KB Output is correct
12 Correct 3 ms 4660 KB Output is correct
13 Correct 5 ms 4660 KB Output is correct
14 Correct 4 ms 4660 KB Output is correct
15 Correct 4 ms 4660 KB Output is correct
16 Correct 21 ms 4768 KB Output is correct
17 Correct 45 ms 7632 KB Output is correct
18 Correct 67 ms 9100 KB Output is correct
19 Correct 185 ms 10600 KB Output is correct
20 Correct 198 ms 12028 KB Output is correct
21 Correct 41 ms 13640 KB Output is correct
22 Correct 3 ms 13640 KB Output is correct
23 Correct 35 ms 13640 KB Output is correct
24 Correct 89 ms 15700 KB Output is correct
25 Correct 10 ms 15700 KB Output is correct
26 Correct 40 ms 15700 KB Output is correct
27 Correct 52 ms 17920 KB Output is correct
28 Correct 57 ms 19252 KB Output is correct
29 Correct 21 ms 19252 KB Output is correct
30 Correct 4 ms 19252 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 3300 KB Output is correct
2 Correct 18 ms 3300 KB Output is correct
3 Incorrect 28 ms 4660 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 4 ms 600 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 804 KB Output is correct
7 Correct 2 ms 804 KB Output is correct
8 Correct 3 ms 804 KB Output is correct
9 Correct 38 ms 3300 KB Output is correct
10 Correct 18 ms 3300 KB Output is correct
11 Incorrect 28 ms 4660 KB Output isn't correct
12 Halted 0 ms 0 KB -