oj.uz

답안 #960110

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960110 2024-04-09T16:37:27 Z Pety Volontiranje (COCI21_volontiranje) C++14
10 / 110
 20 ms 47704 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int N = 1e6+2;
int aib[N], dp[N], n, a[N];
set<int>LIS[N];
void update (int x, int val) {
  for (int i = x; i <= n; i += (i & -i))
    aib[i] = max(aib[i],val);
}
int query (int x) {
  int s= 0;
  for (int i = x; i; i -= (i & -i))
    s = max(s, aib[i]);
  return s;
}
 
int main () 
{
  ios_base::sync_with_stdio(false);
  cin.tie(0); cout.tie(0);
  cin >> n;
  int mx = 0;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    a[i] = x;
    dp[i] = query(x) + 1;
    update(x, dp[i]);
    LIS[dp[i]].insert(-i);
    mx = max(mx, dp[i]);
  }
  vector<vector<int>>ans;
  while (LIS[mx].size()) {
    int last = *LIS[mx].begin();
    last = -last;
    LIS[mx].erase(-last);
    vector<int>sir;
    sir.push_back(last);
    for (int i = mx - 1; i >= 1; i--) {
      bool gasit = 0;
      for (auto it : LIS[i]) {
        if (-it < last && a[-it] < a[last]) {
          last = -it;
          sir.push_back(last);
          gasit = 1;
          break;
        }
      }
      LIS[i].erase(-last);
      if (!gasit) 
        break;
    }
    if (sir.size() < mx) continue;
    reverse(sir.begin(), sir.end());
    ans.push_back(sir);
  }
  cout << ans.size() << " " << ans[0].size() << "\n";
  for (auto s : ans) {
    for (auto it : s)
      cout << it << " ";
    cout << "\n";
  }
  return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:55:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   55 |     if (sir.size() < mx) continue;
      |         ~~~~~~~~~~~^~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 47196 KB Output is correct
2 Correct 16 ms 47440 KB Output is correct
3 Correct 16 ms 47196 KB Output is correct
4 Correct 15 ms 47196 KB Output is correct
5 Correct 16 ms 47196 KB Output is correct
6 Correct 19 ms 47380 KB Output is correct
7 Correct 20 ms 47604 KB Output is correct
8 Correct 16 ms 47196 KB Output is correct
9 Correct 16 ms 47216 KB Output is correct
10 Correct 17 ms 47452 KB Output is correct
11 Correct 16 ms 47420 KB Output is correct
12 Correct 17 ms 47452 KB Output is correct
13 Correct 17 ms 47196 KB Output is correct
14 Correct 15 ms 47200 KB Output is correct
15 Correct 15 ms 47220 KB Output is correct
16 Correct 15 ms 47452 KB Output is correct
17 Correct 16 ms 47196 KB Output is correct
18 Correct 20 ms 47476 KB Output is correct
19 Correct 16 ms 47452 KB Output is correct
20 Correct 15 ms 47452 KB Output is correct
21 Correct 16 ms 47192 KB Output is correct
22 Correct 16 ms 47704 KB Output is correct
23 Correct 16 ms 47364 KB Output is correct

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 47196 KB Output is correct
2 Correct 16 ms 47440 KB Output is correct
3 Correct 16 ms 47196 KB Output is correct
4 Correct 15 ms 47196 KB Output is correct
5 Correct 16 ms 47196 KB Output is correct
6 Correct 19 ms 47380 KB Output is correct
7 Correct 20 ms 47604 KB Output is correct
8 Correct 16 ms 47196 KB Output is correct
9 Correct 16 ms 47216 KB Output is correct
10 Correct 17 ms 47452 KB Output is correct
11 Correct 16 ms 47420 KB Output is correct
12 Correct 17 ms 47452 KB Output is correct
13 Correct 17 ms 47196 KB Output is correct
14 Correct 15 ms 47200 KB Output is correct
15 Correct 15 ms 47220 KB Output is correct
16 Correct 15 ms 47452 KB Output is correct
17 Correct 16 ms 47196 KB Output is correct
18 Correct 20 ms 47476 KB Output is correct
19 Correct 16 ms 47452 KB Output is correct
20 Correct 15 ms 47452 KB Output is correct
21 Correct 16 ms 47192 KB Output is correct
22 Correct 16 ms 47704 KB Output is correct
23 Correct 16 ms 47364 KB Output is correct
24 Correct 16 ms 47448 KB Output is correct
25 Correct 15 ms 47452 KB Output is correct
26 Correct 16 ms 47452 KB Output is correct
27 Correct 16 ms 47496 KB Output is correct
28 Correct 20 ms 47432 KB Output is correct
29 Correct 17 ms 47452 KB Output is correct
30 Correct 16 ms 47576 KB Output is correct
31 Correct 17 ms 47304 KB Output is correct
32 Correct 16 ms 47448 KB Output is correct
33 Incorrect 17 ms 47532 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 47196 KB Output is correct
2 Correct 16 ms 47440 KB Output is correct
3 Correct 16 ms 47196 KB Output is correct
4 Correct 15 ms 47196 KB Output is correct
5 Correct 16 ms 47196 KB Output is correct
6 Correct 19 ms 47380 KB Output is correct
7 Correct 20 ms 47604 KB Output is correct
8 Correct 16 ms 47196 KB Output is correct
9 Correct 16 ms 47216 KB Output is correct
10 Correct 17 ms 47452 KB Output is correct
11 Correct 16 ms 47420 KB Output is correct
12 Correct 17 ms 47452 KB Output is correct
13 Correct 17 ms 47196 KB Output is correct
14 Correct 15 ms 47200 KB Output is correct
15 Correct 15 ms 47220 KB Output is correct
16 Correct 15 ms 47452 KB Output is correct
17 Correct 16 ms 47196 KB Output is correct
18 Correct 20 ms 47476 KB Output is correct
19 Correct 16 ms 47452 KB Output is correct
20 Correct 15 ms 47452 KB Output is correct
21 Correct 16 ms 47192 KB Output is correct
22 Correct 16 ms 47704 KB Output is correct
23 Correct 16 ms 47364 KB Output is correct
24 Correct 16 ms 47448 KB Output is correct
25 Correct 15 ms 47452 KB Output is correct
26 Correct 16 ms 47452 KB Output is correct
27 Correct 16 ms 47496 KB Output is correct
28 Correct 20 ms 47432 KB Output is correct
29 Correct 17 ms 47452 KB Output is correct
30 Correct 16 ms 47576 KB Output is correct
31 Correct 17 ms 47304 KB Output is correct
32 Correct 16 ms 47448 KB Output is correct
33 Incorrect 17 ms 47532 KB Output isn't correct
34 Halted 0 ms 0 KB -