답안 #771977

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
771977 2023-07-03T13:05:07 Z Valters07 Minerals (JOI19_minerals) C++14
40 / 100
21 ms 2520 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, cur;
int q(int x)
{
    return cur=Query(x);
}
void go(vector<int> &a, vector<int> &b, bool is)
{
    assert(a.size()==b.size());
    int n = a.size(), mid = n/2;
    if(n==1)
        Answer(a[0],b[0]);
    else if(is)
    {
        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]),
                q(a[i]);
        for(int i = 0, lst=cur;i<n;i++)
        {
            int t = q(b[i]);
            if(t==lst)
                lb.pb(b[i]);
            else
                rb.pb(b[i]);
            lst=t;
        }
        for(auto x:la)
            q(x);
        go(la,lb,0);
        go(ra,rb,0);
    }
    else
    {
        vector<int> la, ra, lb, rb;
        for(int i = 0;i<n;i++)
            if(i<mid)
                la.pb(a[i]),
                q(a[i]);
            else
                ra.pb(a[i]);
        for(int i = 0, lst=cur;i<n;i++)
        {
            int t = q(b[i]);
            if(t==lst)
                lb.pb(b[i]);
            else
                rb.pb(b[i]);
            lst=t;
        }
        for(auto x:ra)
            q(x);
        go(la,lb,1);
        go(ra,rb,1);
    }
}
void Solve(int n)
{
    n1=cur=n;
    vector<int> a, b;
    for(int i = 1, lst = 0;i<=2*n;i++)
    {
        int t = q(i);
        if(t==lst)
            b.pb(i);
        else
            a.pb(i);
        lst=t;
    }
    go(a,b,1);
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 208 KB Output is correct
# 결과 실행 시간 메모리 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 632 KB Output is correct
5 Correct 9 ms 1056 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 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 632 KB Output is correct
9 Correct 9 ms 1056 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 976 KB Output is correct
12 Correct 9 ms 1064 KB Output is correct
13 Correct 8 ms 1104 KB Output is correct
14 Correct 7 ms 1104 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 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 632 KB Output is correct
9 Correct 9 ms 1056 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 976 KB Output is correct
12 Correct 9 ms 1064 KB Output is correct
13 Correct 8 ms 1104 KB Output is correct
14 Correct 7 ms 1104 KB Output is correct
15 Incorrect 21 ms 2520 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 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 632 KB Output is correct
9 Correct 9 ms 1056 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 976 KB Output is correct
12 Correct 9 ms 1064 KB Output is correct
13 Correct 8 ms 1104 KB Output is correct
14 Correct 7 ms 1104 KB Output is correct
15 Incorrect 21 ms 2520 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 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 632 KB Output is correct
9 Correct 9 ms 1056 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 976 KB Output is correct
12 Correct 9 ms 1064 KB Output is correct
13 Correct 8 ms 1104 KB Output is correct
14 Correct 7 ms 1104 KB Output is correct
15 Incorrect 21 ms 2520 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 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 632 KB Output is correct
9 Correct 9 ms 1056 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 976 KB Output is correct
12 Correct 9 ms 1064 KB Output is correct
13 Correct 8 ms 1104 KB Output is correct
14 Correct 7 ms 1104 KB Output is correct
15 Incorrect 21 ms 2520 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 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 632 KB Output is correct
9 Correct 9 ms 1056 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 976 KB Output is correct
12 Correct 9 ms 1064 KB Output is correct
13 Correct 8 ms 1104 KB Output is correct
14 Correct 7 ms 1104 KB Output is correct
15 Incorrect 21 ms 2520 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 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 632 KB Output is correct
9 Correct 9 ms 1056 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 976 KB Output is correct
12 Correct 9 ms 1064 KB Output is correct
13 Correct 8 ms 1104 KB Output is correct
14 Correct 7 ms 1104 KB Output is correct
15 Incorrect 21 ms 2520 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -