Submission #74943567

Source Code Expand

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

int main(){
    int n;
    cin >> n;
    vector<int> s(n);
    for(auto &x : s) cin >> x;
    
    int count = 0;
    for(int i = 0; i < n; i++){
        if(s[i] == 0){
            // Check if we can place here
            bool left2 = (i >= 2 && s[i-2] == 1);
            bool left1 = (i >= 1 && s[i-1] == 1);
            bool right1 = (i+1 < n && s[i+1] == 1);
            bool right2 = (i+2 < n && s[i+2] == 1);
            
            // Can't place if it would create 3 consecutive
            // Cases: [1,1,0] -> placing makes [1,1,1]
            //        [0,1,1] -> placing makes... wait need to check window
            // A placement at i is invalid if:
            // s[i-2]==1 && s[i-1]==1  (left two are both 1)
            // s[i-1]==1 && s[i+1]==1  (neighbors both 1, but that's only 2 occupied, fine... 
            //                           wait: s[i-1], s[i], s[i+1] = 1,1,1 -> bad)
            // s[i+1]==1 && s[i+2]==1  (right two are both 1)
            
            if((left2 && left1) || (left1 && right1) || (right1 && right2)){
                continue; // can't place
            }
            s[i] = 1;
            count++;
        }
    }
    cout << count << endl;
}

Submission Info

Submission Time
Task C - Seating Arrangement
User Subha_Sree05
Language C++23 (GCC 15.2.0)
Score 366
Code Size 1281 Byte
Status AC
Exec Time 22 ms
Memory 4132 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 366 / 366
Status
AC × 5
AC × 63
Set Name Test Cases
Sample sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt
All sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt
Case Name Status Exec Time Memory
in01.txt AC 1 ms 3564 KiB
in02.txt AC 1 ms 3552 KiB
in03.txt AC 1 ms 3476 KiB
in04.txt AC 1 ms 3504 KiB
in05.txt AC 1 ms 3480 KiB
in06.txt AC 1 ms 3612 KiB
in07.txt AC 1 ms 3476 KiB
in08.txt AC 21 ms 3976 KiB
in09.txt AC 21 ms 3988 KiB
in10.txt AC 22 ms 4040 KiB
in11.txt AC 22 ms 4104 KiB
in12.txt AC 21 ms 3968 KiB
in13.txt AC 21 ms 3924 KiB
in14.txt AC 21 ms 3924 KiB
in15.txt AC 1 ms 3632 KiB
in16.txt AC 21 ms 3988 KiB
in17.txt AC 22 ms 4044 KiB
in18.txt AC 20 ms 3980 KiB
in19.txt AC 21 ms 4100 KiB
in20.txt AC 21 ms 3988 KiB
in21.txt AC 1 ms 3480 KiB
in22.txt AC 21 ms 3932 KiB
in23.txt AC 1 ms 3632 KiB
in24.txt AC 1 ms 3476 KiB
in25.txt AC 1 ms 3616 KiB
in26.txt AC 1 ms 3504 KiB
in27.txt AC 1 ms 3508 KiB
in28.txt AC 1 ms 3620 KiB
in29.txt AC 1 ms 3480 KiB
in30.txt AC 1 ms 3612 KiB
in31.txt AC 1 ms 3448 KiB
in32.txt AC 1 ms 3592 KiB
in33.txt AC 1 ms 3500 KiB
in34.txt AC 21 ms 3940 KiB
in35.txt AC 1 ms 3464 KiB
in36.txt AC 1 ms 3500 KiB
in37.txt AC 21 ms 4104 KiB
in38.txt AC 20 ms 4104 KiB
in39.txt AC 21 ms 4132 KiB
in40.txt AC 21 ms 4104 KiB
in41.txt AC 21 ms 4100 KiB
in42.txt AC 22 ms 4020 KiB
in43.txt AC 21 ms 4044 KiB
in44.txt AC 22 ms 4132 KiB
in45.txt AC 21 ms 3924 KiB
in46.txt AC 1 ms 3620 KiB
in47.txt AC 1 ms 3476 KiB
in48.txt AC 1 ms 3584 KiB
in49.txt AC 1 ms 3584 KiB
in50.txt AC 1 ms 3528 KiB
in51.txt AC 1 ms 3528 KiB
in52.txt AC 1 ms 3476 KiB
in53.txt AC 1 ms 3612 KiB
in54.txt AC 1 ms 3480 KiB
in55.txt AC 21 ms 4104 KiB
in56.txt AC 1 ms 3528 KiB
in57.txt AC 1 ms 3588 KiB
in58.txt AC 21 ms 3968 KiB
sample01.txt AC 1 ms 3528 KiB
sample02.txt AC 1 ms 3464 KiB
sample03.txt AC 1 ms 3584 KiB
sample04.txt AC 1 ms 3508 KiB
sample05.txt AC 1 ms 3528 KiB