oj.uz

답안 #926294

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
926294 2024-02-12T18:29:42 Z Toast Snail (NOI18_snail) C++14
37 / 100
 3 ms 860 KB 
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <cmath>
using namespace std;

int main() {
    double H,N,diff;
    long currentheight=0;
    long currentphase=0;
    long temp = -1;
    bool flag = true;
    string P;
    cin >> H >> N;
    cin.ignore();
    getline(cin, P);
    stringstream ss(P);
    vector<long>v;
    while (getline(ss,P,' ')) {
        v.push_back(stoul(P));
    }
    long currentday = -1;
    for (int i=0;i<2;i++) {
        currentday++;
        for (int i=0;i<N;i++) {
            if (currentheight+v[i]<0) {
                currentheight = 0;
            }
            else {
                currentheight +=v[i];
            }
            if (currentheight>=H) {
                flag=false;
                currentphase=i;
                cout << currentday << " " << currentphase;
                break;
            }
        }
        if (!flag) {
            break;
        }
        if (temp==currentheight) {
            cout << -1 << " " << -1; 
            flag = false;
            break;
        }
        diff = currentheight-temp;
        temp = currentheight;
    }
    while (flag) {
        currentday=ceil((H-currentheight+diff)/diff);
        temp = (currentday)*diff;
        for (int i=0;i<N;i++) {
            if (v[i]+temp>=H) {
                cout << currentday << " " << i;
                flag = false;
                break;
              }
             else {
                 temp+=v[i];
             }
        }
    } 
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 356 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 700 KB Output is correct
6 Correct 1 ms 604 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 3 ms 860 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 2 ms 860 KB Output is correct

Subtask #5
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 356 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 436 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 700 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Incorrect 0 ms 348 KB Output isn't correct
17 Halted 0 ms 0 KB -