Submission #850269

#	Time	Username	Problem	Language	Result	Execution time	Memory
850269		Rifal	Homecoming (BOI18_homecoming)	C++14	0 / 100	117 ms	4696 KiB

homecoming

long long  solve(int N, int K, int *A, int *B) {
    long long ans = 0;
    bool ok[N] = {};
    for(int q = 0; q < N; q++) {
    long long now = ans;
    for(int i = 0; i < N; i++) {
        long long sum = 0;
        if(ok[i] == 1) continue;
        for(int j = 0; j < K; j++) {
            sum += B[(i+j)%N];
        }
        if(sum < A[i]) {
            ok[i] = 1;
            ans += A[i]-sum;
            for(int j = 0; j < K; j++) {
            B[(i+j)%N] = 0;}
        }
    }
    if(now == ans) break;
    }
    return ans;
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 18
• Subtask 3: 0 / 31
• Subtask 4: 0 / 38