oj.uz

Submission #251034

# Submission time Handle Problem Language Result Execution time Memory
251034 2020-07-20T00:33:16 Z IsaacMoris Minerals (JOI19_minerals) C++14
40 / 100
 120 ms 7796 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;
int low[100009], high[100009], vis[100009];
vector<int> v[100009];

void Solve(int N)
{
    vector<int> v1, v2;
    int last=0;
    for (int i = 1; i <= 2 * N; ++i)
    {
        vis[i]=vis[0]=0;
        int x=Query(i);
        if(x!=last)
            v1.push_back(i);
        else
            v2.push_back(i);
        last=x;
    }
    for(int i=0; i<100; i++)
        random_shuffle(v1.begin(),v1.end());
    for(int i=0; i<N; i++)
        high[i]=N-1, low[i]=0;
    int good=1;
    bool p=1;
    while(good)
    {
        good=0;
        for(int i=0; i<N; i++)
            if(low[i]<=high[i])
                v[low[i]+ (high[i]-low[i])/2].push_back(i);
            else
                vis[high[i]+1]=1;
        for(int i=0; i<N; i++)
        {
            if(vis[i])
                continue;
            int x=Query(v1[i]);
            while(!v[i].empty())
            {
                int id=v[i].back();

                good=1;
                v[i].pop_back();
                int q=Query(v2[id]);
                if((q!=x && p) || (q==x && !p))
                    high[id]=i-1;
                else
                    low[id]=i+1;
                x=q;
            }
        }
        p=!p;
    }
    for(int i=0; i<N; i++)
        Answer(v2[i], v1[high[i]+1]);

}

Subtask #1
6.0 / 6.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2816 KB Output is correct
2 Correct 7 ms 2944 KB Output is correct
3 Correct 13 ms 3200 KB Output is correct
4 Correct 26 ms 3752 KB Output is correct
5 Correct 50 ms 4600 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 4 ms 2816 KB Output is correct
6 Correct 7 ms 2944 KB Output is correct
7 Correct 13 ms 3200 KB Output is correct
8 Correct 26 ms 3752 KB Output is correct
9 Correct 50 ms 4600 KB Output is correct
10 Correct 5 ms 2816 KB Output is correct
11 Correct 34 ms 4216 KB Output is correct
12 Correct 50 ms 4728 KB Output is correct
13 Correct 51 ms 4728 KB Output is correct
14 Correct 50 ms 4600 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 4 ms 2816 KB Output is correct
6 Correct 7 ms 2944 KB Output is correct
7 Correct 13 ms 3200 KB Output is correct
8 Correct 26 ms 3752 KB Output is correct
9 Correct 50 ms 4600 KB Output is correct
10 Correct 5 ms 2816 KB Output is correct
11 Correct 34 ms 4216 KB Output is correct
12 Correct 50 ms 4728 KB Output is correct
13 Correct 51 ms 4728 KB Output is correct
14 Correct 50 ms 4600 KB Output is correct
15 Incorrect 120 ms 7796 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 4 ms 2816 KB Output is correct
6 Correct 7 ms 2944 KB Output is correct
7 Correct 13 ms 3200 KB Output is correct
8 Correct 26 ms 3752 KB Output is correct
9 Correct 50 ms 4600 KB Output is correct
10 Correct 5 ms 2816 KB Output is correct
11 Correct 34 ms 4216 KB Output is correct
12 Correct 50 ms 4728 KB Output is correct
13 Correct 51 ms 4728 KB Output is correct
14 Correct 50 ms 4600 KB Output is correct
15 Incorrect 120 ms 7796 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 4 ms 2816 KB Output is correct
6 Correct 7 ms 2944 KB Output is correct
7 Correct 13 ms 3200 KB Output is correct
8 Correct 26 ms 3752 KB Output is correct
9 Correct 50 ms 4600 KB Output is correct
10 Correct 5 ms 2816 KB Output is correct
11 Correct 34 ms 4216 KB Output is correct
12 Correct 50 ms 4728 KB Output is correct
13 Correct 51 ms 4728 KB Output is correct
14 Correct 50 ms 4600 KB Output is correct
15 Incorrect 120 ms 7796 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 4 ms 2816 KB Output is correct
6 Correct 7 ms 2944 KB Output is correct
7 Correct 13 ms 3200 KB Output is correct
8 Correct 26 ms 3752 KB Output is correct
9 Correct 50 ms 4600 KB Output is correct
10 Correct 5 ms 2816 KB Output is correct
11 Correct 34 ms 4216 KB Output is correct
12 Correct 50 ms 4728 KB Output is correct
13 Correct 51 ms 4728 KB Output is correct
14 Correct 50 ms 4600 KB Output is correct
15 Incorrect 120 ms 7796 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 4 ms 2816 KB Output is correct
6 Correct 7 ms 2944 KB Output is correct
7 Correct 13 ms 3200 KB Output is correct
8 Correct 26 ms 3752 KB Output is correct
9 Correct 50 ms 4600 KB Output is correct
10 Correct 5 ms 2816 KB Output is correct
11 Correct 34 ms 4216 KB Output is correct
12 Correct 50 ms 4728 KB Output is correct
13 Correct 51 ms 4728 KB Output is correct
14 Correct 50 ms 4600 KB Output is correct
15 Incorrect 120 ms 7796 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 4 ms 2816 KB Output is correct
6 Correct 7 ms 2944 KB Output is correct
7 Correct 13 ms 3200 KB Output is correct
8 Correct 26 ms 3752 KB Output is correct
9 Correct 50 ms 4600 KB Output is correct
10 Correct 5 ms 2816 KB Output is correct
11 Correct 34 ms 4216 KB Output is correct
12 Correct 50 ms 4728 KB Output is correct
13 Correct 51 ms 4728 KB Output is correct
14 Correct 50 ms 4600 KB Output is correct
15 Incorrect 120 ms 7796 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -