# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
251230 | 2020-07-20T15:54:55 Z | jimmy123 | Lollipop (POI11_liz) | C++14 | 483 ms | 20400 KB |
#include <algorithm> #include <stdio.h> using namespace std; char data[1000001]; int location[2000001]={0}; int main(){ int num=0, query=0, cnt=1, pos=0, first_W=-1, last_W=-1, range; bool isfirst = true; //char* data = new char[num+1]; scanf("%d%d", &num, &query); scanf("%s", data); for(int i=0;i<num;i++){ if(data[i] == 'W'){ pos += 1; last_W = pos; if(isfirst){ first_W = pos; isfirst = false; } } else pos += 2; location[pos] = cnt; cnt += 1; } for(int i=0;i<query;i++){ if(i != 0) printf("\n"); scanf("%d", &range); if(location[range] != 0){ printf("1 %d", location[range]); continue; } if(first_W != -1 && first_W < range){ if(location[first_W+range] != 0){ printf("%d %d", location[first_W]+1, location[first_W+range]); continue; } else if(location[first_W+range-1] != 0){ printf("%d %d", location[first_W-1]+1, location[first_W+range-1]); continue; } } if(last_W != -1 && last_W > range){ if(location[last_W-range] != 0){ printf("%d %d", location[last_W-range]+1, location[last_W]); continue; } else if(location[last_W-range-1] != 0){ printf("%d %d", location[last_W-range-1]+1, location[last_W-1]); continue; } } // 找不到解 printf("NIE"); } //delete []data; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 256 KB | Output is correct |
2 | Correct | 0 ms | 256 KB | Output is correct |
3 | Correct | 0 ms | 256 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 256 KB | Output is correct |
2 | Correct | 0 ms | 256 KB | Output is correct |
3 | Correct | 0 ms | 256 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 0 ms | 256 KB | Output is correct |
3 | Correct | 9 ms | 512 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 512 KB | Output is correct |
2 | Correct | 4 ms | 512 KB | Output is correct |
3 | Correct | 4 ms | 512 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 768 KB | Output is correct |
2 | Correct | 7 ms | 768 KB | Output is correct |
3 | Correct | 54 ms | 2040 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 30 ms | 2040 KB | Output is correct |
2 | Correct | 147 ms | 4716 KB | Output is correct |
3 | Correct | 71 ms | 3320 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 28 ms | 2040 KB | Output is correct |
2 | Correct | 30 ms | 1920 KB | Output is correct |
3 | Correct | 75 ms | 3832 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 108 ms | 4344 KB | Output is correct |
2 | Correct | 106 ms | 3960 KB | Output is correct |
3 | Correct | 153 ms | 6392 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 258 ms | 9848 KB | Output is correct |
2 | Correct | 240 ms | 9208 KB | Output is correct |
3 | Correct | 283 ms | 12240 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 214 ms | 10104 KB | Output is correct |
2 | Correct | 283 ms | 10760 KB | Output is correct |
3 | Correct | 312 ms | 14456 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 476 ms | 19320 KB | Output is correct |
2 | Correct | 400 ms | 16628 KB | Output is correct |
3 | Runtime error | 20 ms | 17272 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 483 ms | 20400 KB | Bledny przedzial |
2 | Halted | 0 ms | 0 KB | - |