// Two-Pass Window Function Simulation
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define MAX_EVENT_TYPES 100
#define MAX_BUSINESSES 1000

struct EventTypeAvg {
    char event_type[50];
    double sum;
    int count;
    double avg;
};

int* findActiveBusinessesWindow(struct Event* events, int eventCount, int* resultSize) {
    struct EventTypeAvg eventAvgs[MAX_EVENT_TYPES];
    int avgCount = 0;
    
    // Pass 1: Calculate averages
    for (int i = 0; i < eventCount; i++) {
        char* eventType = events[i].event_type;
        int occurrences = events[i].occurrences;
        
        // Find or create event type entry
        int found = -1;
        for (int j = 0; j < avgCount; j++) {
            if (strcmp(eventAvgs[j].event_type, eventType) == 0) {
                found = j;
                break;
            }
        }
        
        if (found == -1) {
            strcpy(eventAvgs[avgCount].event_type, eventType);
            eventAvgs[avgCount].sum = occurrences;
            eventAvgs[avgCount].count = 1;
            avgCount++;
        } else {
            eventAvgs[found].sum += occurrences;
            eventAvgs[found].count++;
        }
    }
    
    // Finalize averages
    for (int i = 0; i < avgCount; i++) {
        eventAvgs[i].avg = eventAvgs[i].sum / eventAvgs[i].count;
    }
    
    // Pass 2: Count above-average performances
    int businessAboveAvgCount[MAX_BUSINESSES] = {0};
    int businessExists[MAX_BUSINESSES] = {0};
    
    for (int i = 0; i < eventCount; i++) {
        int businessId = events[i].business_id;
        char* eventType = events[i].event_type;
        int occurrences = events[i].occurrences;
        
        // Find average for this event type
        for (int j = 0; j < avgCount; j++) {
            if (strcmp(eventAvgs[j].event_type, eventType) == 0) {
                if (occurrences > eventAvgs[j].avg) {
                    businessAboveAvgCount[businessId]++;
                    businessExists[businessId] = 1;
                }
                break;
            }
        }
    }
    
    int* result = (int*)malloc(MAX_BUSINESSES * sizeof(int));
    *resultSize = 0;
    
    for (int i = 0; i < MAX_BUSINESSES; i++) {
        if (businessExists[i] && businessAboveAvgCount[i] > 1) {
            result[(*resultSize)++] = i;
        }
    }
    
    return result;
}