Submission #251291

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
251291	2020-07-20T16:56:38 Z	jimmy123	Lollipop (POI11_liz)	C++14	0 / 100	503 ms	20472 KB

#include <stdio.h>
#include <vector>
#include <algorithm>

using namespace std;
const int MAX_NUM = 1000000;
char data[MAX_NUM+1];
int location[2*MAX_NUM+1]={0};


int main(){
    int num=0, query=0, cnt=1, pos=0, first_W=-1, last_W=-1, range, i, add;
    bool isfirst = true;
    scanf("%d%d%s", &num, &query, data);
    vector<int> Wpos;

    for(i=0;i<num;++i){
        if(data[i] == 'W'){
            pos += 1;
            last_W = pos;
            if(isfirst){
                Wpos.push_back(pos);
                isfirst = false;
            }
            if(add > 1000){
                Wpos.push_back(pos);
                add = 0;
            }
        }
        else
            pos += 2;
        location[pos] = cnt;
        cnt += 1;
        add += 1;
    }
    Wpos.push_back(last_W);

    for(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;
            }
            else
                printf("NOOO");
            
        }

        int idx = upper_bound(Wpos.begin(), Wpos.end(), range) - Wpos.begin();
        //if(last_W != -1 && last_W > range){
        if(idx != Wpos.size()){
            if(location[Wpos[idx]-range] != 0){
                printf("%d %d", location[Wpos[idx]-range]+1, location[Wpos[idx]]);
                continue;
            }
            else if(location[Wpos[idx]-range-1] != 0){
                printf("%d %d", location[Wpos[idx]-range-1]+1, location[Wpos[idx]-1]);
                continue;
            }
            else
                printf("NOOO");
        }
        // 找不到解
        printf("NIE");
    }

    return 0;
}

Compilation message

liz.cpp: In function 'int main()':
liz.cpp:63:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(idx != Wpos.size()){
            ~~~~^~~~~~~~~~~~~~
liz.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%s", &num, &query, data);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
liz.cpp:42:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &range);
         ~~~~~^~~~~~~~~~~~~~
liz.cpp:25:13: warning: 'add' may be used uninitialized in this function [-Wmaybe-uninitialized]
             if(add > 1000){
             ^~

Subtask #1
0 / 8.0

#	Verdict	Memory	Grader output
1	Correct	256 KB	Output is correct
2	Correct	256 KB	Output is correct
3	Incorrect	256 KB	Oczekiwano przedzial, otrzymano 'NIE'

Subtask #2
0 / 8.0

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

Subtask #3
0 / 8.0

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

Subtask #4
0 / 8.0

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

Subtask #5
0 / 8.0

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

Subtask #6
0 / 8.0

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

Subtask #7
0 / 8.0

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

Subtask #8
0 / 8.0

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

Subtask #9
0 / 9.0

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

Subtask #10
0 / 9.0

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

Subtask #11
0 / 9.0

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

Subtask #12
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	492 ms	20192 KB	Output is correct
2	Correct	497 ms	18344 KB	Output is correct
3	Incorrect	378 ms	20472 KB	Oczekiwano przedzial, otrzymano 'NIE'