oj.uz

Submission #967361

# Submission time Handle Problem Language Result Execution time Memory
967361 2024-04-22T03:07:09 Z owoovo Fun Tour (APIO20_fun) C++17
10 / 100
 102 ms 15680 KB 
#include "fun.h"
#include<bits/stdc++.h>
#define ll long long 
#define F first 
#define S second 
using namespace std;
vector<int> createFunTour(int n, int q) {
  int root=0,hf=(n+1)/2,mn=n;
  for(int i=0;i<n;i++){
    int A=attractionsBehind(0,i);
    if(A>hf&&A<mn){
      mn=A,root=i;
    }
  }
  int tr[100010],tc[3][100010];
  vector<int> ch;
  priority_queue<pair<int,int>> sub[3];
  for(int i=0;i<n;i++){
    tr[i]=hoursRequired(root,i);
    if(tr[i]==1)ch.push_back(i);
  }
  int chsz=ch.size();
  for(int j=0;j<n;j++){
    if(j==root)continue;
    int to=chsz-1;
    for(int i=0;i<chsz-1;i++){
      tc[i][j]=hoursRequired(ch[i],j);
      if(tc[i][j]<tr[j])to=i;
    }
    sub[to].push({tr[j],j});
  }
  int left=(n-1),mer=0,last=-1;
  vector<int> ans;
  while(left>0){
    pair<int,int> best={0,-1};
    for(int j=0;j<chsz;j++){
      if(j!=last&&(!sub[j].empty())&&sub[j].top().F>best.F){
        best={sub[j].top().F,j};
      }
    }
    pair<int,int> mxsz={0,0};
    for(int j=0;j<chsz;j++){
      if(j!=last&&(!sub[j].empty())&&sub[j].size()>mxsz.F){
        mxsz={sub[j].size(),j};
      }
    }

    // if(mer==0&&mxsz.F*2>left){
    //   mer=1;
    //   int lf=3-last-mxsz.S;
    //   if(((!sub[lf].empty())&&(!sub[last].empty()))&&sub[lf].top().F>sub[last].top().F){
    //     left--;
    //     last=lf;
    //     auto [x,y]=sub[last].top();
    //     sub[last].pop();
    //     ans.push_back(y);
    //   }
    //   best.S=mxsz.S;
    //   if(last==mxsz.S)last=(last+1)%3;
    //   lf=3-last-mxsz.S;
    //   while(!sub[lf].empty()){
    //     sub[last].push(sub[lf].top());
    //     sub[lf].pop();
    //   }
    // }
    if(best.S==-1){
      for(int j=0;j<chsz;j++){
        if(!sub[j].empty())best.S=j;
      }
    }
    auto [x,y]=sub[best.S].top();
    sub[best.S].pop();
    last=best.S;
    ans.push_back(y);
    left--;
  }
  ans.push_back(root);
  return ans;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:43:51: warning: comparison of integer expressions of different signedness: 'std::priority_queue<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   43 |       if(j!=last&&(!sub[j].empty())&&sub[j].size()>mxsz.F){
      |                                                   ^
fun.cpp:32:18: warning: unused variable 'mer' [-Wunused-variable]
   32 |   int left=(n-1),mer=0,last=-1;
      |                  ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 1 ms 684 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 3 ms 604 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 1 ms 684 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 3 ms 604 KB Output is correct
21 Correct 0 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 0 ms 604 KB Output is correct
29 Incorrect 1 ms 860 KB Tour is not fun
30 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 856 KB Output is correct
18 Correct 102 ms 15680 KB Output is correct
19 Incorrect 2 ms 860 KB Tour is not fun
20 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Incorrect 1 ms 860 KB Tour is not fun
9 Halted 0 ms 0 KB -

Subtask #5
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 1 ms 684 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 3 ms 604 KB Output is correct
21 Correct 0 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 0 ms 604 KB Output is correct
29 Incorrect 1 ms 860 KB Tour is not fun
30 Halted 0 ms 0 KB -