oj.uz

Submission #794730

# Submission time Handle Problem Language Result Execution time Memory
794730 2023-07-26T20:15:59 Z AbdullahMohammedAhmad Minerals (JOI19_minerals) C++14
6 / 100
 9 ms 632 KB 
#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;
 
void Solve(int N) {
    deque<int> in;
    deque<int> order;
    int prev_ans = 0, ans = 0;
    for(int i = 1; i <= 2*N; i++){order.push_back(i);}
    while(!order.empty())
    {
      	ans = prev_ans = in.size();
        in.push_back(order.front());
        ans = Query(order.front());
        order.pop_front();
        if(ans != prev_ans){continue;}
        vector<int> toput;
        while(true)
        {
            prev_ans = ans;
            int now = in.front();
            ans = Query(now);
            in.pop_front();
            if(ans != prev_ans)
            {
                toput.push_back(now);
            }
            else
            {
              	Query(in.back());
                Answer(now, in.back());
                in.pop_back();
                break;
            }
        }
      	if(toput.empty()){continue;}
        int dist = (int)order.size()/(int)toput.size();
        int idx = dist;
        for(int i = 0; i < toput.size(); i++)
        {
            if(idx >= 0)
            {
                order.push_back(toput[i]);
                idx+=dist;
                continue;
            }
            order.insert(order.begin()+idx, toput[i]);
            idx+=dist;
        }
    }
}

Compilation message

minerals.cpp: In function 'void Solve(int)':
minerals.cpp:39:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         for(int i = 0; i < toput.size(); i++)
      |                        ~~^~~~~~~~~~~~~~

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
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 ms 336 KB Output is correct
3 Correct 5 ms 464 KB Output is correct
4 Incorrect 9 ms 632 KB Wrong Answer [2]
5 Halted 0 ms 0 KB -

Subtask #3
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 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 5 ms 464 KB Output is correct
8 Incorrect 9 ms 632 KB Wrong Answer [2]
9 Halted 0 ms 0 KB -

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 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 5 ms 464 KB Output is correct
8 Incorrect 9 ms 632 KB Wrong Answer [2]
9 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 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 5 ms 464 KB Output is correct
8 Incorrect 9 ms 632 KB Wrong Answer [2]
9 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 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 5 ms 464 KB Output is correct
8 Incorrect 9 ms 632 KB Wrong Answer [2]
9 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 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 5 ms 464 KB Output is correct
8 Incorrect 9 ms 632 KB Wrong Answer [2]
9 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 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 5 ms 464 KB Output is correct
8 Incorrect 9 ms 632 KB Wrong Answer [2]
9 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 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 5 ms 464 KB Output is correct
8 Incorrect 9 ms 632 KB Wrong Answer [2]
9 Halted 0 ms 0 KB -