제출 #1264911

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1264911		InvMOD	Snail (NOI18_snail)	C++17	26 / 100	1 ms	328 KiB

snail

#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define pb push_back
#define eb emplace_back

#define vi vector<int>
#define pi pair<int,int>
#define sz(v) (int)(v).size()
#define all(v) (v).begin(), (v).end()
#define compact(v) (v).erase(unique(all(v)), (v).end())

template<class T> using upq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int lwrbound(const vector<T>& a, const T& b, const int s = 0){return int(lower_bound(s + all(a), b) - a.begin());}
template<class T> int uprbound(const vector<T>& a, const T& b, const int s = 0){return int(upper_bound(s + all(a), b) - a.begin());}

#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define ROF(i, a, b) for(int i = (a); i >= (b); i--)
#define sumof(x) accumulate(all(x), 0ll)
#define dbg(x) "[" << #x " = " << (x) << "]"
#define el "\n"

using ll = long long;
using ld = long double;

template<class T> bool ckmx(T& a, const T b){return (a < b ? a = b, true : false);}
template<class T> bool ckmn(T& a, const T b){return (a > b ? a = b, true : false);}

const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
const ll INF = numeric_limits<ll>::max() / 8;

#define int long long

void Main()
{
    int H, n; cin >> H >> n;

    vi P(n + 1); FOR(i, 1, n) cin >> P[i];

    if(sumof(P) <= 0){
        cout << "-1 -1\n";
        return;
    }

    int fd = 0;
    FOR(i, 1, n){
        fd = max(0ll, fd + P[i]);
        if(fd >= H){
            cout << "0 " << i - 1 << el;
            return;
        }
    }

    int sum = 0;
    FOR(i, 1, n){
        fd = fd + P[i];
        if(fd >= H){
            cout << "1 " << i - 1 << el;
            return;
        } else if(fd < 0){
            cout << "-1 -1\n";
            return;
        }
    }

    H -= fd;
    int dif = sumof(P);

    int cntD = H / dif;

    H -= cntD * dif;
    if(H <= 0){
        cout << cntD + 1 <<" " << n - 1 << el;
        return;
    }

    FOR(i, 1, n - 1){
        H -= P[i];
        if(H <= 0){
            cout << cntD + 2 <<" " << i - 1 << el;
            return;
        }
    }
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    #define name "InvMOD"
    if(fopen(name".INP", "r")){
        freopen(name".INP", "r", stdin);
        freopen(name".OUT", "w", stdout);
    }

    int t = 1; while(t--) Main();
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

snail.cpp: In function 'int32_t main()':
snail.cpp:97:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   97 |         freopen(name".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
snail.cpp:98:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   98 |         freopen(name".OUT", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 11
• Subtask 2: 9 / 9
• Subtask 3: 0 / 25
• Subtask 4: 17 / 17
• Subtask 5: 0 / 38