oj.uz

답안 #444989

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
444989 2021-07-16T07:43:33 Z Khizri Fancy Fence (CEOI20_fancyfence) C++17
58 / 100
 1000 ms 8384 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;
	for(int i=1;i<=n;i++){
		cin>>h[i];
		st.insert(h[i]);
	}
	for(int i=1;i<=n;i++){
		cin>>arr[i];
		sum+=arr[i];
	}
	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 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

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 1608 KB Output is correct
4 Correct 22 ms 2960 KB Output is correct
5 Correct 23 ms 3012 KB Output is correct
6 Correct 21 ms 3032 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 13 ms 1100 KB Output is correct
4 Correct 25 ms 1808 KB Output is correct
5 Correct 30 ms 1992 KB Output is correct
6 Correct 0 ms 204 KB Output is correct

Subtask #5
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 13 ms 1060 KB Output is correct
5 Correct 26 ms 1764 KB Output is correct
6 Correct 29 ms 1848 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 89 ms 844 KB Output is correct
9 Correct 715 ms 2112 KB Output is correct
10 Execution timed out 1091 ms 6476 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #6
18.0 / 18.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 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 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 388 KB Output is correct
15 Correct 4 ms 332 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 0 ms 204 KB Output is correct
4 Correct 7 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 0 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 1592 KB Output is correct
12 Correct 22 ms 3052 KB Output is correct
13 Correct 22 ms 2996 KB Output is correct
14 Correct 21 ms 2972 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 588 KB Output is correct
17 Correct 13 ms 2036 KB Output is correct
18 Correct 25 ms 3784 KB Output is correct
19 Correct 29 ms 3876 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 88 ms 1100 KB Output is correct
22 Correct 723 ms 3040 KB Output is correct
23 Execution timed out 1092 ms 8384 KB Time limit exceeded
24 Halted 0 ms 0 KB -