oj.uz

답안 #652791

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
652791 2022-10-24T12:47:53 Z coding_snorlax 비스킷 담기 (IOI20_biscuits) C++14
42 / 100
 1000 ms 12728 KB 
#include "biscuits.h"
#include<bits/stdc++.h>
using namespace std;
long long int count_tastiness(long long int x,vector<long long int> a){
    int Total=a.size();
    for(int i=Total;i<60;i++){
        a.push_back(0);
    }
    vector<pair<long long int,long long int>> answer={make_pair(0,1)};
    long long int Count=0;
    for(int i=0;i<60;i++){
        vector<pair<long long int,long long int>> tmp;
        for(int j=0;j<(int)answer.size();j++){
            if(answer[j].first-x+a[i]>=0){
                tmp.push_back(make_pair((answer[j].first-x+a[i])/2,answer[j].second));
            }
            tmp.push_back(make_pair((answer[j].first+a[i])/2,answer[j].second));
        }
        sort(tmp.begin(),tmp.end());
        answer.clear();
        long long int tmp_num=0;
        long long int now=tmp[0].first;
        tmp.push_back(make_pair(-1,0));
        for(int j=0;j<(int)tmp.size();j++){
            if(tmp[j].first!=now){
                answer.push_back(make_pair(tmp[j-1].first,tmp_num));
                tmp_num=tmp[j].second;
                now=tmp[j].first;
            }
            else tmp_num+=tmp[j].second;
        }
    }
    for(int j=0;j<(int)answer.size();j++){
        Count+=answer[j].second;
    }
    return Count;

}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 1324 KB Output is correct
2 Correct 87 ms 1356 KB Output is correct
3 Correct 140 ms 1328 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 379 ms 1380 KB Output is correct
9 Correct 245 ms 1416 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 6 ms 212 KB Output is correct
12 Correct 56 ms 432 KB Output is correct
13 Correct 373 ms 1480 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1090 ms 12728 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 436 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 1 ms 300 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 43 ms 1324 KB Output is correct
25 Correct 87 ms 1356 KB Output is correct
26 Correct 140 ms 1328 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 379 ms 1380 KB Output is correct
32 Correct 245 ms 1416 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 6 ms 212 KB Output is correct
35 Correct 56 ms 432 KB Output is correct
36 Correct 373 ms 1480 KB Output is correct
37 Execution timed out 1090 ms 12728 KB Time limit exceeded
38 Halted 0 ms 0 KB -