Submission #3855682


Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <list>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <string>
#include <bitset>
#include <fstream>
#include <iomanip>

using namespace std;

typedef long long ll;
typedef long double db;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
typedef vector<pii> vii;

#define INF 1000000007ll
#define pb push_back
#define mp make_pair
#define err(x) cout<<#x<<"= "<<x<<endl;
#define rep(i,n) for(int i =0; i< n; i++)
#define ff first
#define ss second
#define cil(a,b) ( ((a)%(b) == 0)?((a)/(b)):((a)/(b)+1) )
#define SIZE 100010
#define eps 1e-13

int main(){
//	#ifdef ONLINE_JUDGE
//	freopen("little.in", "r" , stdin);
//	freopen("little.out", "w", stdout);
// cin.tie(false); cout.tie(false);	
//	#endif
	ios::sync_with_stdio(false);
	ll n,w,h;
	cin>>n>>h>>w;
	ll A[SIZE], x[SIZE];
	rep(i,n) cin>>x[i];
	rep(i,n) A[i] = 0;
	rep(i,n){
		A[i^1] = max(A[i^1],x[i]);
		A[i] = max(A[i], w-x[i]);
	}
	ll ans =0;
	rep(i,n){
		ans+= (w-A[i])*h;
	}
	cout<<ans<<endl;
	return 0;
};

Submission Info

Submission Time
Task A - Window
User Dipak
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1271 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 55
Set Name Test Cases
All 00_sample_00, 00_sample_01, 00_sample_02, 00_sample_03, 00_sample_04, 10_small_00, 10_small_01, 10_small_02, 10_small_03, 10_small_04, 10_small_05, 10_small_06, 10_small_07, 10_small_08, 10_small_09, 20_random_00, 20_random_01, 20_random_02, 20_random_03, 20_random_04, 20_random_05, 20_random_06, 20_random_07, 20_random_08, 20_random_09, 30_large_00, 30_large_01, 30_large_02, 30_large_03, 30_large_04, 30_large_05, 30_large_06, 30_large_07, 30_large_08, 30_large_09, 40_swap_00, 40_swap_01, 40_swap_02, 40_swap_03, 40_swap_04, 50_just_overlap_00, 50_just_overlap_01, 50_just_overlap_02, 50_just_overlap_03, 50_just_overlap_04, 60_reverse_00, 60_reverse_01, 60_reverse_02, 60_reverse_03, 60_reverse_04, 70_fixed_00, 70_fixed_01, 70_fixed_02, 70_fixed_03, 70_fixed_04
Case Name Status Exec Time Memory
00_sample_00 AC 1 ms 256 KB
00_sample_01 AC 1 ms 256 KB
00_sample_02 AC 1 ms 256 KB
00_sample_03 AC 1 ms 256 KB
00_sample_04 AC 1 ms 256 KB
10_small_00 AC 1 ms 256 KB
10_small_01 AC 1 ms 256 KB
10_small_02 AC 1 ms 256 KB
10_small_03 AC 1 ms 256 KB
10_small_04 AC 1 ms 256 KB
10_small_05 AC 1 ms 256 KB
10_small_06 AC 1 ms 256 KB
10_small_07 AC 1 ms 256 KB
10_small_08 AC 1 ms 256 KB
10_small_09 AC 1 ms 256 KB
20_random_00 AC 1 ms 256 KB
20_random_01 AC 1 ms 256 KB
20_random_02 AC 1 ms 256 KB
20_random_03 AC 1 ms 256 KB
20_random_04 AC 1 ms 256 KB
20_random_05 AC 1 ms 256 KB
20_random_06 AC 1 ms 256 KB
20_random_07 AC 1 ms 256 KB
20_random_08 AC 1 ms 256 KB
20_random_09 AC 1 ms 256 KB
30_large_00 AC 1 ms 256 KB
30_large_01 AC 1 ms 256 KB
30_large_02 AC 1 ms 256 KB
30_large_03 AC 1 ms 256 KB
30_large_04 AC 1 ms 256 KB
30_large_05 AC 1 ms 256 KB
30_large_06 AC 1 ms 256 KB
30_large_07 AC 1 ms 256 KB
30_large_08 AC 1 ms 256 KB
30_large_09 AC 1 ms 256 KB
40_swap_00 AC 1 ms 256 KB
40_swap_01 AC 1 ms 256 KB
40_swap_02 AC 1 ms 256 KB
40_swap_03 AC 1 ms 256 KB
40_swap_04 AC 1 ms 256 KB
50_just_overlap_00 AC 1 ms 256 KB
50_just_overlap_01 AC 1 ms 256 KB
50_just_overlap_02 AC 1 ms 256 KB
50_just_overlap_03 AC 1 ms 256 KB
50_just_overlap_04 AC 1 ms 256 KB
60_reverse_00 AC 1 ms 256 KB
60_reverse_01 AC 1 ms 256 KB
60_reverse_02 AC 1 ms 256 KB
60_reverse_03 AC 1 ms 256 KB
60_reverse_04 AC 1 ms 256 KB
70_fixed_00 AC 1 ms 256 KB
70_fixed_01 AC 1 ms 256 KB
70_fixed_02 AC 1 ms 256 KB
70_fixed_03 AC 1 ms 256 KB
70_fixed_04 AC 1 ms 256 KB