oj.uz

답안 #71988

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
71988 2018-08-26T04:30:30 Z End Time(#2161, dotorya, zigui) 박스런 (FXCUP3_box) C++17
100 / 100
 164 ms 7424 KB 
#include <stdio.h>  
#include <algorithm>  
#include <assert.h>
#include <bitset>
#include <cmath>  
#include <complex>  
#include <deque>  
#include <functional>  
#include <iostream>  
#include <limits.h>  
#include <map>  
#include <math.h>  
#include <queue>  
#include <set>  
#include <stdlib.h>  
#include <string.h>  
#include <string>  
#include <time.h>  
#include <unordered_map>  
#include <unordered_set>  
#include <vector>  

#pragma warning(disable:4996)  
#pragma comment(linker, "/STACK:336777216")  
using namespace std;

#define mp make_pair  
#define Fi first  
#define Se second  
#define pb(x) push_back(x)  
#define szz(x) ((int)(x).size())  
#define rep(i, n) for(int i=0;i<n;i++)  
#define all(x) (x).begin(), (x).end()  
#define ldb ldouble  

typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;

int IT_MAX = 1 << 19;
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1e-10;

int in[500050];
int prv[500050];
vector <pii> Vl;
int main() {
	int N, i, j;
	scanf("%d", &N);
	for (i = 1; i <= N; i++) scanf("%d", &in[i]);

	for (i = 1; i <= N; i++) {
		while (!Vl.empty()) {
			if (Vl.back().first < in[i]) Vl.pop_back();
			else break;
		}
		if (Vl.empty()) prv[i] = 0;
		else prv[i] = Vl.back().second;
		Vl.emplace_back(in[i], i);
	}

	int mx = 1;
	for (i = 1; i <= N; i++) {
		while (mx <= N) {
			if (mx - prv[mx] > i) break;
			mx++;
		}
		if (mx == N + 1) printf("-1 ");
		else printf("%d ", mx - i);
	}
	return !printf("\n");
}

Compilation message

box.cpp:23:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning(disable:4996)  
 
box.cpp:24:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/STACK:336777216")  
 
box.cpp: In function 'int main()':
box.cpp:57:12: warning: unused variable 'j' [-Wunused-variable]
  int N, i, j;
            ^
box.cpp:58:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
box.cpp:59:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (i = 1; i <= N; i++) scanf("%d", &in[i]);
                           ~~~~~^~~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 464 KB Output is correct
3 Correct 3 ms 524 KB Output is correct
4 Correct 2 ms 532 KB Output is correct
5 Correct 2 ms 592 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 2 ms 612 KB Output is correct
8 Correct 2 ms 612 KB Output is correct
9 Correct 2 ms 612 KB Output is correct
10 Correct 3 ms 612 KB Output is correct
11 Correct 3 ms 620 KB Output is correct

Subtask #2
83.0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 464 KB Output is correct
3 Correct 3 ms 524 KB Output is correct
4 Correct 2 ms 532 KB Output is correct
5 Correct 2 ms 592 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 2 ms 612 KB Output is correct
8 Correct 2 ms 612 KB Output is correct
9 Correct 2 ms 612 KB Output is correct
10 Correct 3 ms 612 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 2 ms 620 KB Output is correct
13 Correct 3 ms 620 KB Output is correct
14 Correct 17 ms 1132 KB Output is correct
15 Correct 26 ms 1660 KB Output is correct
16 Correct 44 ms 1916 KB Output is correct
17 Correct 96 ms 4024 KB Output is correct
18 Correct 119 ms 5036 KB Output is correct
19 Correct 123 ms 6316 KB Output is correct
20 Correct 161 ms 7424 KB Output is correct
21 Correct 164 ms 7424 KB Output is correct