oj.uz

Submission #421613

# Submission time Handle Problem Language Result Execution time Memory
421613 2021-06-09T10:01:13 Z tinjyu Hexagonal Territory (APIO21_hexagon) C++14
12 / 100
 13 ms 2980 KB 
#include "hexagon.h"

#include <vector>
#include <iostream>
#include <cmath>
using namespace std;
long long int n,a,b,d[1000005],l[1000005],x[1000005],y[1000005];
int draw_territory(int N, int A, int B,std::vector<int> D, std::vector<int> L) {
	n=N;
	a=A;
	b=B;
	long long int p=0;
	for(int i=0;i<n;i++)
	{
		d[i]=D[i];
		l[i]=L[i];
		p+=l[i];
	}
	long long int nowx=0,nowy=0;
	long long int cnt=1;
	for(int i=0;i<n;i++)
	{
		if(d[i]==1)nowy+=l[i];
		if(d[i]==2)nowy+=l[i],nowx+=l[i];
		if(d[i]==3)nowx+=l[i];
		if(d[i]==4)nowy-=l[i];
		if(d[i]==5)nowy-=l[i],nowx-=l[i];
		if(d[i]==6)nowx-=l[i];
		x[cnt]=nowx;
		y[cnt]=nowy;
		cnt++;
	}
	long long int ans=0;
	for(int i=0;i<cnt;i++)
	{
		ans+=x[i]*y[i+1]-y[i]*x[i+1];
		//if(ans<0)ans+=1000000007;
		//if(ans>=1000000007)ans-=1000000007;
	}
	ans=abs(ans);
	//cout<<ans<<endl;
	long long int tmp=(ans-p+2)/2;
	//cout<<tmp<<" "<<p<<endl; 
	return (tmp+p)*a%1000000007;
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

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

Subtask #3
0 / 11.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 6 ms 700 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 3 ms 716 KB Output is correct
7 Correct 9 ms 1956 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 12 ms 2804 KB Output is correct
12 Correct 11 ms 2816 KB Output is correct
13 Correct 10 ms 2572 KB Output is correct
14 Correct 13 ms 2980 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct

Subtask #5
0 / 15.0

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

Subtask #6
0 / 19.0

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

Subtask #7
0 / 18.0

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

Subtask #8
0 / 16.0

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