oj.uz

답안 #444992

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
444992 2021-07-16T07:48:28 Z Khizri Fancy Fence (CEOI20_fancyfence) C++17
73 / 100
 1000 ms 8444 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5;
ll t=1,n,arr[mxn],h[mxn];
ll cal(ll k,ll sum){
	sum=sum%MOD;
	ll a=k;
	ll b=k+1;
	if(a%2==0){
		a/=2;
	}
	else{
		b/=2;
	}
	ll x=(a*b)%MOD;
	a=sum;
	b=sum+1;
	if(a%2==0){
		a/=2;
	}
	else{
		b/=2;
	}
	ll y=(a*b)%MOD;
	ll ans=(x*y)%MOD;
	return ans;
}
void solve(){
	ll ans=0;
	ll sum=0,k=0;
	set<ll>st;
	cin>>n;
	bool q=true;
	for(int i=1;i<=n;i++){
		cin>>h[i];
		st.insert(h[i]);
		if(i>1&&h[i]<h[i-1]){
			q=false;
		}
	}
	for(int i=1;i<=n;i++){
		cin>>arr[i];
		sum+=arr[i];
	}
	if(q){
		for(int i=1;i<=n;i++){
			ll say=cal(h[i],sum)-cal(h[i-1],sum);
			if(say<0){
				say+=MOD;
			}
			ans=(ans+say)%MOD;
			sum-=arr[i];
		}
		cout<<ans<<endl;
		return;
	}
	ll x=0;
	for(ll k:st){
		ll sum=0;
		for(int i=1;i<=n;i++){
			if(h[i]<k){
				if(sum>0){
					ll say=cal(k,sum)-cal(x,sum);
					if(say<0){
						say+=MOD;
					}
					ans=(ans+say)%MOD;
					sum=0;
				}
			}
			else{
				sum+=arr[i];
			}
		}
		if(sum>0){
			ll say=cal(k,sum)-cal(x,sum);
			if(say<0){
				say+=MOD;
			}
			ans=(ans+say)%MOD;
			sum=0;
		}
		x=k;
	}
	cout<<ans<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Compilation message

fancyfence.cpp: In function 'void solve()':
fancyfence.cpp:69:11: warning: unused variable 'k' [-Wunused-variable]
   69 |  ll sum=0,k=0;
      |           ^

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 7 ms 332 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 12 ms 1036 KB Output is correct
4 Correct 23 ms 1752 KB Output is correct
5 Correct 23 ms 1832 KB Output is correct
6 Correct 20 ms 1864 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 14 ms 1104 KB Output is correct
4 Correct 28 ms 1868 KB Output is correct
5 Correct 31 ms 1800 KB Output is correct
6 Correct 1 ms 204 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 15 ms 1068 KB Output is correct
5 Correct 29 ms 1868 KB Output is correct
6 Correct 30 ms 1860 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 5 ms 844 KB Output is correct
9 Correct 22 ms 1992 KB Output is correct
10 Correct 51 ms 6488 KB Output is correct
11 Correct 52 ms 6496 KB Output is correct
12 Correct 0 ms 204 KB Output is correct

Subtask #6
18.0 / 18.0

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

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 7 ms 332 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 8 ms 332 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 11 ms 1032 KB Output is correct
12 Correct 22 ms 1868 KB Output is correct
13 Correct 23 ms 1872 KB Output is correct
14 Correct 20 ms 1868 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 572 KB Output is correct
17 Correct 15 ms 1048 KB Output is correct
18 Correct 30 ms 1772 KB Output is correct
19 Correct 31 ms 1796 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 6 ms 844 KB Output is correct
22 Correct 22 ms 2028 KB Output is correct
23 Correct 50 ms 6540 KB Output is correct
24 Correct 52 ms 8444 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 7 ms 404 KB Output is correct
28 Correct 6 ms 332 KB Output is correct
29 Correct 5 ms 332 KB Output is correct
30 Correct 686 ms 1096 KB Output is correct
31 Correct 705 ms 1124 KB Output is correct
32 Correct 51 ms 1972 KB Output is correct
33 Execution timed out 1088 ms 4380 KB Time limit exceeded
34 Halted 0 ms 0 KB -