oj.uz

Submission #628985

# Submission time Handle Problem Language Result Execution time Memory
628985 2022-08-13T22:29:25 Z welleyth Minerals (JOI19_minerals) C++17
40 / 100
 22 ms 1872 KB 
#include "minerals.h"
#include <vector>
#include <fstream>

void Solve(int N) {
    int col[2*N+1];
    for(int i = 0; i < 2*N+1; i++){
        col[i] = 0;
    }
    int c = 0;
    int in[N+1];
    for(int i = 0; i <= N; i++)
        in[i] = 0;
    int pos[N+1];
    bool is[2*N+1];
    bool was[2*N+1];
    for(int i = 0; i <= 2*N; i++) in[i] = was[i] = false;
    int sz = 0;
    for(int i = 1; i <= 2*N; i++){
        int cur = Query(i);
//        printf("i = %d, cur = %d, c = %d\n",i,cur,c);
        if(cur != sz){
            sz = cur;
//            printf("cur = %d\n",cur);
            pos[cur] = i;
            is[i] = 1;
            in[cur] = 1;
            col[i] = sz;
            was[i] = true;
        } else {
            sz = Query(i);
        }
    }
//    for(int i = 1; i <= 2*N; i++){
//        printf("col[%d] = %d\n",i,col[i]);
//    }
    for(int bt = 0; (1 << bt) <= N; bt++){
        for(int i = 1; i <= N; i++){
            if(in[i] && (i >> bt & 1) == 0){
                sz = Query(pos[i]);
                in[i] = false;
            }
            if(!in[i] && (i >> bt & 1) == 1){
                sz = Query(pos[i]);
                in[i] = true;
            }
//            if(in[i]){
//                printf("%d is in\n",pos[i]);
//            }
        }
//        printf("bt = %d\n",bt);
        for(int i = 1; i <= 2*N; i++){
            if(was[i])
                continue;
            int nw = Query(i);
//            printf("i = %d, sz = %d, nw = %d\n",i,sz,nw);
            if(nw == sz){
                col[i] |= (1 << bt);
            }
            sz = Query(i);
        }
    }
//    for(int i = 1; i <= 2*N; i++){
//        printf("col[%d] = %d\n",i,col[i]);
//    }
    std::vector<int> A[N+1];
    for(int i = 1; i <= 2*N; i++){
        A[col[i]].push_back(i);
    }
    for(int i = 1; i <= N; i++){
        Answer(A[i][0],A[i][1]);
    }
//    printf("ok\n");
    return;
}
/**
4
1 5
2 6
3 4
7 8

**/

Compilation message

minerals.cpp: In function 'void Solve(int)':
minerals.cpp:10:9: warning: unused variable 'c' [-Wunused-variable]
   10 |     int c = 0;
      |         ^
minerals.cpp:15:10: warning: variable 'is' set but not used [-Wunused-but-set-variable]
   15 |     bool is[2*N+1];
      |          ^~

Subtask #1
6.0 / 6.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 464 KB Output is correct
3 Correct 3 ms 592 KB Output is correct
4 Correct 7 ms 988 KB Output is correct
5 Correct 10 ms 1684 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 7 ms 988 KB Output is correct
9 Correct 10 ms 1684 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1316 KB Output is correct
12 Correct 15 ms 1872 KB Output is correct
13 Correct 8 ms 1808 KB Output is correct
14 Correct 11 ms 1796 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 7 ms 988 KB Output is correct
9 Correct 10 ms 1684 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1316 KB Output is correct
12 Correct 15 ms 1872 KB Output is correct
13 Correct 8 ms 1808 KB Output is correct
14 Correct 11 ms 1796 KB Output is correct
15 Incorrect 22 ms 1856 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 7 ms 988 KB Output is correct
9 Correct 10 ms 1684 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1316 KB Output is correct
12 Correct 15 ms 1872 KB Output is correct
13 Correct 8 ms 1808 KB Output is correct
14 Correct 11 ms 1796 KB Output is correct
15 Incorrect 22 ms 1856 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 7 ms 988 KB Output is correct
9 Correct 10 ms 1684 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1316 KB Output is correct
12 Correct 15 ms 1872 KB Output is correct
13 Correct 8 ms 1808 KB Output is correct
14 Correct 11 ms 1796 KB Output is correct
15 Incorrect 22 ms 1856 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 7 ms 988 KB Output is correct
9 Correct 10 ms 1684 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1316 KB Output is correct
12 Correct 15 ms 1872 KB Output is correct
13 Correct 8 ms 1808 KB Output is correct
14 Correct 11 ms 1796 KB Output is correct
15 Incorrect 22 ms 1856 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 7 ms 988 KB Output is correct
9 Correct 10 ms 1684 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1316 KB Output is correct
12 Correct 15 ms 1872 KB Output is correct
13 Correct 8 ms 1808 KB Output is correct
14 Correct 11 ms 1796 KB Output is correct
15 Incorrect 22 ms 1856 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 7 ms 988 KB Output is correct
9 Correct 10 ms 1684 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1316 KB Output is correct
12 Correct 15 ms 1872 KB Output is correct
13 Correct 8 ms 1808 KB Output is correct
14 Correct 11 ms 1796 KB Output is correct
15 Incorrect 22 ms 1856 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -