oj.uz

답안 #26574

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
26574 2017-07-03T07:53:04 Z top34051 Brunhilda’s Birthday (BOI13_brunhilda) C++14
65.7143 / 100
 1000 ms 119988 KB 
#include<bits/stdc++.h>
using namespace std;
#define inf (int)1e6
int n,m;
int p[100005];
int last[100005];
int pos[10000005];
int rec[10000005];
int mem[10000005];
main() {
    int i,j,x;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++) {
        scanf("%d",&p[i]);
        x = p[i];
        while(x<=10000000) {
            rec[x] = i;
            x += p[i];
        }
        pos[0]++;
        last[i] = 0;
    }
    for(i=1,j=0;i<=10000000;i++) {
        x = i;
        while(rec[x]) {
            pos[last[rec[x]]]--;
            last[rec[x]] = i;
            pos[last[rec[x]]]++;
            x = x/p[rec[x]];
        }
        while(j<i && pos[j]==0) j++;
        if(i==j) mem[i] = inf;
        else mem[i] = mem[j] + 1;
    }
    while(m--) {
        scanf("%d",&x);
        if(mem[x]==inf) printf("oo\n");
        else printf("%d\n",mem[x]);
    }
}

Compilation message

brunhilda.cpp:10:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
brunhilda.cpp: In function 'int main()':
brunhilda.cpp:12:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
                        ^
brunhilda.cpp:14:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&p[i]);
                          ^
brunhilda.cpp:36:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&x);
                       ^

Subtask #1
15.5555555556 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 129 ms 119988 KB Output isn't correct
2 Correct 503 ms 119988 KB Output is correct
3 Correct 326 ms 119988 KB Output is correct
4 Correct 79 ms 119988 KB Output is correct
5 Correct 183 ms 119988 KB Output is correct
6 Incorrect 119 ms 119988 KB Output isn't correct
7 Correct 356 ms 119988 KB Output is correct
8 Correct 606 ms 119988 KB Output is correct
9 Correct 809 ms 119988 KB Output is correct
10 Correct 849 ms 119988 KB Output is correct
11 Correct 466 ms 119988 KB Output is correct
12 Correct 86 ms 119988 KB Output is correct
13 Execution timed out 1000 ms 119988 KB Execution timed out
14 Execution timed out 1000 ms 119988 KB Execution timed out
15 Correct 489 ms 119988 KB Output is correct
16 Correct 499 ms 119988 KB Output is correct
17 Correct 146 ms 119988 KB Output is correct
18 Correct 86 ms 119988 KB Output is correct

Subtask #2
14.4444444444 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 149 ms 119988 KB Output is correct
2 Correct 206 ms 119988 KB Output is correct
3 Execution timed out 1000 ms 119988 KB Execution timed out
4 Correct 249 ms 119988 KB Output is correct
5 Correct 686 ms 119988 KB Output is correct
6 Correct 319 ms 119988 KB Output is correct
7 Correct 166 ms 119988 KB Output is correct
8 Correct 236 ms 119988 KB Output is correct
9 Correct 826 ms 119988 KB Output is correct
10 Execution timed out 1000 ms 119988 KB Execution timed out
11 Execution timed out 1000 ms 119988 KB Execution timed out
12 Correct 639 ms 119988 KB Output is correct
13 Correct 146 ms 119988 KB Output is correct
14 Correct 243 ms 119988 KB Output is correct
15 Execution timed out 1000 ms 119988 KB Execution timed out
16 Correct 186 ms 119988 KB Output is correct
17 Execution timed out 1000 ms 119988 KB Execution timed out
18 Correct 876 ms 119988 KB Output is correct

Subtask #3
35.7142857143 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1000 ms 119988 KB Execution timed out
2 Execution timed out 1000 ms 119988 KB Execution timed out
3 Execution timed out 1000 ms 119988 KB Execution timed out
4 Correct 789 ms 119988 KB Output is correct
5 Correct 296 ms 119988 KB Output is correct
6 Execution timed out 1000 ms 119988 KB Execution timed out
7 Correct 486 ms 119988 KB Output is correct
8 Execution timed out 1000 ms 119988 KB Execution timed out
9 Execution timed out 1000 ms 119988 KB Execution timed out
10 Correct 549 ms 119988 KB Output is correct
11 Correct 353 ms 119988 KB Output is correct
12 Correct 986 ms 119988 KB Output is correct
13 Execution timed out 1000 ms 119988 KB Execution timed out
14 Correct 969 ms 119988 KB Output is correct
15 Execution timed out 1000 ms 119988 KB Execution timed out
16 Execution timed out 1000 ms 119988 KB Execution timed out
17 Correct 739 ms 119988 KB Output is correct
18 Execution timed out 1000 ms 119988 KB Execution timed out
19 Correct 233 ms 119988 KB Output is correct
20 Execution timed out 1000 ms 119988 KB Execution timed out
21 Execution timed out 1000 ms 119988 KB Execution timed out
22 Execution timed out 1000 ms 119988 KB Execution timed out
23 Correct 283 ms 119988 KB Output is correct
24 Correct 173 ms 119988 KB Output is correct
25 Correct 659 ms 119988 KB Output is correct
26 Correct 746 ms 119988 KB Output is correct
27 Execution timed out 1000 ms 119988 KB Execution timed out
28 Correct 199 ms 119988 KB Output is correct
29 Correct 626 ms 119988 KB Output is correct
30 Correct 579 ms 119988 KB Output is correct
31 Correct 286 ms 119988 KB Output is correct
32 Correct 343 ms 119988 KB Output is correct
33 Correct 136 ms 119988 KB Output is correct
34 Correct 386 ms 119988 KB Output is correct
35 Correct 229 ms 119988 KB Output is correct
36 Execution timed out 1000 ms 119988 KB Execution timed out
37 Correct 309 ms 119988 KB Output is correct
38 Execution timed out 1000 ms 119988 KB Execution timed out
39 Correct 213 ms 119988 KB Output is correct
40 Correct 899 ms 119988 KB Output is correct
41 Correct 719 ms 119988 KB Output is correct
42 Execution timed out 1000 ms 119988 KB Execution timed out