oj.uz

Submission #26609

# Submission time Handle Problem Language Result Execution time Memory
26609 2017-07-03T12:47:11 Z model_code Lollipop (POI11_liz) C
8 / 100
 633 ms 17716 KB 
/*************************************************************************
 *                                                                       *
 *                    XVIII Olimpiada Informatyczna                      *
 *                                                                       *
 *   Zadanie:           Lizak                                            *
 *   Autor:             Mateusz Baranowski                               *
 *   Zlozonosc czasowa: O(n + m)                                         *
 *          pamieciowa: O(n)                                             *
 *   Opis:              Rozwiazanie bledne                               *
 *                      Nie uwzglednia, ze segment waniliowy moze byc    *
 *                      blizej "prawego konca"                           *
 *                                                                       *
 *************************************************************************/

#include <stdio.h>
#define MAX_N 1000000
#define MAX_K 2000000

int n, m;	/* ilosc segmentow lizaka i ilosc rozwazanych cen */
int wa[MAX_K + 1], wb[MAX_K + 1]; /* [wa[j], wb[j]] to przedzial o koszcie j */
int i, l, sum = 0;
int max[2];	/* najwieksza cena parzysta i nieparzysta */
char s[MAX_N + 1];	/* opis lizaka */

/* funkcja obliczajaca wa[x], wb[x] dla (x <= sum) i ((sum + x) mod 2 == 0) */
void oblicz_przedzialy() {
	int sum_tmp = sum;
	wa[sum] = i + 1;
	wb[sum] = l + 1;

	while (sum_tmp > 2) {
		while ((sum_tmp > 2) && (s[i] == 'T')) {
			sum_tmp -= 2;
			wa[sum_tmp] = ++i + 1;
			wb[sum_tmp] = l + 1;
		}
		while ((sum_tmp > 2) && (s[l] == 'T')) {
			sum_tmp -= 2;
			wa[sum_tmp] = i + 1;
			wb[sum_tmp] = --l + 1;
		}
		
		if (sum_tmp > 2) {
			sum_tmp -= 2;
			wa[sum_tmp] = ++i + 1;
			wb[sum_tmp] = --l + 1;
		}
	}
}

int main() {
	scanf("%d %d", &n, &m);
	scanf("%s", s);

	for (l = 0; l < n; ++l)
		if (s[l] == 'T')
			sum += 2;
		else
			sum += 1;
	
	i = 0;
	l = n - 1;
	max[sum % 2] = sum;

	oblicz_przedzialy();
	/* szukamy pierwszego 'W' od poczatku lizaka */
	i = 0;
	while ((i < n) && (s[i] == 'T'))
		++i;
	
	if (i == n) /* brak waniliowego */
		max[1 - (sum % 2)] = 0;
	else {
		sum -= 2 * i + 1;
		max[sum % 2] = sum;
		i += 1;
		l = n - 1;
		oblicz_przedzialy();
	}

	/* odpowiadamy na zapytania korzystajac z tablic wa[] i wb[] */
	for (i = 0; i < m; ++i) {
		scanf("%d", &sum);

		if (max[sum % 2] < sum)
			printf("NIE\n");
		else
			printf("%d %d\n", wa[sum], wb[sum]);
	}

	return 0;
}

Compilation message

liz.c: In function 'main':
liz.c:52:2: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
  ^
liz.c:53:2: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", s);
  ^
liz.c:83:3: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &sum);
   ^

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17716 KB Output is correct
2 Incorrect 0 ms 17716 KB Oczekiwano przedzial, otrzymano 'NIE'
3 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17716 KB Output is correct
2 Correct 0 ms 17716 KB Output is correct
3 Incorrect 0 ms 17716 KB Oczekiwano przedzial, otrzymano 'NIE'

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17716 KB Output is correct
2 Correct 0 ms 17716 KB Output is correct
3 Incorrect 6 ms 17716 KB Oczekiwano przedzial, otrzymano 'NIE'

Subtask #4
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 17716 KB Oczekiwano przedzial, otrzymano 'NIE'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 17716 KB Oczekiwano przedzial, otrzymano 'NIE'
2 Halted 0 ms 0 KB -

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 17716 KB Output is correct
2 Correct 173 ms 17716 KB Output is correct
3 Correct 66 ms 17716 KB Output is correct

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 17716 KB Output is correct
2 Correct 39 ms 17716 KB Output is correct
3 Incorrect 76 ms 17716 KB Oczekiwano przedzial, otrzymano 'NIE'

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 17716 KB Output is correct
2 Incorrect 126 ms 17716 KB Oczekiwano przedzial, otrzymano 'NIE'
3 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 339 ms 17716 KB Output is correct
2 Incorrect 329 ms 17716 KB Oczekiwano przedzial, otrzymano 'NIE'
3 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 299 ms 17716 KB Output is correct
2 Correct 266 ms 17716 KB Output is correct
3 Incorrect 413 ms 17716 KB Oczekiwano przedzial, otrzymano 'NIE'

Subtask #11
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 633 ms 17716 KB Output is correct
2 Incorrect 569 ms 17716 KB Oczekiwano przedzial, otrzymano 'NIE'
3 Halted 0 ms 0 KB -

Subtask #12
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 629 ms 17716 KB Oczekiwano przedzial, otrzymano 'NIE'
2 Halted 0 ms 0 KB -