Discussion @ 1881. Long problem statement @ Timus Online Judge

tima20072007 WA 4 // Problem 1881. Long problem statement 4 Apr 2024 21:45

Klim Shramko WA#5_Есть_пробелы_на_входе // Problem 1881. Long problem statement 23 Jun 2023 16:59

Danil Dushistov More tests [9] // Problem 1881. Long problem statement 4 Nov 2012 02:44

vegetable test 30 100 eng text "GOV Chronicles" = 4 // Problem 1881. Long problem statement 14 Sep 2021 22:10

dickbooster WA3 [10] // Problem 1881. Long problem statement 22 Oct 2011 15:17

Kot WA#4 [1] // Problem 1881. Long problem statement 30 Jan 2016 21:12

ramon93i7 WA 12 [4] // Problem 1881. Long problem statement 16 Apr 2012 12:32

What's wrong in my code?
<
#include <stdio.h>
#include <string.h>

int main() {
        int i,h,w,n,tmp;
    int curLen = 0, curNumStr = 0;
    char s[105];
    scanf("%d%d%d\n",&h,&w,&n);
    for(i = 0; i < n; i ++) {
        gets(s); //scanf("%s",s);
        tmp = strlen(s);
        if(curLen)
            curLen += 1 + tmp;
        else
            curLen += tmp;
        if(curLen / w){
            curNumStr += curLen / w;
            if(curLen % w)
                curLen = tmp;
            else
                curLen = 0;
        }
    }
    if(curLen)
        curNumStr ++;

    tmp = curNumStr / h;
    if(curNumStr % h)
        tmp ++;
    printf("%d",tmp);
    return 0;
}
>

DrunkBear Re: WA 12 [3] // Problem 1881. Long problem statement 27 Sep 2017 21:25

What's wrong with my code too?

h,w,n=map(int,input().split())
a=[]
for i in range(n):
    a.append(input())
lines=0
pag=0
while len(a)>0:
    if len(a)!=1:
        length=-1
        while length<w:
            length+=len(a[0])+1
            b=a[0]
            a.remove(a[0])
        if length>w:
            a.reverse()
            a.append(b)
            a.reverse()
        lines+=1
    else:
        lines+=1
        a.remove(a[0])

if lines%h==0:
    pag=lines//h
else:
    pag=lines//h+1
print(pag)

Edited by author 27.09.2017 21:28

Mahilewets Nikita [BSUIR] Re: WA 12 [1] // Problem 1881. Long problem statement 27 Sep 2017 22:03

Do you mean, why RE#12?

DrunkBear Re: WA 12 // Problem 1881. Long problem statement 27 Sep 2017 22:27

I understand, thanks

Edited by author 27.09.2017 22:28

Mahilewets Nikita [BSUIR] Re: WA 12 // Problem 1881. Long problem statement 27 Sep 2017 22:14

You are removing a[0], not element with index 0
So if there are several elements having the same value as a[0] they would be removed together with a[0]
So they would be not processed

Also I strongly recommend you not to store the entire input but process data just in time

Neeraj Kumar Help in understanding the problem [2] // Problem 1881. Long problem statement 18 Apr 2015 19:45

Aleksandr Despair and Test Case #6 [1] // Problem 1881. Long problem statement 25 Jan 2017 04:16

muhiddin WA # 10? [4] // Problem 1881. Long problem statement 14 Oct 2014 23:19

zimozi WA3 in C++ Anyone could help me?? // Problem 1881. Long problem statement 26 Jul 2015 07:24

Yangiboyev Bekmurod Algoritm [3] // Problem 1881. Long problem statement 17 Jan 2012 00:13

Vladislav WA3 [1] // Problem 1881. Long problem statement 22 Mar 2014 21:40

Axmadjon Why WA#3 in Java // Problem 1881. Long problem statement 6 Jun 2014 17:44

import java.util.*;

public class Test_1874 {
    public static void main(String[] args) {
        @SuppressWarnings("resource")
        Scanner s = new Scanner(System.in);
        int h, w, n;
        h = s.nextInt();
        w = s.nextInt();
        n = s.nextInt();

        String[] a = new String[n];
        for (int i = 0; i < n; i++) {
            a[i] = s.nextLine();
            if (a[i].isEmpty()) {
                a[i] = s.nextLine();
            }
        }

        if (n == 1) {
            System.out.println("1");
            return;
        }

        int b, c = 0, d = 0, list = 0, page = 0;

        for (int i = 0; i < n; i++) {
            b = (a[i].length() + 1);

            if (i == 0) {
                c = a[i + 1].length();

                if (b + c == w) {
                    list++;

                } else if (b + c < w) {
                    d = b + c;
                    c = a[i + 2].length();
                    if ((d + c) == w) {
                        list++;
                    } else if ((d + c) < w) {

                    } else {
                        list++;
                    }
                } else {
                    list++;
                }
            } else {

                if ((b + d) == w) {
                    list++;

                } else if ((b + d) < w) {
                    d = d + b;
                    c = a[i + 1].length();
                    if ((d + c) == w) {
                        list++;
                    } else if ((d + c) < w) {

                    } else {
                        list++;
                    }
                } else {
                    list++;
                }

            }

            if (list == h) {
                page++;
                list = 0;
            } else if (i == (n - 1)) {
                if(list>=1){
                    page++;
                }

            }

        }
        System.out.println(page);

    }
}

Nightwalker Help please // Problem 1881. Long problem statement 29 May 2014 17:38

... AC Code // Problem 1881. Long problem statement 18 Mar 2014 14:37

Valera Why i get Compilation Error (C++) ?? // Problem 1881. Long problem statement 9 Jan 2014 18:24

gochapod WA#5 // Problem 1881. Long problem statement 3 Aug 2013 15:41

Inacio Medeiros Weird Situation // Problem 1881. Long problem statement 6 Jun 2013 19:18

SpBerkut Got AC [3] // Problem 1881. Long problem statement 13 Nov 2012 21:17

Discussion of Problem 1881. Long problem statement