oj.uz

Submission #251295

# Submission time Handle Problem Language Result Execution time Memory
251295 2020-07-20T17:00:34 Z jimmy123 Lollipop (POI11_liz) C++14
82 / 100
 479 ms 19452 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){
                first_W = pos;
                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;
            }
            
        }

        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;
            }
        }
        // 找不到解
        printf("NIE");
    }

    return 0;
}

Compilation message

liz.cpp: In function 'int main()':
liz.cpp:62: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:43:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &range);
         ~~~~~^~~~~~~~~~~~~~
liz.cpp:26:13: warning: 'add' may be used uninitialized in this function [-Wmaybe-uninitialized]
             if(add > 1000){
             ^~

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 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 9 ms 512 KB Output is correct

Subtask #4
8.0 / 8.0

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

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 640 KB Output is correct
2 Correct 7 ms 640 KB Output is correct
3 Correct 36 ms 1920 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 1536 KB Output is correct
2 Correct 150 ms 5908 KB Output is correct
3 Correct 66 ms 3704 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 1528 KB Output is correct
2 Correct 31 ms 1912 KB Output is correct
3 Correct 75 ms 4088 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 3704 KB Output is correct
2 Correct 109 ms 4728 KB Output is correct
3 Correct 155 ms 7800 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 253 ms 9208 KB Output is correct
2 Correct 230 ms 10876 KB Output is correct
3 Correct 302 ms 13560 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 244 ms 9464 KB Output is correct
2 Correct 314 ms 12152 KB Output is correct
3 Correct 327 ms 15864 KB Output is correct

Subtask #11
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 466 ms 18680 KB Output is correct
2 Correct 355 ms 18040 KB Output is correct
3 Runtime error 18 ms 17280 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 479 ms 19452 KB Bledny przedzial
2 Halted 0 ms 0 KB -