oj.uz

Submission #250758

# Submission time Handle Problem Language Result Execution time Memory
250758 2020-07-19T05:05:46 Z IsaacMoris Minerals (JOI19_minerals) C++14
6 / 100
 16 ms 384 KB 
#include<iostream>
#include <bits/stdc++.h>
#include "minerals.h"
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
void Solve(int N)
{
    vector<int> v;
    for (int i = 1; i <= 2 * N; ++i)
        v.push_back(i);
    for(int i=0; i<50; i++)
        random_shuffle(v.begin(),v.end());
    stack<int> st;
    int last=0;
    while(!v.empty())
    {
        int x= Query(v.back());
        if(x!=last)
        {
            st.push(v.back());
            v.pop_back();
            last=x;
            continue;
        }
        int a=v.back();
        v.pop_back();
        while(1)
        {
            x=Query(st.top());
            if(x!=last)
            {
                v.push_back(st.top());
                st.pop();
                last=x;
                continue;
            }
            Answer(st.top(), a);
            st.pop();
            last=Query(a);
            break;
        }
    }
}

Subtask #1
6.0 / 6.0

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

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Incorrect 16 ms 384 KB Wrong Answer [2]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Incorrect 16 ms 384 KB Wrong Answer [2]
7 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Incorrect 16 ms 384 KB Wrong Answer [2]
7 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Incorrect 16 ms 384 KB Wrong Answer [2]
7 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Incorrect 16 ms 384 KB Wrong Answer [2]
7 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Incorrect 16 ms 384 KB Wrong Answer [2]
7 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Incorrect 16 ms 384 KB Wrong Answer [2]
7 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Incorrect 16 ms 384 KB Wrong Answer [2]
7 Halted 0 ms 0 KB -