Submission #251473

#	Time	Username	Problem	Language	Result	Execution time	Memory
251473		2qbingxuan	Lollipop (POI11_liz)	C++14	100 / 100	592 ms	31224 KiB

liz

#include <cstdio>
const int N = 1000025;
inline int max(int a, int b){return a>b ? a : b;}
inline int min(int a, int b){return a<b ? a : b;}
int n, q, v[N], sum[N];
int Z[N], lb[N*2];
char s[N];
signed main() {
  	scanf("%d%d%s", &n, &q, s);
    for(int i = 0; i < n; i++) v[i] = (s[i]=='T' ? 2 : 1);
    for(int i = 0; i < n; i++) sum[i+1] = sum[i] + v[i];
    for(int i = 1, j = 0; i <= n*2; i++) {
        while(j < n && sum[j] < i) ++j;
        lb[i] = j;
    }
    for(int i = 1, j = 0, r = 0; i < n; i++) {
        Z[i] = max(0, min(r-i, Z[i-j]));
        while(i+Z[i] < n && v[Z[i]] == v[i+Z[i]]) ++Z[i];
        if(i+Z[i] > r) j = i, r = i+Z[i];
    }
    Z[0] = n;
    while(q--) {
        int k;
      	scanf("%d", &k);
        int x = lb[k];
        if(sum[x] == k) printf("%d %d\n", 1, x);
        else {
            // sum[x] == k+1
            int L = Z[x]; // v[0:Z[x]-1] = v[x:x+Z[x]-1]
            // v[Z[x]] != v[x+Z[x]]
            int R = x+Z[x];
            /* debug(L, R); */
            if(v[L] == 1)
                --R;
            ++L;
            if(R >= n || sum[R+1] - sum[L] != k) puts("NIE");
            else printf("%d %d\n", L+1, R+1);
        }
    }
}

Compilation message (stderr)

liz.cpp: In function 'int main()':
liz.cpp:9:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d%s", &n, &q, s);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~
liz.cpp:24:13: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
        scanf("%d", &k);
        ~~~~~^~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 8 / 8
• Subtask 5: 8 / 8
• Subtask 6: 8 / 8
• Subtask 7: 8 / 8
• Subtask 8: 8 / 8
• Subtask 9: 9 / 9
• Subtask 10: 9 / 9
• Subtask 11: 9 / 9
• Subtask 12: 9 / 9