Submission #74943197

Source Code Expand

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] S = new int[N];
        for (int i = 0; i < N; i++) S[i] = sc.nextInt();

        int count = 0;
        for (int i = 0; i < N; i++) {
            if (S[i] == 0) {
                boolean leftOk  = (i == 0)     || S[i-1] == 0;
                boolean rightOk = (i == N - 1) || S[i+1] == 0;
                // Can place if not both neighbors occupied,
                // and won't form triple with already-placed seats
                boolean prevTwo  = (i >= 2)    && S[i-1] == 1 && S[i-2] == 1;
                boolean nextTwo  = (i <= N-3)  && S[i+1] == 1 && S[i+2] == 1;
                boolean adjBoth  = (i >= 1) && (i <= N-2) && S[i-1] == 1 && S[i+1] == 1;

                if (!prevTwo && !nextTwo && !adjBoth) {
                    S[i] = 1;
                    count++;
                }
            }
        }
        System.out.println(count);
    }
}

Submission Info

Submission Time
Task C - Seating Arrangement
User Bhuvaneshwari03
Language Java24 (OpenJDK 24.0.2)
Score 366
Code Size 1072 Byte
Status AC
Exec Time 341 ms
Memory 63140 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 71 ms 40836 KiB
in02.txt AC 59 ms 40200 KiB
in03.txt AC 60 ms 40656 KiB
in04.txt AC 63 ms 40956 KiB
in05.txt AC 60 ms 40796 KiB
in06.txt AC 60 ms 40808 KiB
in07.txt AC 62 ms 40412 KiB
in08.txt AC 299 ms 62600 KiB
in09.txt AC 304 ms 62760 KiB
in10.txt AC 305 ms 62704 KiB
in11.txt AC 341 ms 62680 KiB
in12.txt AC 304 ms 63024 KiB
in13.txt AC 302 ms 62504 KiB
in14.txt AC 299 ms 62980 KiB
in15.txt AC 66 ms 40612 KiB
in16.txt AC 295 ms 63140 KiB
in17.txt AC 310 ms 62436 KiB
in18.txt AC 304 ms 62892 KiB
in19.txt AC 301 ms 62528 KiB
in20.txt AC 302 ms 62776 KiB
in21.txt AC 101 ms 43364 KiB
in22.txt AC 315 ms 63120 KiB
in23.txt AC 68 ms 40704 KiB
in24.txt AC 84 ms 41200 KiB
in25.txt AC 62 ms 40636 KiB
in26.txt AC 63 ms 40860 KiB
in27.txt AC 61 ms 40424 KiB
in28.txt AC 65 ms 41004 KiB
in29.txt AC 58 ms 40128 KiB
in30.txt AC 60 ms 41060 KiB
in31.txt AC 67 ms 40848 KiB
in32.txt AC 65 ms 41116 KiB
in33.txt AC 90 ms 43272 KiB
in34.txt AC 313 ms 62936 KiB
in35.txt AC 66 ms 40848 KiB
in36.txt AC 63 ms 39860 KiB
in37.txt AC 324 ms 62672 KiB
in38.txt AC 299 ms 63028 KiB
in39.txt AC 303 ms 62376 KiB
in40.txt AC 340 ms 63088 KiB
in41.txt AC 301 ms 62484 KiB
in42.txt AC 308 ms 62640 KiB
in43.txt AC 301 ms 62852 KiB
in44.txt AC 302 ms 62708 KiB
in45.txt AC 309 ms 62560 KiB
in46.txt AC 65 ms 40604 KiB
in47.txt AC 64 ms 40932 KiB
in48.txt AC 62 ms 40320 KiB
in49.txt AC 62 ms 40644 KiB
in50.txt AC 63 ms 40932 KiB
in51.txt AC 62 ms 40456 KiB
in52.txt AC 62 ms 41056 KiB
in53.txt AC 62 ms 40964 KiB
in54.txt AC 61 ms 41356 KiB
in55.txt AC 306 ms 62780 KiB
in56.txt AC 64 ms 40148 KiB
in57.txt AC 61 ms 40536 KiB
in58.txt AC 301 ms 62640 KiB
sample01.txt AC 69 ms 40952 KiB
sample02.txt AC 64 ms 40732 KiB
sample03.txt AC 62 ms 41200 KiB
sample04.txt AC 61 ms 40768 KiB
sample05.txt AC 61 ms 41040 KiB