oj.uz

Submission #981713

# Submission time Handle Problem Language Result Execution time Memory
981713 2024-05-13T13:39:05 Z IUA_Hasin Hexagonal Territory (APIO21_hexagon) C++17
9 / 100
 1 ms 500 KB 
#include "hexagon.h"
#include <bits/stdc++.h>

#define ll                            long long

using namespace std;

const ll mod = 1e9+7;



int draw_territory(int N, int A, int B, std::vector<int> D, std::vector<int> L) {
        ll len = L[0]+1; 
        ll count = ((len)*(len+1))/2;
        count = count%mod;
        ll a1 = len-1;
        ll a2 = len;
        ll a3 = len+1;
        if(a1%3==0){
          a1 = a1/3;
        } else if(a2%3==0){
          a2 = a2/3; 
        } else {
          a3 = a3/3;
        }

        ll d = a1*a2;
        d = d%mod;
        d = d*a3;
        d = d%mod;
        ll a = d*B;
        a = a%mod;
        ll b = count*A;
        b = b%mod;
        ll ans = a+b;
        ans = ans%mod;

        //cout << len << " " << count << " " << d << " " << a << " " << b << " " << ans << endl;

        

       return ans;
}

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 0 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 500 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 432 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 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 348 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 1 ms 348 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Incorrect 1 ms 348 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 344 KB Output isn't correct
2 Halted 0 ms 0 KB -