Submission #794728

#	Time	Username	Problem	Language	Result	Execution time	Memory
794728		AbdullahMohammedAhmad	Minerals (JOI19_minerals)	C++14	0 / 100	1 ms	336 KiB

minerals

#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
            {
                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 >= order.size()-1)
            {
                order.push_back(toput[i]);
                idx+=dist;
                continue;
            }
            order.insert(order.begin()+idx, toput[i]);
            idx+=dist;
        }
    }
}

Compilation message (stderr)

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

• Subtask 1: 0 / 6
• Subtask 2: 0 / 25
• Subtask 3: 0 / 9
• Subtask 4: 0 / 30
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 10