oj.uz

Submission #691031

# Submission time Handle Problem Language Result Execution time Memory
691031 2023-01-30T21:55:00 Z NemanjaSo2005 Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 468 KB 
#include <bits/stdc++.h>
#include "messy.h"
#define ll long long
using namespace std;
int N,niz[130],stepen[10],gde[130];
bool locked[130];
string ps;
vector<int> ret,poz,broj[130],tren;
void add(){
   stepen[0]=1;
   for(int i=1;i<=7;i++)
      stepen[i]=stepen[i-1]*2;
   ps="";
   for(int i=1;i<=N;i++)
      ps.push_back('1');
   for(int i=1;i<=7;i++){
      ps[i-1]='0';
      add_element(ps);
   }
   for(int i=0;i<N;i++)
      niz[i]=i;
   for(int it=0;stepen[it]<N;it++){
      for(int i=0;i<ps.size();i++)
         ps[i]='0';
      for(int i=0;i<it;i++)
         ps[i]='1';
      for(int i=it;i<N;i++)
         if(i&stepen[it]){
            ps[i]='1';
            add_element(ps);
            ps[i]='0';
         }
   }
   return;
}
bool pitaj(){
   string a=ps;
   return check_element(a);
}
void read(){
   ret.resize(N);
   for(int it=0;stepen[it]<N;it++){
      ///Trazi gde je it-1
      if(it!=0){
         int traz=0;
         for(int j=0;j<it;j++)
            if((it-1)&stepen[j])
               traz+=stepen[j];
         for(int i=0;i<N;i++)
            ps[i]='1';
         for(int i=0;i<poz.size();i++)
            ps[poz[i]]='0';
         for(int i=0;i<N;i++){
            if(locked[i])
               continue;
            if(gde[i]!=traz)
               continue;
            ps[i]='0';
            if(check_element(ps)){
               locked[i]=true;
               gde[i]=it-1;
               poz.push_back(i);
               //cout<<it-1<<" je na poziciji "<<i<<endl;
               break;
            }
            else
               ps[i]='1';
         }
      }
      for(int i=0;i<N;i++)
         ps[i]='0';
      for(int i=0;i<poz.size();i++)
         ps[poz[i]]='1';

      for(int i=0;i<stepen[it];i++)
         broj[i].clear();
      for(int i=0;i<N;i++){
         int br=gde[i]&(stepen[it]-1);
         //cout<<i<<" "<<br<<" "<<stepen[it]<<endl;
         broj[br].push_back(i);
      }
      for(int tb=0;tb<stepen[it];tb++){
         tren=broj[tb];
       //  cout<<"TREN SIZE: "<<tren.size()<<endl;
         for(int i=0;i<tren.size();i++)
            if(!locked[tren[i]]){
               swap(tren[i],tren[tren.size()-1]);
               break;
            }
         int pi,uk=0;
         for(int i=0;i<tren.size()-1;i++){
            if(uk==tren.size()/2)
               break;
            pi=i;
            int koji=tren[i];
            if(locked[koji]){
             //  cout<<"LOKOVAN "<<koji<<endl;
               if(gde[koji]&stepen[it])
                  uk++;
               continue;
            }
            ps[koji]='1';
            if(pitaj()){
           //    cout<<"IMA"<<endl;
               gde[koji]+=stepen[it];
               uk++;
            }
            ps[koji]='0';
         }
         //cout<<uk<<endl;
         if(uk!=tren.size()/2){
          //  cout<<"OVDE "<<pi<<endl;
           // cout<<tren[1]<<" "<<locked[tren[1]]<<endl;
            for(int i=pi+1;i<tren.size();i++)
               if(!locked[tren[i]])
                  gde[tren[i]]+=stepen[it];
         }
      }
     /* cout<<stepen[it]<<" ZAVRSEN: ";
      for(int i=0;i<N;i++)
         cout<<gde[i]<<" ";
      cout<<endl;*/
   }
   for(int i=0;i<N;i++)
      ret[i]=gde[i];
}
vector<int> restore_permutation(int n, int w, int r) {
   N=n;
   add();
   compile_set();
   read();
   return ret;
}

Compilation message

messy.cpp: In function 'void add()':
messy.cpp:23:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |       for(int i=0;i<ps.size();i++)
      |                   ~^~~~~~~~~~
messy.cpp: In function 'void read()':
messy.cpp:51:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |          for(int i=0;i<poz.size();i++)
      |                      ~^~~~~~~~~~~
messy.cpp:72:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |       for(int i=0;i<poz.size();i++)
      |                   ~^~~~~~~~~~~
messy.cpp:85:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |          for(int i=0;i<tren.size();i++)
      |                      ~^~~~~~~~~~~~
messy.cpp:91:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |          for(int i=0;i<tren.size()-1;i++){
      |                      ~^~~~~~~~~~~~~~
messy.cpp:92:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |             if(uk==tren.size()/2)
      |                ~~^~~~~~~~~~~~~~~
messy.cpp:111:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |          if(uk!=tren.size()/2){
      |             ~~^~~~~~~~~~~~~~~
messy.cpp:114:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |             for(int i=pi+1;i<tren.size();i++)
      |                            ~^~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 304 KB n = 32
7 Correct 1 ms 300 KB n = 32
8 Correct 1 ms 300 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Correct 0 ms 212 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 340 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 304 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 304 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 304 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 1 ms 212 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Correct 1 ms 308 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 0 ms 212 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 212 KB n = 32

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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