oj.uz

Submission #553341

# Submission time Handle Problem Language Result Execution time Memory
553341 2022-04-25T14:02:48 Z fcmalkcin Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 4 ms 480 KB 
#include "messy.h"

#include<bits/stdc++.h>
using namespace std;

#define ll int
#define pll pair<ll,ll>
#define ff first
#define ss second
//#define endl "\n"
#define pb push_back
#define F(i,a,b) for(ll i=a;i<=b;i++)

const ll maxn=3e5+100;
const ll base=3e18;
const ll mod= 1e9+7 ;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

ll n;
void dosth(ll l,ll r)
{
    if (l==r) return ;
    ll mid=(l+r)/2;
    for (int t=l;t<=mid;t++)
    {
        string p;
        for (int i=1;i<l;i++) p.pb('1');
        for (int i=l;i<=r;i++)
        {
            if (t==i) p.pb('1');
            else p.pb('0');
        }
        for (int i=r+1;i<=n;i++) p.pb('1');
        add_element(p);
    }
    dosth(l,mid);
    dosth(mid+1,r);
}
ll res[maxn];
void dosth1(ll l,ll r,vector<ll> vt)
{
   if (l==r)
   {
       res[vt[0]]=l;
       return ;
   }
   vector<bool> dd(n+3,0);
   for (auto to:vt)
   {
       dd[to]=1;
   }
   vector<ll> vt1;
   vector<ll> vt2;
   for (int i=0;i<vt.size();i++)
   {
       ll x=vt[i];
       string p;
       for (int i=1;i<=n;i++)
       {
           if (dd[i])
           {
               if (i==x)
               {
                   p.pb('1');
               }
               else
               {
                   p.pb('0');
               }
           }
           else
           {
               p.pb('1');
           }
       }
       if (check_element(p))
       {
           vt1.pb(x);
       }
       else
       {
           vt2.pb(x);
       }
   }
   ll mid=(l+r)/2;
   dosth1(l,mid,vt1);
   dosth1(mid+1,r,vt2);
}
vector<ll> restore_permutation(int n1, int w, int r)
{
    n=n1;
    dosth(1,n);
    compile_set();
    vector<ll> vt;
    for (int i=1;i<=n;i++) vt.pb(i);
    dosth1(1,n,vt);
    vector<ll> ans;
    for (int i=1;i<=n;i++) ans.pb(res[i]-1);
    return ans;
}
/*int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    if (fopen("t.inp","r"))
    {
        freopen("test.inp","r",stdin);
        freopen("test.out","w",stdout);
    }
}*/

Compilation message

messy.cpp:15:15: warning: overflow in conversion from 'double' to 'int' changes value from '3.0e+18' to '2147483647' [-Woverflow]
   15 | const ll base=3e18;
      |               ^~~~
messy.cpp: In function 'void dosth1(int, int, std::vector<int>)':
messy.cpp:55:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |    for (int i=0;i<vt.size();i++)
      |                 ~^~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 8
2 Correct 1 ms 316 KB n = 8
3 Correct 1 ms 212 KB n = 8
4 Correct 1 ms 212 KB n = 8
5 Correct 1 ms 212 KB n = 8
6 Correct 1 ms 308 KB n = 8
7 Correct 1 ms 316 KB n = 8
8 Correct 1 ms 212 KB n = 8
9 Correct 1 ms 212 KB n = 8
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 1 ms 312 KB n = 8
15 Correct 1 ms 320 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 340 KB n = 32
4 Correct 1 ms 340 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 316 KB n = 32
7 Correct 1 ms 340 KB n = 32
8 Correct 1 ms 340 KB n = 32
9 Correct 1 ms 340 KB n = 32
10 Correct 1 ms 212 KB n = 32
11 Correct 1 ms 316 KB n = 32
12 Correct 1 ms 340 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 340 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 1 ms 316 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 312 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 340 KB n = 32
8 Correct 1 ms 212 KB n = 32
9 Correct 1 ms 340 KB n = 32
10 Correct 1 ms 340 KB n = 32
11 Correct 1 ms 340 KB n = 32
12 Correct 1 ms 340 KB n = 32
13 Correct 1 ms 340 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 340 KB n = 32

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 468 KB n = 128
2 Correct 3 ms 468 KB n = 128
3 Correct 3 ms 468 KB n = 128
4 Correct 3 ms 468 KB n = 128
5 Correct 3 ms 468 KB n = 128
6 Correct 3 ms 468 KB n = 128
7 Correct 3 ms 444 KB n = 128
8 Correct 3 ms 444 KB n = 128
9 Correct 3 ms 444 KB n = 128
10 Correct 2 ms 468 KB n = 128
11 Correct 3 ms 468 KB n = 128
12 Correct 3 ms 468 KB n = 128
13 Correct 2 ms 468 KB n = 128
14 Correct 3 ms 468 KB n = 128
15 Correct 4 ms 468 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 468 KB n = 128
2 Correct 3 ms 468 KB n = 128
3 Correct 2 ms 468 KB n = 128
4 Correct 2 ms 468 KB n = 128
5 Correct 3 ms 468 KB n = 128
6 Correct 3 ms 468 KB n = 128
7 Correct 2 ms 468 KB n = 128
8 Correct 3 ms 468 KB n = 128
9 Correct 3 ms 468 KB n = 128
10 Correct 3 ms 468 KB n = 128
11 Correct 3 ms 468 KB n = 128
12 Correct 3 ms 468 KB n = 128
13 Correct 3 ms 480 KB n = 128
14 Correct 3 ms 468 KB n = 128
15 Correct 3 ms 444 KB n = 128