oj.uz

Submission #907349

# Submission time Handle Problem Language Result Execution time Memory
907349 2024-01-15T11:59:04 Z lighton Minerals (JOI19_minerals) C++17
85 / 100
 35 ms 3604 KB 
#include "minerals.h"
#include <bits/stdc++.h>
#define forf(i,a,b) for(int i = a; i<=b; i++)
using namespace std;
int N,M;
set<int> S;
vector<int> pre,sec;
vector<int> match;
int last;
vector<int> ran;


void dnc(int s, int e , vector<int> v , int d){
    if(s==e){
        for(int i : v) match[i] = sec[s];
        return;
    }
    int m = s+e>>1;
    int now = 0;
    if(last > m) forf(i,m+1,last){ now = Query(sec[i]); }
    else forf(i,last+1,m){ now = Query(sec[i]); }

    vector<int> v1,v2;
    for(int i : v){
        int prv = now;
        if(v1.size() == (m-s+1)){ v2.push_back(i); continue; }
        if(v2.size() == (m-s+1)){ v1.push_back(i); continue; }
        now = Query(pre[i]);
        if(now == prv) v1.push_back(i);
        else v2.push_back(i);
    }
    last = m;
    dnc(m+1,e,v2,d+1);
    last = m;
    dnc(s,m,v1,d+1);
}

void Solve(int N) {
    int now = 0;
    forf(i,1,2*N) ran.push_back(i);
    random_shuffle(ran.begin(), ran.end());
    ran.insert(ran.begin(),0);

    forf(i,1,2*N){
        int prv = now;
        if(pre.size() == N){ sec.push_back(ran[i]); Query(ran[i]); continue; }
        if(sec.size() == N){ pre.push_back(ran[i]); continue; }
        now = Query(ran[i]);
        if(now == prv+1){
            pre.push_back(ran[i]);
        }
        else{
            sec.push_back(ran[i]);
        }
    }
    last = N-1;
    assert(pre.size() == N);
    match.resize(N);

    vector<int> v; forf(i,0,N-1) v.push_back(i);
    dnc(0,N-1,v,1);
    forf(i,0,N-1) Answer(pre[i],match[i]);
}

Compilation message

minerals.cpp: In function 'void dnc(int, int, std::vector<int>, int)':
minerals.cpp:18:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   18 |     int m = s+e>>1;
      |             ~^~
minerals.cpp:26:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   26 |         if(v1.size() == (m-s+1)){ v2.push_back(i); continue; }
      |            ~~~~~~~~~~^~~~~~~~~~
minerals.cpp:27:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   27 |         if(v2.size() == (m-s+1)){ v1.push_back(i); continue; }
      |            ~~~~~~~~~~^~~~~~~~~~
minerals.cpp: In function 'void Solve(int)':
minerals.cpp:46:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   46 |         if(pre.size() == N){ sec.push_back(ran[i]); Query(ran[i]); continue; }
      |            ~~~~~~~~~~~^~~~
minerals.cpp:47:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   47 |         if(sec.size() == N){ pre.push_back(ran[i]); continue; }
      |            ~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from minerals.cpp:2:
minerals.cpp:57:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   57 |     assert(pre.size() == N);
      |            ~~~~~~~~~~~^~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 3 ms 600 KB Output is correct
4 Correct 5 ms 856 KB Output is correct
5 Correct 10 ms 1368 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 10 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 13 ms 1368 KB Output is correct
13 Correct 9 ms 1368 KB Output is correct
14 Correct 12 ms 1624 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 10 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 13 ms 1368 KB Output is correct
13 Correct 9 ms 1368 KB Output is correct
14 Correct 12 ms 1624 KB Output is correct
15 Correct 28 ms 3176 KB Output is correct
16 Correct 27 ms 3268 KB Output is correct
17 Correct 30 ms 3156 KB Output is correct
18 Correct 28 ms 3068 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 10 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 13 ms 1368 KB Output is correct
13 Correct 9 ms 1368 KB Output is correct
14 Correct 12 ms 1624 KB Output is correct
15 Correct 28 ms 3176 KB Output is correct
16 Correct 27 ms 3268 KB Output is correct
17 Correct 30 ms 3156 KB Output is correct
18 Correct 28 ms 3068 KB Output is correct
19 Correct 30 ms 3264 KB Output is correct
20 Correct 27 ms 3140 KB Output is correct
21 Correct 27 ms 3496 KB Output is correct
22 Correct 33 ms 2964 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 10 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 13 ms 1368 KB Output is correct
13 Correct 9 ms 1368 KB Output is correct
14 Correct 12 ms 1624 KB Output is correct
15 Correct 28 ms 3176 KB Output is correct
16 Correct 27 ms 3268 KB Output is correct
17 Correct 30 ms 3156 KB Output is correct
18 Correct 28 ms 3068 KB Output is correct
19 Correct 30 ms 3264 KB Output is correct
20 Correct 27 ms 3140 KB Output is correct
21 Correct 27 ms 3496 KB Output is correct
22 Correct 33 ms 2964 KB Output is correct
23 Correct 29 ms 3152 KB Output is correct
24 Correct 29 ms 3316 KB Output is correct
25 Correct 28 ms 3604 KB Output is correct
26 Correct 32 ms 3568 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 10 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 13 ms 1368 KB Output is correct
13 Correct 9 ms 1368 KB Output is correct
14 Correct 12 ms 1624 KB Output is correct
15 Correct 28 ms 3176 KB Output is correct
16 Correct 27 ms 3268 KB Output is correct
17 Correct 30 ms 3156 KB Output is correct
18 Correct 28 ms 3068 KB Output is correct
19 Correct 30 ms 3264 KB Output is correct
20 Correct 27 ms 3140 KB Output is correct
21 Correct 27 ms 3496 KB Output is correct
22 Correct 33 ms 2964 KB Output is correct
23 Correct 29 ms 3152 KB Output is correct
24 Correct 29 ms 3316 KB Output is correct
25 Correct 28 ms 3604 KB Output is correct
26 Correct 32 ms 3568 KB Output is correct
27 Correct 31 ms 3468 KB Output is correct
28 Correct 31 ms 3352 KB Output is correct
29 Correct 31 ms 3372 KB Output is correct
30 Correct 31 ms 3596 KB Output is correct

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 10 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 13 ms 1368 KB Output is correct
13 Correct 9 ms 1368 KB Output is correct
14 Correct 12 ms 1624 KB Output is correct
15 Correct 28 ms 3176 KB Output is correct
16 Correct 27 ms 3268 KB Output is correct
17 Correct 30 ms 3156 KB Output is correct
18 Correct 28 ms 3068 KB Output is correct
19 Correct 30 ms 3264 KB Output is correct
20 Correct 27 ms 3140 KB Output is correct
21 Correct 27 ms 3496 KB Output is correct
22 Correct 33 ms 2964 KB Output is correct
23 Correct 29 ms 3152 KB Output is correct
24 Correct 29 ms 3316 KB Output is correct
25 Correct 28 ms 3604 KB Output is correct
26 Correct 32 ms 3568 KB Output is correct
27 Correct 31 ms 3468 KB Output is correct
28 Correct 31 ms 3352 KB Output is correct
29 Correct 31 ms 3372 KB Output is correct
30 Correct 31 ms 3596 KB Output is correct
31 Incorrect 35 ms 2936 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 10 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 13 ms 1368 KB Output is correct
13 Correct 9 ms 1368 KB Output is correct
14 Correct 12 ms 1624 KB Output is correct
15 Correct 28 ms 3176 KB Output is correct
16 Correct 27 ms 3268 KB Output is correct
17 Correct 30 ms 3156 KB Output is correct
18 Correct 28 ms 3068 KB Output is correct
19 Correct 30 ms 3264 KB Output is correct
20 Correct 27 ms 3140 KB Output is correct
21 Correct 27 ms 3496 KB Output is correct
22 Correct 33 ms 2964 KB Output is correct
23 Correct 29 ms 3152 KB Output is correct
24 Correct 29 ms 3316 KB Output is correct
25 Correct 28 ms 3604 KB Output is correct
26 Correct 32 ms 3568 KB Output is correct
27 Correct 31 ms 3468 KB Output is correct
28 Correct 31 ms 3352 KB Output is correct
29 Correct 31 ms 3372 KB Output is correct
30 Correct 31 ms 3596 KB Output is correct
31 Incorrect 35 ms 2936 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -