oj.uz

Submission #732139

# Submission time Handle Problem Language Result Execution time Memory
732139 2023-04-28T14:09:14 Z beaboss Circus (Balkan15_CIRCUS) C++14
0 / 100
 21 ms 1316 KB 
#include "bits/stdc++.h"

using namespace std;

#define s second
#define f first
#define pb push_back

// typedef long long ll;
typedef int ll;

typedef vector<ll> vi;
typedef pair<ll, ll> pii;

// const ll N = 100001;


deque<pii> vals;

void init(int n, int m, int x[]){

	vals.pb({m - 0, m});

	for (ll i = n - 1; i>= 0; i--) {
		auto it = lower_bound(vals.begin(), vals.end(), make_pair(x[i], -1)) - vals.begin();
		// cout << x[i] << vals[it].s << (vals[it].s - x[i]) << endl;
		while (vals.size() > 0 && x[i] - (vals[it].s - x[i]) > vals.front().f) vals.pop_front();
		vals.push_front({x[i] - (vals[it].s - x[i]), x[i]});
	}


}
ll minLength(int d) {
	auto it = lower_bound(vals.begin(), vals.end(), make_pair(d, -1)) - vals.begin();
	return vals[it].s - d;
}

Compilation message

grader.cpp: In function 'int main()':
grader.cpp:14:12: warning: unused variable 'max_code' [-Wunused-variable]
   14 |  long long max_code;
      |            ^~~~~~~~
grader.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |  scanf("%d%d", &N, &M);
      |  ~~~~~^~~~~~~~~~~~~~~~
grader.cpp:18:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |   scanf("%d", &P[i]);
      |   ~~~~~^~~~~~~~~~~~~
grader.cpp:21:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |  scanf("%d", &Q);
      |  ~~~~~^~~~~~~~~~
grader.cpp:23:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |   scanf("%d", &d);
      |   ~~~~~^~~~~~~~~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 1316 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 308 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 308 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 308 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 1316 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 1316 KB Output isn't correct
2 Halted 0 ms 0 KB -