제출 #241618

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
241618		AmineWeslati	Snail (NOI18_snail)	C++14	37 / 100	6 ms	384 KiB

snail

//Never stop trying
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//s.order_of_key(), *s.find_by_order()

using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;

typedef pair<int,int> pi;
#define fi first
#define se second

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;

#define pb push_back
#define eb emplace_back
#define pf push_front

#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

const int MOD = 1e9+7; //998244353
const ll INF = 1e18;
const int nx[4]={0,0,1,-1}, ny[4]={1,-1,0,0}; //right left down up

int32_t main(){
   boost;
   int H,N; cin>>H>>N;
   int t[N];
   int s=0,mx=0;
   for(int i=0; i<N; i++){
      cin>>t[i];
      s+=t[i];
      mx=max(mx,s);
   }
   if(s<=0){
      cout << -1 << ' ' << -1 << endl;
      return 0;
   }

   int d=H/s+10,idx;
   while(d*s+mx>=H) d--; d++;
   int ss=0;
   for(int i=0; i<N; i++){
      ss+=t[i];
      if(s*d+ss>=H){
         idx=i; break;
      }
   }

   cout << d << ' ' << idx << endl; return 0;

   return 0;
}

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

snail.cpp: In function 'int32_t main()':
snail.cpp:63:4: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
    while(d*s+mx>=H) d--; d++;
    ^~~~~
snail.cpp:63:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
    while(d*s+mx>=H) d--; d++;
                          ^

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