oj.uz

답안 #849356

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
849356 2023-09-14T14:13:20 Z vjudge1 Art Collections (BOI22_art) C++17
35 / 100
 156 ms 63400 KB 
#include <bits/stdc++.h>
#define all(v) ((v).begin(),(v).end())
#define ll long long
#define F first
#define S second
const ll mod = 1e9 + 7;
const ll mxN = 1e5 + 2;
using namespace std;
// void __attribute__((noreturn)) __attribute__((format(printf, 1, 2))) result(const char *msg, ...) {
//   va_list args;
//   va_start(args, msg);
//   vfprintf(stdout, msg, args);
//   fprintf(stdout, "\n");
//   va_end(args);
//   exit(0);
// }
// 
// namespace {
//   int N;
//   int Q = 0;
//   const int MAX_Q = 4000;
//   const int MAX_N = 4000;
//   vector<int> solution;
// }  // namespace
// 
// 
// void __attribute__((noreturn)) answer(vector<int> R) {
//   printf("answer({");
//   for(int i = 0; i < int(R.size()); ++i) {
//     if(i == 0)
//     printf("%d", R[i]);
//     else
//     printf(", %d", R[i]);
//   }
//   printf("})\n");
//   fflush(stdout);
// 
// 
//   if(R == solution)
//   result("Correct: %d published ranking(s).", Q);
//   else
//   result("Wrong answer!");
// }

int publish(vector<int> R);
  // printf("publish({");
  // for(int i = 0; i < int(R.size()); ++i) {
  //   if(i == 0)
  //   printf("%d", R[i]);
  //   else
  //   printf(", %d", R[i]);
  // }
  // printf("})\n");
  // fflush(stdout);
// 
//   if (++Q > MAX_Q)
//   result("Too many published rankings!");
// 
//   if (int(R.size()) != N)
//   result("Invalid published ranking!");
// 
//   set<int> chosen;
//   for(auto &x : R) {
//     if(x < 1 || x > N || chosen.count(x))
//     result("Invalid published ranking!");
//     chosen.insert(x);
//   }
//   vector<int> positions(N+1);
//   for(int i = 0; i < N; ++i)
//   positions[R[i]] = i;
// 
//   int complaints = 0;
//   for(int i = 0; i < N; ++i) {
//     for(int j = i+1; j < N; ++j) {
//       if(positions[solution[i]] > positions[solution[j]])
//       ++complaints;
//     }
//   }
// 
//   return complaints;
// }

void answer(std::vector<int>);
int comp[4002][4002];
bool compare(int a,int b,int N){
  if(comp[a][b] != -1) return comp[a][b];
  vector<int> ch1,ch2;
  ch2.push_back(b);
  ch2.push_back(a);
  ch1.push_back(a);
  ch1.push_back(b);
  for(int i = 1;i <= N;i++){
    if(i != a && i != b){
      ch1.push_back(i);
      ch2.push_back(i);
    }
  }

  return comp[a][b] = (publish(ch1) < publish(ch2));
}
vector<int>og;
vector<int>mergeSort(int l,int r,int N){
  if(l == r) return og;
  int md = (l + r) / 2;
  vector<int> a = mergeSort(l,md,N);
  vector<int> b = mergeSort(md + 1,r,N);
  vector<int> c;
  for(int i = 0;i < l;i++){
    c.push_back(i + 1);
  }
  int j = md + 1;
  int i = l;
  while(i <= md || j <= r){
    if(j > r){
      c.push_back(a[i]);
      i++;
    }
    else if(i > md){
      c.push_back(b[j]);
      j++;
    }
    else if(compare(a[i],b[j],N)){
      c.push_back(a[i]);
      i++;
    }else{
      c.push_back(b[j]);
      j++;
    }
  }
  for(int i = r;i < N - 1;i++){
    c.push_back(i + 1);
  }
  // cout<<l<<' '<<r<<'\n';
  // for(auto x : c) cout<<x<<' ';
  // cout<<'\n';
  return c;
}

void solve(int N) {
    memset(comp,-1,sizeof comp);
    for(int i = 1;i <= N;i++) og.push_back(i);
    answer(mergeSort(0,N - 1,N));
}

// 
// int main() {
//     if (scanf("%d", &N) != 1 || N < 2 || N > MAX_N)
//         result("Invalid input!");
// 
//     solution.resize(N);
//     set<int> chosen;
//     for(auto &x : solution) {
//         if(scanf("%d", &x) != 1 || x < 1 || x > N || chosen.count(x))
//             result("Invalid input!");
//         chosen.insert(x);
//     }
// 
//     solve(N);
// 
//     result("No answer!");
// }

Compilation message

art.cpp: In function 'bool compare(int, int, int)':
art.cpp:99:21: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   99 |   return comp[a][b] = (publish(ch1) < publish(ch2));
      |          ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interface.cpp: In function 'int publish(std::vector<int>)':
interface.cpp:20:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~
interface.cpp: In function 'void answer(std::vector<int>)':
interface.cpp:36:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 63064 KB Output is correct
2 Correct 8 ms 63064 KB Output is correct
3 Correct 8 ms 62868 KB Output is correct
4 Correct 8 ms 63064 KB Output is correct
5 Correct 8 ms 63064 KB Output is correct
6 Correct 8 ms 63064 KB Output is correct
7 Correct 7 ms 63064 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 63064 KB Output is correct
2 Correct 8 ms 63064 KB Output is correct
3 Correct 8 ms 62868 KB Output is correct
4 Correct 8 ms 63064 KB Output is correct
5 Correct 8 ms 63064 KB Output is correct
6 Correct 8 ms 63064 KB Output is correct
7 Correct 7 ms 63064 KB Output is correct
8 Correct 8 ms 63064 KB Output is correct
9 Correct 10 ms 62900 KB Output is correct
10 Correct 10 ms 63124 KB Output is correct
11 Correct 11 ms 62916 KB Output is correct
12 Correct 10 ms 63064 KB Output is correct
13 Correct 8 ms 63064 KB Output is correct
14 Correct 8 ms 63064 KB Output is correct
15 Correct 8 ms 63064 KB Output is correct
16 Correct 8 ms 62912 KB Output is correct
17 Correct 8 ms 63064 KB Output is correct
18 Correct 8 ms 63064 KB Output is correct
19 Correct 9 ms 63064 KB Output is correct
20 Correct 9 ms 63064 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 63064 KB Output is correct
2 Correct 8 ms 63064 KB Output is correct
3 Correct 8 ms 62868 KB Output is correct
4 Correct 8 ms 63064 KB Output is correct
5 Correct 8 ms 63064 KB Output is correct
6 Correct 8 ms 63064 KB Output is correct
7 Correct 7 ms 63064 KB Output is correct
8 Correct 8 ms 63064 KB Output is correct
9 Correct 10 ms 62900 KB Output is correct
10 Correct 10 ms 63124 KB Output is correct
11 Correct 11 ms 62916 KB Output is correct
12 Correct 10 ms 63064 KB Output is correct
13 Correct 8 ms 63064 KB Output is correct
14 Correct 8 ms 63064 KB Output is correct
15 Correct 8 ms 63064 KB Output is correct
16 Correct 8 ms 62912 KB Output is correct
17 Correct 8 ms 63064 KB Output is correct
18 Correct 8 ms 63064 KB Output is correct
19 Correct 9 ms 63064 KB Output is correct
20 Correct 9 ms 63064 KB Output is correct
21 Correct 8 ms 63064 KB Output is correct
22 Correct 10 ms 63116 KB Output is correct
23 Correct 10 ms 63320 KB Output is correct
24 Correct 10 ms 63064 KB Output is correct
25 Correct 10 ms 63336 KB Output is correct
26 Correct 51 ms 63380 KB Output is correct
27 Correct 49 ms 63388 KB Output is correct
28 Correct 79 ms 63136 KB Output is correct
29 Correct 80 ms 63388 KB Output is correct
30 Correct 81 ms 63128 KB Output is correct
31 Correct 84 ms 63392 KB Output is correct
32 Correct 8 ms 63064 KB Output is correct
33 Correct 8 ms 63100 KB Output is correct
34 Correct 8 ms 63064 KB Output is correct
35 Correct 8 ms 63064 KB Output is correct
36 Correct 8 ms 63080 KB Output is correct
37 Correct 8 ms 63064 KB Output is correct
38 Correct 10 ms 62908 KB Output is correct
39 Correct 10 ms 63064 KB Output is correct

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 63064 KB Output is correct
2 Correct 8 ms 63064 KB Output is correct
3 Correct 8 ms 62868 KB Output is correct
4 Correct 8 ms 63064 KB Output is correct
5 Correct 8 ms 63064 KB Output is correct
6 Correct 8 ms 63064 KB Output is correct
7 Correct 7 ms 63064 KB Output is correct
8 Correct 8 ms 63064 KB Output is correct
9 Correct 10 ms 62900 KB Output is correct
10 Correct 10 ms 63124 KB Output is correct
11 Correct 11 ms 62916 KB Output is correct
12 Correct 10 ms 63064 KB Output is correct
13 Correct 8 ms 63064 KB Output is correct
14 Correct 8 ms 63064 KB Output is correct
15 Correct 8 ms 63064 KB Output is correct
16 Correct 8 ms 62912 KB Output is correct
17 Correct 8 ms 63064 KB Output is correct
18 Correct 8 ms 63064 KB Output is correct
19 Correct 9 ms 63064 KB Output is correct
20 Correct 9 ms 63064 KB Output is correct
21 Correct 8 ms 63064 KB Output is correct
22 Correct 10 ms 63116 KB Output is correct
23 Correct 10 ms 63320 KB Output is correct
24 Correct 10 ms 63064 KB Output is correct
25 Correct 10 ms 63336 KB Output is correct
26 Correct 51 ms 63380 KB Output is correct
27 Correct 49 ms 63388 KB Output is correct
28 Correct 79 ms 63136 KB Output is correct
29 Correct 80 ms 63388 KB Output is correct
30 Correct 81 ms 63128 KB Output is correct
31 Correct 84 ms 63392 KB Output is correct
32 Correct 8 ms 63064 KB Output is correct
33 Correct 8 ms 63100 KB Output is correct
34 Correct 8 ms 63064 KB Output is correct
35 Correct 8 ms 63064 KB Output is correct
36 Correct 8 ms 63080 KB Output is correct
37 Correct 8 ms 63064 KB Output is correct
38 Correct 10 ms 62908 KB Output is correct
39 Correct 10 ms 63064 KB Output is correct
40 Correct 8 ms 63064 KB Output is correct
41 Correct 10 ms 63064 KB Output is correct
42 Correct 10 ms 63064 KB Output is correct
43 Correct 10 ms 63064 KB Output is correct
44 Correct 11 ms 63084 KB Output is correct
45 Correct 56 ms 63388 KB Output is correct
46 Correct 52 ms 63136 KB Output is correct
47 Correct 80 ms 63388 KB Output is correct
48 Correct 94 ms 63128 KB Output is correct
49 Correct 92 ms 63132 KB Output is correct
50 Correct 79 ms 63388 KB Output is correct
51 Correct 8 ms 63064 KB Output is correct
52 Incorrect 156 ms 63400 KB Not correct
53 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 63064 KB Output is correct
2 Correct 8 ms 63064 KB Output is correct
3 Correct 8 ms 62868 KB Output is correct
4 Correct 8 ms 63064 KB Output is correct
5 Correct 8 ms 63064 KB Output is correct
6 Correct 8 ms 63064 KB Output is correct
7 Correct 7 ms 63064 KB Output is correct
8 Correct 8 ms 63064 KB Output is correct
9 Correct 10 ms 62900 KB Output is correct
10 Correct 10 ms 63124 KB Output is correct
11 Correct 11 ms 62916 KB Output is correct
12 Correct 10 ms 63064 KB Output is correct
13 Correct 8 ms 63064 KB Output is correct
14 Correct 8 ms 63064 KB Output is correct
15 Correct 8 ms 63064 KB Output is correct
16 Correct 8 ms 62912 KB Output is correct
17 Correct 8 ms 63064 KB Output is correct
18 Correct 8 ms 63064 KB Output is correct
19 Correct 9 ms 63064 KB Output is correct
20 Correct 9 ms 63064 KB Output is correct
21 Correct 8 ms 63064 KB Output is correct
22 Correct 10 ms 63116 KB Output is correct
23 Correct 10 ms 63320 KB Output is correct
24 Correct 10 ms 63064 KB Output is correct
25 Correct 10 ms 63336 KB Output is correct
26 Correct 51 ms 63380 KB Output is correct
27 Correct 49 ms 63388 KB Output is correct
28 Correct 79 ms 63136 KB Output is correct
29 Correct 80 ms 63388 KB Output is correct
30 Correct 81 ms 63128 KB Output is correct
31 Correct 84 ms 63392 KB Output is correct
32 Correct 8 ms 63064 KB Output is correct
33 Correct 8 ms 63100 KB Output is correct
34 Correct 8 ms 63064 KB Output is correct
35 Correct 8 ms 63064 KB Output is correct
36 Correct 8 ms 63080 KB Output is correct
37 Correct 8 ms 63064 KB Output is correct
38 Correct 10 ms 62908 KB Output is correct
39 Correct 10 ms 63064 KB Output is correct
40 Correct 8 ms 63064 KB Output is correct
41 Correct 10 ms 63064 KB Output is correct
42 Correct 10 ms 63064 KB Output is correct
43 Correct 10 ms 63064 KB Output is correct
44 Correct 11 ms 63084 KB Output is correct
45 Correct 56 ms 63388 KB Output is correct
46 Correct 52 ms 63136 KB Output is correct
47 Correct 80 ms 63388 KB Output is correct
48 Correct 94 ms 63128 KB Output is correct
49 Correct 92 ms 63132 KB Output is correct
50 Correct 79 ms 63388 KB Output is correct
51 Correct 8 ms 63064 KB Output is correct
52 Incorrect 156 ms 63400 KB Not correct
53 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 63064 KB Output is correct
2 Correct 8 ms 63064 KB Output is correct
3 Correct 8 ms 62868 KB Output is correct
4 Correct 8 ms 63064 KB Output is correct
5 Correct 8 ms 63064 KB Output is correct
6 Correct 8 ms 63064 KB Output is correct
7 Correct 7 ms 63064 KB Output is correct
8 Correct 8 ms 63064 KB Output is correct
9 Correct 10 ms 62900 KB Output is correct
10 Correct 10 ms 63124 KB Output is correct
11 Correct 11 ms 62916 KB Output is correct
12 Correct 10 ms 63064 KB Output is correct
13 Correct 8 ms 63064 KB Output is correct
14 Correct 8 ms 63064 KB Output is correct
15 Correct 8 ms 63064 KB Output is correct
16 Correct 8 ms 62912 KB Output is correct
17 Correct 8 ms 63064 KB Output is correct
18 Correct 8 ms 63064 KB Output is correct
19 Correct 9 ms 63064 KB Output is correct
20 Correct 9 ms 63064 KB Output is correct
21 Correct 8 ms 63064 KB Output is correct
22 Correct 10 ms 63116 KB Output is correct
23 Correct 10 ms 63320 KB Output is correct
24 Correct 10 ms 63064 KB Output is correct
25 Correct 10 ms 63336 KB Output is correct
26 Correct 51 ms 63380 KB Output is correct
27 Correct 49 ms 63388 KB Output is correct
28 Correct 79 ms 63136 KB Output is correct
29 Correct 80 ms 63388 KB Output is correct
30 Correct 81 ms 63128 KB Output is correct
31 Correct 84 ms 63392 KB Output is correct
32 Correct 8 ms 63064 KB Output is correct
33 Correct 8 ms 63100 KB Output is correct
34 Correct 8 ms 63064 KB Output is correct
35 Correct 8 ms 63064 KB Output is correct
36 Correct 8 ms 63080 KB Output is correct
37 Correct 8 ms 63064 KB Output is correct
38 Correct 10 ms 62908 KB Output is correct
39 Correct 10 ms 63064 KB Output is correct
40 Correct 8 ms 63064 KB Output is correct
41 Correct 10 ms 63064 KB Output is correct
42 Correct 10 ms 63064 KB Output is correct
43 Correct 10 ms 63064 KB Output is correct
44 Correct 11 ms 63084 KB Output is correct
45 Correct 56 ms 63388 KB Output is correct
46 Correct 52 ms 63136 KB Output is correct
47 Correct 80 ms 63388 KB Output is correct
48 Correct 94 ms 63128 KB Output is correct
49 Correct 92 ms 63132 KB Output is correct
50 Correct 79 ms 63388 KB Output is correct
51 Correct 8 ms 63064 KB Output is correct
52 Incorrect 156 ms 63400 KB Not correct
53 Halted 0 ms 0 KB -