oj.uz

답안 #89444

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
89444 2018-12-14T15:08:13 Z Harvey_Rollens Chessboard (IZhO18_chessboard) C++17
39 / 100
 140 ms 2320 KB 
#include<bits/stdc++.h>
#define ll long long
#define st string
#define fr first
#define se second

const long long mod=1e9+7;

using namespace std;

vector<pair<ll, ll> > v;
ll a[100100], b[100100], k, ans=1000000100;

void f(ll x)
{
    for(ll i=1; i*i<=x; i++)
    {
        if(x%i==0)
        {
            v.push_back({i, x/i});
            if(i>1) v.push_back({x/i, i});
        }
    }
}

void pro(ll p, ll o)
{
    ll kb1=0, kb2=0;
    for(ll i=1; i<=k; i++)
    {
        ll x=a[i], y=b[i];

        x=(x+p-1)/p;
        y=(y+p-1)/p;

        if((x%2!=0 && y%2!=0) || (x%2==0 && y%2==0))
        {
            kb1++;
        }
        else kb2++;
    }

    //cout<<"kb1="<<kb1<<" kb2="<<kb2<<endl;

    kb2=kb2+((o*o)/2+(o*o)%2)*p*p-(k-kb2);
    kb1=kb1+((o*o)/2)*p*p-(k-kb1);

    //cout<<"PPP= "<<kb1<<" "<<kb2<<" "<<p<<" "<<o<<'\n';

    ans=min(kb1, min(ans, kb2));
}

main()
{
    //freopen("1.txt", "r", stdin);
    //freopen("1.txt", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    ll n;
    cin>>n>>k;

    f(n);

    for(ll i=1; i<=k; i++)
        cin>>a[i]>>b[i]>>a[i]>>b[i];

    for(ll i=0; i<v.size(); i++)
    {
        pro(v[i].fr, v[i].se);
    }

    cout<<ans;
    return 0;
}
/*
*/

Compilation message

chessboard.cpp:53:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
chessboard.cpp: In function 'int main()':
chessboard.cpp:69:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(ll i=0; i<v.size(); i++)
                 ~^~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
0 / 8.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1496 KB Output is correct
2 Correct 2 ms 1496 KB Output is correct
3 Correct 2 ms 1496 KB Output is correct
4 Correct 2 ms 1496 KB Output is correct
5 Correct 2 ms 1496 KB Output is correct
6 Correct 2 ms 1496 KB Output is correct
7 Correct 2 ms 1496 KB Output is correct
8 Correct 2 ms 1496 KB Output is correct
9 Correct 2 ms 1496 KB Output is correct
10 Correct 3 ms 1496 KB Output is correct
11 Correct 2 ms 1496 KB Output is correct
12 Correct 2 ms 1496 KB Output is correct
13 Correct 3 ms 1496 KB Output is correct
14 Correct 3 ms 1496 KB Output is correct
15 Correct 3 ms 1496 KB Output is correct
16 Correct 14 ms 1496 KB Output is correct
17 Correct 34 ms 2064 KB Output is correct
18 Correct 45 ms 2216 KB Output is correct
19 Correct 122 ms 2216 KB Output is correct
20 Correct 140 ms 2320 KB Output is correct
21 Correct 32 ms 2320 KB Output is correct
22 Correct 2 ms 2320 KB Output is correct
23 Correct 28 ms 2320 KB Output is correct
24 Correct 42 ms 2320 KB Output is correct
25 Correct 7 ms 2320 KB Output is correct
26 Correct 28 ms 2320 KB Output is correct
27 Correct 39 ms 2320 KB Output is correct
28 Correct 46 ms 2320 KB Output is correct
29 Correct 14 ms 2320 KB Output is correct
30 Correct 3 ms 2320 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 31 ms 1496 KB Output isn't correct
2 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 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Incorrect 31 ms 1496 KB Output isn't correct
10 Halted 0 ms 0 KB -