oj.uz

Submission #530204

# Submission time Handle Problem Language Result Execution time Memory
530204 2022-02-24T19:14:07 Z peuch Teams (CEOI11_tea) C++17
100 / 100
 633 ms 127604 KB 
#include<bits/stdc++.h>
using namespace std;

const int MAXN = 1e6 + 10;

int n;
int dp[MAXN], bt[MAXN];
pair<int, int> v[MAXN];

vector<vector<int> > group;
set<pair<int, int> > tam;

int main(){
  scanf("%d", &n);
  for(int i = 1; i <= n; i++){
    scanf("%d", &v[i].first);
    v[i].second = i;
  }
  sort(v + 1, v + 1 + n);
  reverse(v + 1, v + 1 + n);
  memset(dp, -MAXN, sizeof(dp));
  dp[n + 1] = 0;
  for(int i = n; i > 0; i--){
    dp[i] = dp[i + 1];
    if(i + v[i].first <= n + 1) dp[i] = max(dp[i], dp[i + v[i].first] + 1);
    if(i == 1) dp[i] = dp[i + v[i].first] + 1;
    if(i + v[i].first <= n + 1 && dp[i] == dp[i + v[i].first] + 1) bt[i] = i + v[i].first;
    else bt[i] = i + 1;
  }
  for(int i = 1; i <= n; i++){
    int cur = v[i].second;
    int qnt = v[i].first;
    if(bt[i] != i + qnt){
      fflush(stdout);
      int grp = tam.begin()->second;
      tam.erase(tam.begin());
      group[grp].push_back(cur);
      tam.insert(make_pair(group[grp].size(), grp));
      continue;
    }
    group.push_back(vector<int> (1, cur));
    int idx = group.size() - 1;
    while(--qnt)
      group[idx].push_back(v[++i].second);
    tam.insert(make_pair(group[idx].size(), idx));
  }
  printf("%lu\n", group.size());
  for(int i = 0; i < group.size(); i++){
    printf("%lu ", group[i].size());
    sort(group[i].begin(), group[i].end());
    for(int j = 0; j < group[i].size(); j++)
      printf("%d ", group[i][j]);
    printf("\n");
  }
}

Compilation message

tea.cpp: In function 'int main()':
tea.cpp:48:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |   for(int i = 0; i < group.size(); i++){
      |                  ~~^~~~~~~~~~~~~~
tea.cpp:51:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for(int j = 0; j < group[i].size(); j++)
      |                    ~~^~~~~~~~~~~~~~~~~
tea.cpp:14:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |   scanf("%d", &n);
      |   ~~~~~^~~~~~~~~~
tea.cpp:16:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     scanf("%d", &v[i].first);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4172 KB Output is correct
2 Correct 2 ms 4172 KB Output is correct
3 Correct 2 ms 4172 KB Output is correct
4 Correct 2 ms 4172 KB Output is correct
5 Correct 3 ms 4172 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4172 KB Output is correct
2 Correct 2 ms 4172 KB Output is correct
3 Correct 2 ms 4172 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4172 KB Output is correct
2 Correct 2 ms 4172 KB Output is correct
3 Correct 2 ms 4172 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4300 KB Output is correct
2 Correct 4 ms 4300 KB Output is correct
3 Correct 4 ms 4300 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4300 KB Output is correct
2 Correct 4 ms 4328 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 6040 KB Output is correct
2 Correct 23 ms 6172 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 6180 KB Output is correct
2 Correct 24 ms 6324 KB Output is correct
3 Correct 40 ms 6196 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 238 ms 21596 KB Output is correct
2 Correct 255 ms 24132 KB Output is correct
3 Correct 280 ms 22192 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 357 ms 26864 KB Output is correct
2 Correct 633 ms 127604 KB Output is correct
3 Correct 291 ms 30192 KB Output is correct
4 Correct 292 ms 24432 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 344 ms 26840 KB Output is correct
2 Correct 224 ms 26832 KB Output is correct
3 Correct 304 ms 27572 KB Output is correct
4 Correct 334 ms 26968 KB Output is correct