oj.uz

답안 #500113

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
500113 2021-12-30T10:39:59 Z dostigator Chessboard (IZhO18_chessboard) C++14
16 / 100
 29 ms 2320 KB 
// author : lox
#pragma GCC optimize("O3")
#pragma GCC target("popcnt")
#include <bits/stdc++.h>
using namespace std;
#define IZhO_SILVER ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define popcnt __builtin_popcount
#define all(a) a.begin(),a.end()
#define low_b lower_bound
#define up_b upper_bound
#define vii vector<pair<ll,ll>>
#define vll vector<pair<ll,ll>>
#define pii pair<ll,ll>
#define mii map<ll,ll>
#define pll pair<ll,ll>
#define mll map<ll,ll>
#define vi vector<ll>
#define vl vector<ll>
#define pb push_back
#define endl '\n'
#define Y second
#define X first
typedef long double ld;
typedef long long ll;
const long long dx[4]={1,-1,0,0},dy[4]={0,0,1,-1},col=107,N=1e6+777;
const ll mod=1e9+7,inf=1e18;
void fre_open(){freopen("file.in","r",stdin);freopen("file.out","w",stdout);}
ll binpow(ll n,ll k){if(k<0)return 0ll;if(k==0)return 1ll;if(k%2)return (binpow(n,k-1)*n)%mod;ll kk=binpow(n,k/2)%mod;return (kk*kk)%mod;}
void solve(){
    ll n,k;
    cin>>n>>k;
    if(k==0){
        ll x=n*n/2;
        for(ll i=n/2; i>=1; --i)if(n%i==0)x=min(x,i*i*((n/i)*(n/i)/2));
        cout<<x;
        return;
    }
    ll x=n*n/2;
	ll x2=x+1;
	for(ll c=0, i1,i2,j1,j2;c<k; ++c){
		cin>>i1>>j1>>i2>>j2;
		for(ll i=i1; i<=i2; ++i)
			for(ll j=j1; j<=j2; ++j)
			{
				if(i%2==j%2) x++,x2--;
				if(i%2!=j%2) x2++,x--;
			}
	}
	cout<<min(x,x2);
}
int main() {
    //fre_open();
    IZhO_SILVER;
    ll tt=1;
    //cin>>tt;
    while(tt--) solve();
}

Compilation message

chessboard.cpp: In function 'void fre_open()':
chessboard.cpp:27:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 | void fre_open(){freopen("file.in","r",stdin);freopen("file.out","w",stdout);}
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
chessboard.cpp:27:53: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 | void fre_open(){freopen("file.in","r",stdin);freopen("file.out","w",stdout);}
      |                                              ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 204 KB Output is correct
2 Correct 6 ms 588 KB Output is correct
3 Correct 15 ms 1180 KB Output is correct
4 Correct 15 ms 1048 KB Output is correct
5 Correct 19 ms 1556 KB Output is correct
6 Correct 12 ms 1120 KB Output is correct
7 Correct 2 ms 452 KB Output is correct
8 Correct 10 ms 1060 KB Output is correct
9 Correct 29 ms 2320 KB Output is correct
10 Correct 14 ms 1448 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 204 KB Output is correct
2 Correct 6 ms 588 KB Output is correct
3 Correct 15 ms 1180 KB Output is correct
4 Correct 15 ms 1048 KB Output is correct
5 Correct 19 ms 1556 KB Output is correct
6 Correct 12 ms 1120 KB Output is correct
7 Correct 2 ms 452 KB Output is correct
8 Correct 10 ms 1060 KB Output is correct
9 Correct 29 ms 2320 KB Output is correct
10 Correct 14 ms 1448 KB Output is correct
11 Incorrect 1 ms 204 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 17 ms 204 KB Output is correct
10 Correct 6 ms 588 KB Output is correct
11 Correct 15 ms 1180 KB Output is correct
12 Correct 15 ms 1048 KB Output is correct
13 Correct 19 ms 1556 KB Output is correct
14 Correct 12 ms 1120 KB Output is correct
15 Correct 2 ms 452 KB Output is correct
16 Correct 10 ms 1060 KB Output is correct
17 Correct 29 ms 2320 KB Output is correct
18 Correct 14 ms 1448 KB Output is correct
19 Incorrect 1 ms 204 KB Output isn't correct
20 Halted 0 ms 0 KB -