Submission #257474

#	Time	Username	Problem	Language	Result	Execution time	Memory
257474		sonvip9	Trobojnica (COCI19_trobojnica)	C++14	60 / 110	25 ms	9232 KiB

trobojnica

#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ii pair <int,int>
#define pl pair <ll,ll>
#define fr(i,x,y) for (int i=x;i<=y;i++)
#define ft(i,x,y) for (int i=y;i>=x;i--)
#define N 100005
using namespace std ;
int res,n,color[1002][1002],first_color[1002][1002],dem_mau[N][3];
string s;
void inp()
{
   // freopen("task2.inp","r",stdin) ;
   // freopen("task2.out","w",stdout);
    cin>>n>>s;
}
bool hs(int u,int v)
{
    if (u>v) swap(u,v);
    if (u==1 and v==n) return true ;
    return false;
}
int tong_mau(int st,int ed,int j){
    if (ed!=n and st!=1)
    return dem_mau[n][j] - (dem_mau[n][j]-dem_mau[ed-1][j])-(dem_mau[st-1][j]);
    else return dem_mau[n][j] - (dem_mau[n][j]-dem_mau[ed][j])-(dem_mau[st-1][j]);
}
bool checking_chanle(int a,int b,int c){
   // cout<<a<<" "<<b<<" "<<c<<endl;
    a = max(a,0);
    b = max(b,0);
    c = max(c,0);
    int tong = a+b+c ;
    int r = tong%2;
    if((a==0 and b==0) or (a==0 and c==0) or (b==0 and c==0)) return false ;
    if (a%2!=r or b%2!=r or c%2!=r) return false ;
    return true ;
}
bool ad = true ;
void duyet(int st,int ed)
{
    if (st>ed) swap(st,ed);
    if (ed-st==2)
    {
        //cout<<res<<endl;
        if (res==n-3)
        {
            cout<<"DA"<<"\n";
            fr(i,1,n)
            {
                fr(j,i+2,n)
                {
                    if (color[i][j]!=0)
                    {
                        if (hs(i,j)) continue ;
                        cout<<i<<" "<<j<<" "<<color[i][j]<<"\n";
                    }
                }
            }
            exit(0);
        }
        return ;
    }
    fr(i,st+1,ed-1)
    {
        fr(now_color,1,3)
        {
            if (now_color!=color[st][ed])
            {
                int dem_ed_phai[4],dem_ed_trai[4],dem_st_phai[4],dem_st_trai[4];
                fr(j,1,3){
                   dem_ed_trai[j] = dem_mau[ed-1][j]-dem_mau[i-1][j];
                   dem_ed_phai[j] = dem_mau[n][j] - dem_ed_trai[j] ;
                   dem_st_trai[j] = dem_mau[i-1][j]-dem_mau[st-1][j] ;
                   dem_st_phai[j] = dem_mau[n][j] - dem_st_trai[j];
                }
                //cout<<st<<" "<<ed<<" "<<tong_mau(st,ed,1)<<" "<<tong_mau(st,ed,2)<<" "<<tong_mau(st,ed,3)<<endl;
                bool ok1 = true , ok2 = true  ;
                if (color[st][i]==0) {
                        color[st][i] = color[i][st] = 6 - now_color - color[st][ed];
                        dem_st_phai[color[st][i]]++;
                        dem_st_trai[color[st][i]]++;
                        ok1 = false ;
                        res++;
                }
                if (color[ed][i]==0){
                    color[ed][i] = color[i][ed] = now_color ;
                    dem_ed_phai[color[ed][i]]++;
                    dem_ed_trai[color[ed][i]]++;
                    ok2 = false ;
                    res++;
                }
                if (checking_chanle(dem_ed_phai[1],dem_ed_phai[2],dem_ed_phai[3]))
                    if (checking_chanle(dem_ed_trai[1],dem_ed_trai[2],dem_ed_trai[3]))
                        ok2 = true ;
                if (checking_chanle(dem_st_phai[1],dem_st_phai[2],dem_st_phai[3]))
                     if (checking_chanle(dem_st_trai[1],dem_st_trai[2],dem_st_trai[3]))
                       ok1 = true ;
                if (ok1 and ok2)
                {

                     duyet(st,i);
                     duyet(ed,i);
                     return ;
                }
                color[i][st] = color[st][i] = first_color[st][i];
                if (first_color[st][i]==0) res--;
                color[i][ed] = color[ed][i] = first_color[ed][i];
                if (first_color[ed][i]==0) res--;
            }
        }
    }
}
void sub1()
{
    fr(i,0,n-1)
    {
        if (i!=n-1)
        {
            color[i+1][i+2] = color[i+2][i+1] = s[i]-'0';
        }
        else color[1][n] = color[n][1] = s[i]-'0';
    }
    s=" "+s;
    fr(i,1,n){
       fr(j,1,3) dem_mau[i][j] = dem_mau[i-1][j];
       dem_mau[i][s[i]-'0']++;
    }
    if (!checking_chanle(dem_mau[n][1],dem_mau[n][2],dem_mau[n][3])){
        cout<<"NE";
        exit(0);
    }
    fr(i,1,n)
      fr(j,1,n)
         first_color[i][j] = color[i][j];
    duyet(n,1);
    cout<<"NE";
}
int main()
{
    inp();
    sub1();
}

Compilation message (stderr)

trobojnica.cpp: In function 'void duyet(int, int)':
trobojnica.cpp:75:52: warning: iteration 2 invokes undefined behavior [-Waggressive-loop-optimizations]
                    dem_ed_trai[j] = dem_mau[ed-1][j]-dem_mau[i-1][j];
                                     ~~~~~~~~~~~~~~~^
trobojnica.cpp:8:33: note: within this loop
 #define fr(i,x,y) for (int i=x;i<=y;i++)
trobojnica.cpp:74:20:
                 fr(j,1,3){
                    ~~~~~         
trobojnica.cpp:74:17: note: in expansion of macro 'fr'
                 fr(j,1,3){
                 ^~
trobojnica.cpp: In function 'void sub1()':
trobojnica.cpp:129:48: warning: iteration 2 invokes undefined behavior [-Waggressive-loop-optimizations]
        fr(j,1,3) dem_mau[i][j] = dem_mau[i-1][j];
                                  ~~~~~~~~~~~~~~^
trobojnica.cpp:8:33: note: within this loop
 #define fr(i,x,y) for (int i=x;i<=y;i++)
trobojnica.cpp:129:11:
        fr(j,1,3) dem_mau[i][j] = dem_mau[i-1][j];
           ~~~~~                  
trobojnica.cpp:129:8: note: in expansion of macro 'fr'
        fr(j,1,3) dem_mau[i][j] = dem_mau[i-1][j];
        ^~
trobojnica.cpp:129:48: warning: array subscript is above array bounds [-Warray-bounds]
        fr(j,1,3) dem_mau[i][j] = dem_mau[i-1][j];
                                  ~~~~~~~~~~~~~~^
trobojnica.cpp:129:30: warning: array subscript is above array bounds [-Warray-bounds]
        fr(j,1,3) dem_mau[i][j] = dem_mau[i-1][j];
                  ~~~~~~~~~~~~^
trobojnica.cpp:132:25: warning: array subscript is above array bounds [-Warray-bounds]
     if (!checking_chanle(dem_mau[n][1],dem_mau[n][2],dem_mau[n][3])){
          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 20 / 20
• Subtask 2: 40 / 40
• Subtask 3: 0 / 50