oj.uz

Submission #673336

# Submission time Handle Problem Language Result Execution time Memory
673336 2022-12-20T08:55:01 Z Cutebol Chessboard (IZhO18_chessboard) C++17
8 / 100
 25 ms 1728 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define Scaramouche ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0);
#define int long long
#define itn int
#define endl "\n"
#define ff first
#define ss second
   
const int N = 2e5 + 5 ;
const int mod = 1e9 + 7 ;
const int inf = 1e12 ;

int n , k , m , sum , ans = inf ;
int x[N] , y[N] , cnt1[2] ;

void solve(){
	
	cin >> n >> m ;
	if ( m == 0 ){
		for ( int i = 1 ; i <= n/2 ; i ++ ){
			if ( !(n % i)){
				n /= i ;
				ans = min ( ans , (n*n/2)*i*i ) ;
				n *= i ;
			}
		}
		cout << ans ;
	}
	int cnt[2] ;
	cnt[1] = n*n/2 , cnt[0] = (n*n+1)/2 ;
	for ( int i = 0 ; i < m ; i ++ ){
		cin >> x[i] >> y[i] >> x[i] >> y[i] ;
		cnt[((x[i]%2)+(y[i]%2))%2] -- ;
		cnt1[((x[i]%2)+(y[i]%2))%2] ++ ;
	}
	cout << min ( cnt[0] + cnt1[1] , cnt[1] + cnt1[0] )  ;
}
 
signed main(){
//  fopn("blocks") ;
    Scaramouche ;
    int t = 1 ;
//    	cin >> t ;
    while ( t -- ) solve() ; 
}

Compilation message

chessboard.cpp: In function 'void fopn(std::string)':
chessboard.cpp:5:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
chessboard.cpp:5:72: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1236 KB Output is correct
2 Correct 5 ms 596 KB Output is correct
3 Correct 12 ms 880 KB Output is correct
4 Correct 12 ms 980 KB Output is correct
5 Correct 17 ms 1152 KB Output is correct
6 Correct 12 ms 852 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 10 ms 852 KB Output is correct
9 Correct 25 ms 1728 KB Output is correct
10 Correct 15 ms 1000 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1236 KB Output is correct
2 Correct 5 ms 596 KB Output is correct
3 Correct 12 ms 880 KB Output is correct
4 Correct 12 ms 980 KB Output is correct
5 Correct 17 ms 1152 KB Output is correct
6 Correct 12 ms 852 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 10 ms 852 KB Output is correct
9 Correct 25 ms 1728 KB Output is correct
10 Correct 15 ms 1000 KB Output is correct
11 Incorrect 1 ms 340 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -