-
Notifications
You must be signed in to change notification settings - Fork 80
/
FraudulentActivityNotifications.js
77 lines (52 loc) · 1.7 KB
/
FraudulentActivityNotifications.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
'use strict';
const fs = require('fs');
process.stdin.resume();
process.stdin.setEncoding('utf-8');
let inputString = '';
let currentLine = 0;
process.stdin.on('data', inputStdin => {
inputString += inputStdin;
});
process.stdin.on('end', _ => {
inputString = inputString.replace(/\s*$/, '')
.split('\n')
.map(str => str.replace(/\s*$/, ''));
main();
});
function readLine() {
return inputString[currentLine++];
}
// Complete the activityNotifications function below.
function activityNotifications(expenditure, d) {
// Number of notifications
let n = 0
// Set midpoints for median calculation
let [ i1, i2 ] = [ Math.floor((d-1)/2), Math.ceil((d-1)/2) ]
let m1, m2, m
// Initialize count sorted subarray
let cs = new Array(201).fill(0)
for (let i = d-1; i >= 0; i--) cs[expenditure[i]]++
// Iterate through expenditures
for (let i = d, l = expenditure.length; i < l; i++) {
// Find median
for (let j = 0, k = 0; k <= i1; k += cs[j], j++) m1 = j
for (let j = 0, k = 0; k <= i2; k += cs[j], j++) m2 = j
let m = (m1 + m2) / 2
// Check if notification is given
if (expenditure[i] >= m * 2) n++
// Replace subarray elements
cs[expenditure[i-d]]--
cs[expenditure[i]]++
}
return n
}
function main() {
const ws = fs.createWriteStream(process.env.OUTPUT_PATH);
const nd = readLine().split(' ');
const n = parseInt(nd[0], 10);
const d = parseInt(nd[1], 10);
const expenditure = readLine().split(' ').map(expenditureTemp => parseInt(expenditureTemp, 10));
let result = activityNotifications(expenditure, d);
ws.write(result + "\n");
ws.end();
}