제출 #173753

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
173753		Ruxandra985	ICC (CEOI16_icc)	C++14	7 / 100	475 ms	676 KiB

icc

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


int f[110] , w[110] , a[110] , b[110] , fq[110];
int idk[110];

void run (int n){
    int i , cc , st , dr , mid , aux , p , q , l , r , elem;
    for (i=1;i<=n;i++)
        f[i] = i;

    for (int mc = 1 ; mc < n ; mc++){


        /// vreau sa ma duc in jos cat pot pana gasesc intervalul care contine capetele

        while (true){

            /// o sa fac solutia aia mai proasta cu generat random pt ca nuj cum altcumva

            memset (fq , 0 , sizeof(fq));

            for (i=1;i<=( n - mc + 1) / 2 ;i++){
                idk[i] = idk[i-1] + (rand() % (n - mc + 1 - ( ( n - mc + 1) / 2 ) + i - idk[i-1])) + 1;
                fq[idk[i]] = 1;
                //printf ("%d ",idk[i]);
            }
            //printf ("\n");
            /// idk ar trebui sa fie (n - mc + 1) / 2 numere in ordine crescatoare
            p = q = 0;
            for (i=1;i<=n;i++){
                if (fq[f[i]] == 1)
                    a[p++] = i;
            }
            for (i=1;i<=n;i++){
                if (fq[f[i]] == 0)
                    b[q++] = i;
            }


            if (query( p , q , a , b ) == 1){
                /// un capat de muchie e intr o jumatate , celalalt capat in cealalta
                break;
            }
            else {
                /// ambele capete sunt in aceeasi jum

                continue;

            }

        }

        /// ai vectorii a si b
        /// a are p elem si b are q
        /// a si b sunt indexate de la 0

        /// pt a

        while (p > 1){

            if (query (p / 2 , q , a , b) == 1)
                p/=2;
            else {
                for (i = p/2 ; i < p ; i++)
                    a[i - p/2] = a[i];
                p = p - p / 2;
            }

        }

        /// pt b

        while (q > 1){

            if (query (p , q / 2 , a , b) == 1)
                q/=2;
            else {
                for (i = q/2 ; i < q ; i++)
                    b[i - q/2] = b[i];
                q = q - q / 2;
            }

        }

        setRoad(a[0] , b[0]);

        /// acum trebuie sa modificam f ul
        int u1 = min( f[a[0]] , f[b[0]] );
        int u2 = max( f[a[0]] , f[b[0]] );

        for (i=1;i<=n;i++){
            if (f[i] == u2)
                f[i] = u1;
            else if (f[i] == n - mc + 1 && u2 != n - mc + 1)
                f[i] = u2;
        }


    }


}

컴파일 시 표준 에러 (stderr) 메시지

icc.cpp: In function 'void run(int)':
icc.cpp:10:13: warning: unused variable 'cc' [-Wunused-variable]
     int i , cc , st , dr , mid , aux , p , q , l , r , elem;
             ^~
icc.cpp:10:18: warning: unused variable 'st' [-Wunused-variable]
     int i , cc , st , dr , mid , aux , p , q , l , r , elem;
                  ^~
icc.cpp:10:23: warning: unused variable 'dr' [-Wunused-variable]
     int i , cc , st , dr , mid , aux , p , q , l , r , elem;
                       ^~
icc.cpp:10:28: warning: unused variable 'mid' [-Wunused-variable]
     int i , cc , st , dr , mid , aux , p , q , l , r , elem;
                            ^~~
icc.cpp:10:34: warning: unused variable 'aux' [-Wunused-variable]
     int i , cc , st , dr , mid , aux , p , q , l , r , elem;
                                  ^~~
icc.cpp:10:48: warning: unused variable 'l' [-Wunused-variable]
     int i , cc , st , dr , mid , aux , p , q , l , r , elem;
                                                ^
icc.cpp:10:52: warning: unused variable 'r' [-Wunused-variable]
     int i , cc , st , dr , mid , aux , p , q , l , r , elem;
                                                    ^
icc.cpp:10:56: warning: unused variable 'elem' [-Wunused-variable]
     int i , cc , st , dr , mid , aux , p , q , l , r , elem;
                                                        ^~~~

• Subtask 1: 7 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 21
• Subtask 5: 0 / 29
• Subtask 6: 0 / 10