oj.uz

Submission #154169

# Submission time Handle Problem Language Result Execution time Memory
154169 2019-09-18T17:55:04 Z AKaan37 Rabbit Carrot (LMIO19_triusis) C++17
0 / 100
 1000 ms 508 KB 
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< int,int > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t;
int cev;
string s;
vector<int> v;

inline int f(int sira,int yuk){
	int cevv=inf;
	if(sira>n)return 0;
	if(sira==0){
		if(a[1]<=m){
			cevv=min(cevv,f(sira+1,a[1]));
			cevv=min(cevv,f(sira+1,m)+1);
		}
		else{
			cevv=min(cevv,f(sira+1,m)+1);
			//~ cout<<" "<<sira<<endl;
		}
	}
	else{
		if(a[sira+1]<=yuk+m){
			cevv=min(cevv,f(sira+1,yuk+m)+1);
			cevv=min(cevv,f(sira+1,yuk));
		}
		else{
			cevv=min(cevv,f(sira+1,yuk+m)+1);
		}
	}
	return cevv;
}

int main(void){
	scanf("%d %d",&n,&m);
	FOR{
		scanf("%d",&a[i]);
	}
	printf("%d\n",f(0,0));
	return 0;
}

Compilation message

triusis.cpp: In function 'int main()':
triusis.cpp:67:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
triusis.cpp:69:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a[i]);
   ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Incorrect 2 ms 380 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 480 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Execution timed out 1070 ms 508 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Execution timed out 1081 ms 504 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Execution timed out 1081 ms 504 KB Time limit exceeded
3 Halted 0 ms 0 KB -