Submission #251219

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
251219	2020-07-20T15:44:21 Z	jimmy123	Lollipop (POI11_liz)	C++14	82 / 100	505 ms	27896 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;
    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");

        int range;
        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

liz.cpp: In function 'int main()':
liz.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &num, &query);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
liz.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", data);
     ~~~~~^~~~~~~~~~~~
liz.cpp:36:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &range);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

#	Verdict	Memory	Grader output
1	Correct	256 KB	Output is correct
2	Correct	256 KB	Output is correct
3	Correct	256 KB	Output is correct

Subtask #2
8.0 / 8.0

#	Verdict	Memory	Grader output
1	Correct	256 KB	Output is correct
2	Correct	256 KB	Output is correct
3	Correct	256 KB	Output is correct

Subtask #3
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	8 ms	640 KB	Output is correct

Subtask #4
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	516 KB	Output is correct
2	Correct	4 ms	512 KB	Output is correct
3	Correct	4 ms	512 KB	Output is correct

Subtask #5
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	768 KB	Output is correct
2	Correct	7 ms	768 KB	Output is correct
3	Correct	38 ms	2040 KB	Output is correct

Subtask #6
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	39 ms	2040 KB	Output is correct
2	Correct	145 ms	6376 KB	Output is correct
3	Correct	68 ms	3704 KB	Output is correct

Subtask #7
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	26 ms	2040 KB	Output is correct
2	Correct	31 ms	1912 KB	Output is correct
3	Correct	74 ms	4344 KB	Output is correct

Subtask #8
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	111 ms	5660 KB	Output is correct
2	Correct	123 ms	5368 KB	Output is correct
3	Correct	155 ms	8312 KB	Output is correct

Subtask #9
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	241 ms	13560 KB	Output is correct
2	Correct	220 ms	12792 KB	Output is correct
3	Correct	269 ms	16568 KB	Output is correct

Subtask #10
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	215 ms	13308 KB	Output is correct
2	Correct	271 ms	15096 KB	Output is correct
3	Correct	365 ms	19832 KB	Output is correct

Subtask #11
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	462 ms	26840 KB	Output is correct
2	Correct	391 ms	24696 KB	Output is correct
3	Runtime error	19 ms	17400 KB	Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #12
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	505 ms	27896 KB	Bledny przedzial
2	Halted	0 ms	0 KB	-