oj.uz

Submission #1063833

# Submission time Handle Problem Language Result Execution time Memory
1063833 2024-08-18T04:03:19 Z 12345678 Hexagonal Territory (APIO21_hexagon) C++17
9 / 100
 1 ms 600 KB 
#include "hexagon.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const ll mod=1e9+7;

ll a, b, k;

ll binpow(ll vl, ll idx)
{
    if (idx==0) return 1;
    ll tmp=binpow(vl, idx/2);
    if (idx%2) return (((tmp*tmp)%mod)*vl)%mod;
    else return (tmp*tmp)%mod;
}

int draw_territory(int N, int A, int B, std::vector<int> D, std::vector<int> L) {
    a=A, b=B, k=L[0]+1;
    ll x=((((k)*(k+1)/2)%mod)*a)%mod;
    //cout<<"binpow "<<binpow(6, mod-2)<<'\n';
    //cout<<"rev "<<(binpow(6, mod-2)*6)%mod<<'\n';
    ll y=(((((((b*(k-1))%mod)*(k))%mod)*(2*k-1))%mod)*binpow(6, mod-2))%mod;
    //cout<<"here "<<y<<'\n';
    y=(((y+(((k)*(k-1)/2)%mod)*b)%mod)%mod+mod)%mod;
    return (x+y)%mod;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 356 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 352 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 11.0

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

Subtask #4
0 / 12.0

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

Subtask #5
0 / 15.0

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

Subtask #6
0 / 19.0

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

Subtask #7
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 436 KB Output is correct
2 Correct 0 ms 352 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 1 ms 352 KB Output is correct
5 Incorrect 0 ms 352 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

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