Submission #2643484

Source Code Expand

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

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))



inline int sub(vi& d){
    if (d[0]%2 || d[1]%2 || d[2]%2) return 0;
    if (d[0] == d[1] && d[1] == d[2]) return -1;
    vector<int> e = d;
    d[0] = (e[1] + e[2])/2;
    d[1] = (e[2] + e[0])/2;
    d[2] = (e[0] + e[1])/2;
    return 1;
}

ll solve(int a,int b,int c){
    vector<int> d {a,b,c};
    int cnt = 0;
    while (true) {
        // cerr << d << cnt << endl;
        switch (sub(d)) {
            case -1: return -1;
            case 1: ++cnt; break;
            case 0: return cnt;
        }
    }
}

int main() {
    int a,b,c; cin>>a>>b>>c;
    cout<<solve(a,b,c)<<endl;
    return 0;
}

Submission Info

Submission Time
Task A - Cookie Exchanges
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1709 Byte
Status
Exec Time 1 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample1.txt, sample2.txt, sample3.txt
All 300 / 300 sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
in1.txt 1 ms 256 KB
in10.txt 1 ms 256 KB
in11.txt 1 ms 256 KB
in2.txt 1 ms 256 KB
in3.txt 1 ms 256 KB
in4.txt 1 ms 256 KB
in5.txt 1 ms 256 KB
in6.txt 1 ms 256 KB
in7.txt 1 ms 256 KB
in8.txt 1 ms 256 KB
in9.txt 1 ms 256 KB
sample1.txt 1 ms 256 KB
sample2.txt 1 ms 256 KB
sample3.txt 1 ms 256 KB