oj.uz

답안 #173867

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
173867 2020-01-05T16:10:26 Z juggernaut Chessboard (IZhO18_chessboard) C++14
47 / 100
 2000 ms 3576 KB 
//Just try and the idea will come
#include<bits/stdc++.h>
#define int long long int
#define fr first
#define sc second
using namespace std;
int n,k,i,j,x,y,res;
pair<int,int>p1[100001],p2[100001];
int get_x(int k,int x,int white){
    int res;
    if(white)res=((x/k+1)/2)*k;
    else res=((x/k)/2)*k;
    if(((x+k-1)/k)%2==white)res+=(x%k);
    return res;
}
int get_xy(int k,int y,int x){
    if(x==0||y==0)return 0;
    int res=(((x/k)*(y/k)+1)/2)*k*k,a,b;
    a=(x+k-1)/k;b=(y+k-1)/k;
    res+=(x%k)*get_x(k,y,a%2);
    res+=(y%k)*get_x(k,x,b%2);
    if(!((a+b)&1))res-=(x%k)*(y%k);
    return res;
}
int get_range(int k,int x,int y,int x2,int y2){
    return get_xy(k,x2,y2)+get_xy(k,x-1,y-1)-get_xy(k,x-1,y2)-get_xy(k,x2,y-1);
}
int get(int f){
    int cnt=0,c[2],wh,bl;
    c[0]=f*f*(((n/f)*(n/f))/2);
    c[1]=f*f*(((n/f)*(n/f)+1)/2);
    for(int i=0;i<k;i++){
        //c[(p[i].fr/f+p[i].sc/f)%2]++;
        wh=get_range(f,p1[i].first,p1[i].second,p2[i].first,p2[i].second);
        bl=(abs(p1[i].second-p2[i].second)+1)*(abs(p1[i].first-p2[i].first)+1)-wh;
        c[0]-=bl;
        c[0]+=wh;
        swap(bl,wh);
        c[1]-=bl;
        c[1]+=wh;
    }
    return min(c[0],c[1]);
}
main(){
    scanf("%lld%lld",&n,&k);
    for(i=0;i<k;i++){
        scanf("%lld%lld%lld%lld",&p1[i].fr,&p1[i].sc,&p2[i].fr,&p2[i].sc);
    }
    res=get(1);
    for(j=2;j*j<=n;j++){
        if(n%j==0){
            res=min(res,get(j));
            res=min(res,get(n/j));
        }
    }
    printf("%lld",res);
}
/*
int get_x(int k,int x,int white){
    int res;
    if(white)res=((x/k+1)/2)*k;
    else res=((x/k)/2)*k;
    if(((x+k-1)/k)%2==white)res+=(x%k);
    return res;
}
int get_xy(int k,int y,int x){
    int res=(((x/k)*(y/k)+1)/2)*k*k,a,b;
    a=(x+k-1)/k;b=(y+k-1)/k;
    res+=(x%k)*get_x(k,y,a%2);
    res+=(y%k)*get_x(k,x,b%2);
    if(!((a+b)&1))res-=(x%k)*(y%k);
    return res;
}
*/

Compilation message

chessboard.cpp: In function 'long long int get(long long int)':
chessboard.cpp:29:9: warning: unused variable 'cnt' [-Wunused-variable]
     int cnt=0,c[2],wh,bl;
         ^~~
chessboard.cpp: At global scope:
chessboard.cpp:44:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
chessboard.cpp: In function 'int main()':
chessboard.cpp:45:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld%lld",&n,&k);
     ~~~~~^~~~~~~~~~~~~~~~~~
chessboard.cpp:47:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld%lld%lld",&p1[i].fr,&p1[i].sc,&p2[i].fr,&p2[i].sc);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 2360 KB Output is correct
2 Correct 14 ms 892 KB Output is correct
3 Correct 31 ms 1596 KB Output is correct
4 Correct 34 ms 1912 KB Output is correct
5 Correct 41 ms 2040 KB Output is correct
6 Correct 27 ms 1400 KB Output is correct
7 Correct 8 ms 632 KB Output is correct
8 Correct 27 ms 1400 KB Output is correct
9 Correct 68 ms 3064 KB Output is correct
10 Correct 40 ms 1912 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 3 ms 380 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 4 ms 504 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 3 ms 380 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 4 ms 504 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 34 ms 1144 KB Output is correct
17 Correct 57 ms 2936 KB Output is correct
18 Correct 115 ms 3576 KB Output is correct
19 Correct 622 ms 3124 KB Output is correct
20 Correct 696 ms 3448 KB Output is correct
21 Correct 55 ms 2808 KB Output is correct
22 Correct 4 ms 376 KB Output is correct
23 Correct 92 ms 1656 KB Output is correct
24 Correct 108 ms 3192 KB Output is correct
25 Correct 20 ms 632 KB Output is correct
26 Correct 66 ms 2168 KB Output is correct
27 Correct 114 ms 2428 KB Output is correct
28 Correct 111 ms 3360 KB Output is correct
29 Correct 24 ms 1400 KB Output is correct
30 Correct 3 ms 376 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 2360 KB Output is correct
2 Correct 14 ms 892 KB Output is correct
3 Correct 31 ms 1596 KB Output is correct
4 Correct 34 ms 1912 KB Output is correct
5 Correct 41 ms 2040 KB Output is correct
6 Correct 27 ms 1400 KB Output is correct
7 Correct 8 ms 632 KB Output is correct
8 Correct 27 ms 1400 KB Output is correct
9 Correct 68 ms 3064 KB Output is correct
10 Correct 40 ms 1912 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 3 ms 380 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 4 ms 504 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 4 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 34 ms 1144 KB Output is correct
27 Correct 57 ms 2936 KB Output is correct
28 Correct 115 ms 3576 KB Output is correct
29 Correct 622 ms 3124 KB Output is correct
30 Correct 696 ms 3448 KB Output is correct
31 Correct 55 ms 2808 KB Output is correct
32 Correct 4 ms 376 KB Output is correct
33 Correct 92 ms 1656 KB Output is correct
34 Correct 108 ms 3192 KB Output is correct
35 Correct 20 ms 632 KB Output is correct
36 Correct 66 ms 2168 KB Output is correct
37 Correct 114 ms 2428 KB Output is correct
38 Correct 111 ms 3360 KB Output is correct
39 Correct 24 ms 1400 KB Output is correct
40 Correct 3 ms 376 KB Output is correct
41 Correct 508 ms 2960 KB Output is correct
42 Correct 116 ms 3324 KB Output is correct
43 Correct 270 ms 3004 KB Output is correct
44 Correct 114 ms 3192 KB Output is correct
45 Correct 77 ms 3424 KB Output is correct
46 Correct 570 ms 3192 KB Output is correct
47 Correct 65 ms 3068 KB Output is correct
48 Correct 194 ms 3064 KB Output is correct
49 Correct 105 ms 2936 KB Output is correct
50 Execution timed out 2055 ms 3192 KB Time limit exceeded
51 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 252 KB Output is correct
9 Correct 48 ms 2360 KB Output is correct
10 Correct 14 ms 892 KB Output is correct
11 Correct 31 ms 1596 KB Output is correct
12 Correct 34 ms 1912 KB Output is correct
13 Correct 41 ms 2040 KB Output is correct
14 Correct 27 ms 1400 KB Output is correct
15 Correct 8 ms 632 KB Output is correct
16 Correct 27 ms 1400 KB Output is correct
17 Correct 68 ms 3064 KB Output is correct
18 Correct 40 ms 1912 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 3 ms 380 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 4 ms 504 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 2 ms 380 KB Output is correct
31 Correct 4 ms 376 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 34 ms 1144 KB Output is correct
35 Correct 57 ms 2936 KB Output is correct
36 Correct 115 ms 3576 KB Output is correct
37 Correct 622 ms 3124 KB Output is correct
38 Correct 696 ms 3448 KB Output is correct
39 Correct 55 ms 2808 KB Output is correct
40 Correct 4 ms 376 KB Output is correct
41 Correct 92 ms 1656 KB Output is correct
42 Correct 108 ms 3192 KB Output is correct
43 Correct 20 ms 632 KB Output is correct
44 Correct 66 ms 2168 KB Output is correct
45 Correct 114 ms 2428 KB Output is correct
46 Correct 111 ms 3360 KB Output is correct
47 Correct 24 ms 1400 KB Output is correct
48 Correct 3 ms 376 KB Output is correct
49 Correct 508 ms 2960 KB Output is correct
50 Correct 116 ms 3324 KB Output is correct
51 Correct 270 ms 3004 KB Output is correct
52 Correct 114 ms 3192 KB Output is correct
53 Correct 77 ms 3424 KB Output is correct
54 Correct 570 ms 3192 KB Output is correct
55 Correct 65 ms 3068 KB Output is correct
56 Correct 194 ms 3064 KB Output is correct
57 Correct 105 ms 2936 KB Output is correct
58 Execution timed out 2055 ms 3192 KB Time limit exceeded
59 Halted 0 ms 0 KB -