Submission #1833846


Source Code Expand

#include <bits/stdc++.h>
#define long long long
#define up(i,a,b) for (int i=a; i<=b; i++)
#define down(i,a,b) for (int i=a; i>=b; i--)
#define endl '\n'
#define X first
#define Y second
#define II pair<int, int>
#define III pair<int, pair<int, int> >
#define debug(X) cerr<< #X << " = " <<X << endl
#define debug2(X,Y) cerr<< #X << " = " <<X << ","<<#Y<<" = "<<Y<<endl
#define show(X,a,b) {cerr << #X << " = "; up(__,a,b) cerr << X[__] << ' '; cerr << endl;}
#define gc getchar
#define pc putchar
using namespace std;

inline void read(int &x)
{
    register int c = gc();
    x = 0;
    int neg = 0;
    for (;((c<48 || c>57) && c != '-') ;c = gc());
    if(c=='-') {neg=1;c=gc();}
    for(;c>47 && c<58;c = gc()) {x = (x<<1) + (x<<3) + c - 48;}
    if(neg) x=-x;
}
inline void writeln(int x){

         char buffor[21];
         register int i=0;
         int neg=0; if (x<0) {neg=1; x= -x;}
         do{
               buffor[i++]=(x%10)+'0';
               x/=10;
            } while(x);
           i--;
           if (neg) pc('-');
           while(i>=0) pc(buffor[i--]);
           pc('\n');
       }
int Ai,Ao,At,Aj,Al,As,Az;
long res= 0;

void solve()
{
	res= 0;
	res+= Ao;
	if (Aj%2==0 and Al%2== 0) res+= Aj+ Al+ Ai- ((Ai%2==0)?0:1);
	else if (Aj%2==1 and Al%2== 1)
	{
		res+= (Aj-1)+ (Al-1);
        if (Ai%2== 1) res+= 3+ (Ai-1);
        else
		{
			if (Ai!=0) res+= 3+ (Ai-2);
		}
	}
	else
	{
        if (Al%2==1) swap(Aj,Al);
        if (Ai%2== 0) res+= Ai+ Aj-1+ Al;
        else
		{
            if (Al!= 0) res+= Ai-1+ Aj-1+ Al-2+ 3;
            else res+= Ai-1+ Aj-1;
		}
	}
	cout<<res<<endl;
}

int cnt(int a)
{
	if (a%2==1) return a-1;
	else return a;
}
void solve2()
{
    long res1=0,res2=0;
    res1= cnt(Ai)+ cnt(Al)+ cnt(Aj);
	if (Ai>0 and Al>0 and Aj>0) res2= cnt(Ai-1)+ cnt(Al-1)+ cnt(Aj-1)+ 3;
	cout<<max(res1, res2)+ Ao<<endl;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);// don't use when interactive

    #ifdef I_Love_Pork
    #define TASK "tmp"
    freopen(TASK".inp","r",stdin);
    freopen(TASK".out","w",stdout);
	  #endif
	while (cin>>Ai>>Ao>>At>>Aj>>Al>>As>>Az)
	{
    //solve();
	solve2();
	}
    return 0;
}

Submission Info

Submission Time
Task C - Tetromino Tiling
User I_Love_Pork
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2273 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
AC × 2
AC × 44
WA × 2
Set Name Test Cases
Sample 0_00.txt, 0_01.txt
All 0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt AC 1 ms 256 KB
1_07.txt AC 1 ms 256 KB
1_08.txt AC 1 ms 256 KB
1_09.txt AC 1 ms 256 KB
1_10.txt AC 1 ms 256 KB
1_11.txt WA 1 ms 256 KB
1_12.txt AC 1 ms 256 KB
1_13.txt AC 1 ms 256 KB
1_14.txt AC 1 ms 256 KB
1_15.txt AC 1 ms 256 KB
1_16.txt AC 1 ms 256 KB
1_17.txt AC 1 ms 256 KB
1_18.txt AC 1 ms 256 KB
1_19.txt AC 1 ms 256 KB
1_20.txt AC 1 ms 256 KB
1_21.txt AC 1 ms 256 KB
1_22.txt WA 1 ms 256 KB
1_23.txt AC 1 ms 256 KB
1_24.txt AC 1 ms 256 KB
1_25.txt AC 1 ms 256 KB
1_26.txt AC 1 ms 256 KB
1_27.txt AC 1 ms 256 KB
1_28.txt AC 1 ms 256 KB
1_29.txt AC 1 ms 256 KB
1_30.txt AC 1 ms 256 KB
1_31.txt AC 1 ms 256 KB
1_32.txt AC 1 ms 256 KB
1_33.txt AC 1 ms 256 KB
1_34.txt AC 1 ms 256 KB
1_35.txt AC 1 ms 256 KB
1_36.txt AC 1 ms 256 KB
1_37.txt AC 1 ms 256 KB
1_38.txt AC 1 ms 256 KB
1_39.txt AC 1 ms 256 KB
1_40.txt AC 1 ms 256 KB
1_41.txt AC 1 ms 256 KB
1_42.txt AC 1 ms 256 KB
1_43.txt AC 1 ms 256 KB