oj.uz

Submission #907128

# Submission time Handle Problem Language Result Execution time Memory
907128 2024-01-15T07:23:55 Z ibm2006 Minerals (JOI19_minerals) C++17
25 / 100
 11 ms 1368 KB 
#include "minerals.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
ll n,i,j,k,l,r,x,y,z,w,s,t,perm[1100000];
vector<ll> v,u;
void dnc(vector<ll> v,vector<ll> u)
{
    //printf("(%lld %lld)\n",v.size(),u.size());
    ll i,m=v.size();
    ll mid=m/2,x,s=0;
    if(m==1)
    {
        perm[v[0]]=u[0];
        return;
    }
    for(i=0;i<mid;i++)
    {
        //printf("! %lld\n",v[i]);
        x=Query(v[i]);
        s++;
    }
    vector<ll> v1,v2,u1,u2;
    for(i=0;i<mid;i++)
    {
        v1.push_back(v[i]);
    }
    for(i=mid;i<m;i++)
    {
        v2.push_back(v[i]);
    }
    for(i=0;i<m;i++)
    {
       // printf("! %lld\n",u[i]);
        y=Query(u[i]);
        s++;
        y=s-y;
      //  printf("(%lld)\n",y);
        if(y>0)
            u1.push_back(u[i]);
        else
            u2.push_back(u[i]);
          //  printf("! %lld\n",u[i]);
        Query(u[i]);
        s--;
    }
    for(i=0;i<mid;i++)
    {
        //printf("! %lld\n",v[i]);
        Query(v[i]);
        s--;
    }
    dnc(v1,u1);
    dnc(v2,u2);
}
void Solve(ll N) {
   n=N;
   for(i=1;i<=n;i++)
    v.push_back(i);
   for(i=1;i<=n;i++)
   {
       u.push_back(i+n);
   }
   dnc(v,u);
   for(i=1;i<=n*2;i++)
   {
       if(perm[i]==0)
        continue;
       Answer(i,perm[i]);
   }
}

Compilation message

minerals.cpp: In function 'void dnc(std::vector<int>, std::vector<int>)':
minerals.cpp:11:16: warning: variable 'x' set but not used [-Wunused-but-set-variable]
   11 |     ll mid=m/2,x,s=0;
      |                ^

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 4 ms 600 KB Output is correct
4 Correct 6 ms 856 KB Output is correct
5 Correct 11 ms 1368 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -