oj.uz

답안 #745947

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
745947 2023-05-21T09:52:48 Z vjudge1 Fancy Fence (CEOI20_fancyfence) C++17
13 / 100
 52 ms 1404 KB 
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

const long long MOD=1e9+7;

int main() {
	long long n;
	cin>>n;
	vector<long long> h(n);
	long long wossz=0, ans=0;
	for(long long i=0; i<n; i++){
		cin>>h[i];
	}
	vector<long long> ket;
	long long a;
	cin>>a;
	if(h[0]==2) ket.push_back(a);
	wossz+=a;
	for(long long i=1; i<n; i++){
		cin>>a;
		if(h[i]==h[i-1] && h[i]==2){
			ket.back()=(ket.back()+a)%MOD;
		}
		else if(h[i]==2){
			ket.push_back(a);
		}
		wossz=(wossz+a)%MOD;
	}
	for(long long x : ket){
		ans=(ans+(x*(x+1)%MOD))%MOD;
	}
	ans=(ans+(wossz*(wossz+1)/2)%MOD)%MOD;
	cout<<ans<<"\n";
}

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 30 ms 960 KB Output is correct
4 Correct 52 ms 1200 KB Output is correct
5 Correct 52 ms 1404 KB Output is correct
6 Correct 48 ms 1216 KB Output is correct

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -