제출 #960450

#제출 시각아이디문제언어결과실행 시간메모리
960450Huseyn123Rabbit Carrot (LMIO19_triusis)C++17
100 / 100
29 ms40668 KiB
#include <bits/stdc++.h> //#define int ll #define MAX 1000001 #define INF INT_MAX #define MOD 1000000007 #define mp make_pair #define mt make_tuple #define pb push_back #define ins insert #define ff first #define ss second #define all(a) a.begin(),a.end() #define lb(a,b) lower_bound(all(a),b) #define ub(a,b) upper_bound(all(a),b) #define sortv(a) sort(all(a)) #define outputar(a,b){\ for(int i=0;i<b;i++){\ cout << a[i] << " ";\ }\ cout << "\n";\ } #define outputvec(a){\ for(auto x:a){\ cout << (int)x << " ";\ }\ cout << endl;\ } #define reset(a,n,v){\ for(int i=0;i<n;i++){\ a[i]=v;\ }\ } using namespace std; typedef long long ll; typedef unsigned long long ull; typedef tuple<ll,ll,ll> tll; typedef pair<ll,ll> pll; typedef pair<int,int> pii; typedef double db; typedef long double ldb; inline void USACO(string filename){ freopen((filename+".in").c_str(),"r",stdin); freopen((filename+".out").c_str(),"w",stdout); } int n,q,t=1,m,k,x,y,z,x2,y2,z2,a[MAX],b[MAX],e[MAX],ans[MAX],res; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); string s[MAX],str[1]; //int e[1001][1001]; //bool e1[1001][1001]; string s1,s2,s3; const int mod = 998244353; int dx[4]={0,0,1,-1}; int dy[4]={1,-1,0,0}; void solve(){ cin >> n >> m; for(int i=0;i<n;i++){ cin >> a[i]; } for(int i=0;i<n;i++){ a[i]=a[i]-(i+1)*m; } vector<int> c; for(int i=n-1;i>=0;i--){ if(a[i]>0){ continue; } int h=ub(c,a[i])-c.begin(); if(h==(int)c.size()){ c.pb(a[i]); } else{ c[h]=a[i]; } } cout << n-(int)c.size() << "\n"; } signed main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); //cin >> t; ll cnt1=1; while(t--){ solve(); } }

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

triusis.cpp: In function 'int main()':
triusis.cpp:82:8: warning: unused variable 'cnt1' [-Wunused-variable]
   82 |     ll cnt1=1;
      |        ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...