oj.uz

답안 #29555

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
29555 2017-07-20T06:05:41 Z 시제연(#1241) Lollipop (POI11_liz) C++11
0 / 100
 686 ms 11660 KB 
#include <bits/stdc++.h>

using namespace std;

int n, m, p, fk = -1;
int lol[2000100];
vector<int> loc;
char str[1000100];

bool good(int k) {
	if (fk<0) return false;
	if (~lol[fk]&&~lol[fk+k]) {
		printf("%d %d\n",lol[fk],lol[fk+k]);
		return true;
	}
	int idx = upper_bound(loc.begin(),loc.end(),k)-loc.begin();
	if (idx==loc.size()) return false;
	int l = loc[idx];
	if (~lol[l-k]&&lol[l]) {
		printf("%d %d\n",lol[l-k],lol[l]);
		return true;
	}
	return false;
}

int main() {
	int i, t = 1;

	scanf("%d%d",&n,&m);
	scanf("%s",str);
	memset(lol,-1,sizeof(lol));
	lol[0] = 0;
	for (i=0;i<n;i++) {
		if (str[i]=='T') {p+=2; lol[p] = i+1;}
		else {p++; lol[p] = i+1; loc.push_back(p); if (fk<0) fk = p;}
	}
	for (i=0;i<m;i++) {
		int k;
		scanf("%d",&k);
		if (~lol[k]) {
			printf("%d %d\n",1,lol[k]);
			continue;
		}
		if (!good(k)) { printf("NIE\n"); }
	}

    return 0;
}

Compilation message

liz.cpp: In function 'bool good(int)':
liz.cpp:17:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (idx==loc.size()) return false;
         ^
liz.cpp: In function 'int main()':
liz.cpp:27:9: warning: unused variable 't' [-Wunused-variable]
  int i, t = 1;
         ^
liz.cpp:29:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
                     ^
liz.cpp:30:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",str);
                 ^
liz.cpp:39:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&k);
                 ^

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 10808 KB Output is correct
2 Incorrect 0 ms 10808 KB Oczekiwano przedzialu o koszcie 1 otrzymano przedzial wartosci 2
3 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 10808 KB Oczekiwano przedzialu o koszcie 22 otrzymano przedzial wartosci 23
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 10808 KB Oczekiwano przedzialu o koszcie 367 otrzymano przedzial wartosci 368
2 Halted 0 ms 0 KB -

Subtask #4
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 10808 KB Oczekiwano przedzialu o koszcie 4596 otrzymano przedzial wartosci 4598
2 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 13 ms 10808 KB Oczekiwano przedzialu o koszcie 15416 otrzymano przedzial wartosci 15417
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 33 ms 10808 KB Oczekiwano przedzialu o koszcie 48579 otrzymano przedzial wartosci 48580
2 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 53 ms 10948 KB Oczekiwano przedzialu o koszcie 76689 otrzymano przedzial wartosci 76691
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 179 ms 10808 KB Oczekiwano przedzialu o koszcie 43618 otrzymano przedzial wartosci 43619
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 376 ms 10948 KB Oczekiwano przedzialu o koszcie 259779 otrzymano przedzial wartosci 259780
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 329 ms 11660 KB Oczekiwano przedzialu o koszcie 8939 otrzymano przedzial wartosci 8940
2 Halted 0 ms 0 KB -

Subtask #11
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 686 ms 10808 KB Oczekiwano przedzialu o koszcie 114342 otrzymano przedzial wartosci 114343
2 Halted 0 ms 0 KB -

Subtask #12
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 11660 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -