oj.uz

답안 #771923

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
771923 2023-07-03T12:12:05 Z Valters07 Minerals (JOI19_minerals) C++14
40 / 100
 18 ms 2500 KB 
#include <bits/stdc++.h>
#include "minerals.h"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#define fio ios_base::sync_with_stdio(0);cin.tie(0);
#define ll long long
#define en cin.close();return 0;
#define pb push_back
#define fi first//printf("%lli\n",cur);
#define se second//scanf("%lli",&n);
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n1;
void go(vector<int> &a, vector<int> &b)
{
    assert(a.size()==b.size());
    int n = a.size();
    if(n==1)
        Answer(a[0],b[0]),
        Query(a[0]);
    else
    {
        int mid = n/2;
        vector<int> la, ra, lb, rb;
        for(int i = 0;i<n;i++)
            if(i<mid)
                la.pb(a[i]);
            else
                ra.pb(a[i]),
                Query(a[i]);
        for(int i = 0;i<n;i++)
        {
            int t = Query(b[i]);
            if(t==n1)
                lb.pb(b[i]);
            else
                rb.pb(b[i]);
            Query(b[i]);
        }
        for(auto x:ra)
            Query(x);
        go(la,lb);
        go(ra,rb);
    }
}
void Solve(int n)
{
    n1=n;
    vector<int> a, b;
    for(int i = 1, lst = 0;i<=2*n;i++)
    {
        int t = Query(i);
        if(t==lst)
            b.pb(i);
        else
            a.pb(i);
        lst=t;
    }
    go(a,b);
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 3 ms 464 KB Output is correct
4 Correct 5 ms 624 KB Output is correct
5 Correct 10 ms 1060 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 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 1 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 5 ms 624 KB Output is correct
9 Correct 10 ms 1060 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 848 KB Output is correct
12 Correct 9 ms 1104 KB Output is correct
13 Correct 8 ms 1124 KB Output is correct
14 Correct 9 ms 1064 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 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 1 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 5 ms 624 KB Output is correct
9 Correct 10 ms 1060 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 848 KB Output is correct
12 Correct 9 ms 1104 KB Output is correct
13 Correct 8 ms 1124 KB Output is correct
14 Correct 9 ms 1064 KB Output is correct
15 Incorrect 18 ms 2500 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 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 1 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 5 ms 624 KB Output is correct
9 Correct 10 ms 1060 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 848 KB Output is correct
12 Correct 9 ms 1104 KB Output is correct
13 Correct 8 ms 1124 KB Output is correct
14 Correct 9 ms 1064 KB Output is correct
15 Incorrect 18 ms 2500 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 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 1 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 5 ms 624 KB Output is correct
9 Correct 10 ms 1060 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 848 KB Output is correct
12 Correct 9 ms 1104 KB Output is correct
13 Correct 8 ms 1124 KB Output is correct
14 Correct 9 ms 1064 KB Output is correct
15 Incorrect 18 ms 2500 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 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 1 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 5 ms 624 KB Output is correct
9 Correct 10 ms 1060 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 848 KB Output is correct
12 Correct 9 ms 1104 KB Output is correct
13 Correct 8 ms 1124 KB Output is correct
14 Correct 9 ms 1064 KB Output is correct
15 Incorrect 18 ms 2500 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 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 1 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 5 ms 624 KB Output is correct
9 Correct 10 ms 1060 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 848 KB Output is correct
12 Correct 9 ms 1104 KB Output is correct
13 Correct 8 ms 1124 KB Output is correct
14 Correct 9 ms 1064 KB Output is correct
15 Incorrect 18 ms 2500 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 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 1 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 5 ms 624 KB Output is correct
9 Correct 10 ms 1060 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 848 KB Output is correct
12 Correct 9 ms 1104 KB Output is correct
13 Correct 8 ms 1124 KB Output is correct
14 Correct 9 ms 1064 KB Output is correct
15 Incorrect 18 ms 2500 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -