QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#279666#7852. Mini-Tetris 3023bachbeo2007AC ✓0ms3752kbC++231.3kb2023-12-08 22:59:502023-12-08 22:59:51

Judging History

你现在查看的是最新测评结果

  • [2023-12-08 22:59:51]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3752kb
  • [2023-12-08 22:59:50]
  • 提交

answer

/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/

#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define pb push_back
#define ff first
#define ss second
#define isz(x) (int)x.size()
using namespace std;

const int mxN = 2e5 + 5;
const int mod = 1e9 + 7;
const i64 oo = 1e18;

int a, b, c;

void solve() {
    cin >> a >> c >> b;
    int res = a * 2;
    if (b >= 2) {
        res += c * 2 + 3;
        res += (b - 2) / 2 * 3;
    }
    cout << res << endl;
}

signed main() {

#ifndef CDuongg
    if(fopen(taskname".inp", "r"))
        assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
   auto end = chrono::high_resolution_clock::now();
   cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
   cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif

}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3608kb

input:

2 2 2

output:

11

result:

ok single line: '11'

Test #2:

score: 0
Accepted
time: 0ms
memory: 3668kb

input:

1 1 1

output:

2

result:

ok single line: '2'

Test #3:

score: 0
Accepted
time: 0ms
memory: 3668kb

input:

0 0 0

output:

0

result:

ok single line: '0'

Test #4:

score: 0
Accepted
time: 0ms
memory: 3724kb

input:

0 0 1

output:

0

result:

ok single line: '0'

Test #5:

score: 0
Accepted
time: 0ms
memory: 3668kb

input:

0 2 2

output:

7

result:

ok single line: '7'

Test #6:

score: 0
Accepted
time: 0ms
memory: 3752kb

input:

0 2 3

output:

7

result:

ok single line: '7'

Test #7:

score: 0
Accepted
time: 0ms
memory: 3688kb

input:

0 2 4

output:

10

result:

ok single line: '10'

Test #8:

score: 0
Accepted
time: 0ms
memory: 3736kb

input:

20 20 20

output:

110

result:

ok single line: '110'

Test #9:

score: 0
Accepted
time: 0ms
memory: 3672kb

input:

20 20 19

output:

107

result:

ok single line: '107'

Test #10:

score: 0
Accepted
time: 0ms
memory: 3668kb

input:

20 19 20

output:

108

result:

ok single line: '108'

Test #11:

score: 0
Accepted
time: 0ms
memory: 3600kb

input:

20 19 19

output:

105

result:

ok single line: '105'

Test #12:

score: 0
Accepted
time: 0ms
memory: 3692kb

input:

19 20 20

output:

108

result:

ok single line: '108'

Test #13:

score: 0
Accepted
time: 0ms
memory: 3724kb

input:

19 20 19

output:

105

result:

ok single line: '105'

Test #14:

score: 0
Accepted
time: 0ms
memory: 3740kb

input:

19 19 20

output:

106

result:

ok single line: '106'

Test #15:

score: 0
Accepted
time: 0ms
memory: 3732kb

input:

0 0 2

output:

3

result:

ok single line: '3'

Test #16:

score: 0
Accepted
time: 0ms
memory: 3732kb

input:

19 19 19

output:

103

result:

ok single line: '103'

Test #17:

score: 0
Accepted
time: 0ms
memory: 3688kb

input:

50 50 50

output:

275

result:

ok single line: '275'

Test #18:

score: 0
Accepted
time: 0ms
memory: 3668kb

input:

50 50 49

output:

272

result:

ok single line: '272'

Test #19:

score: 0
Accepted
time: 0ms
memory: 3732kb

input:

50 49 50

output:

273

result:

ok single line: '273'

Test #20:

score: 0
Accepted
time: 0ms
memory: 3676kb

input:

50 49 49

output:

270

result:

ok single line: '270'

Test #21:

score: 0
Accepted
time: 0ms
memory: 3588kb

input:

49 50 50

output:

273

result:

ok single line: '273'

Test #22:

score: 0
Accepted
time: 0ms
memory: 3616kb

input:

49 50 49

output:

270

result:

ok single line: '270'

Test #23:

score: 0
Accepted
time: 0ms
memory: 3664kb

input:

49 49 50

output:

271

result:

ok single line: '271'

Test #24:

score: 0
Accepted
time: 0ms
memory: 3656kb

input:

49 49 49

output:

268

result:

ok single line: '268'

Test #25:

score: 0
Accepted
time: 0ms
memory: 3668kb

input:

0 0 50

output:

75

result:

ok single line: '75'

Test #26:

score: 0
Accepted
time: 0ms
memory: 3600kb

input:

0 0 3

output:

3

result:

ok single line: '3'

Test #27:

score: 0
Accepted
time: 0ms
memory: 3728kb

input:

0 1 50

output:

77

result:

ok single line: '77'

Test #28:

score: 0
Accepted
time: 0ms
memory: 3608kb

input:

0 2 50

output:

79

result:

ok single line: '79'

Test #29:

score: 0
Accepted
time: 0ms
memory: 3728kb

input:

0 50 0

output:

0

result:

ok single line: '0'

Test #30:

score: 0
Accepted
time: 0ms
memory: 3672kb

input:

0 50 1

output:

0

result:

ok single line: '0'

Test #31:

score: 0
Accepted
time: 0ms
memory: 3684kb

input:

0 50 2

output:

103

result:

ok single line: '103'

Test #32:

score: 0
Accepted
time: 0ms
memory: 3672kb

input:

0 50 3

output:

103

result:

ok single line: '103'

Test #33:

score: 0
Accepted
time: 0ms
memory: 3740kb

input:

0 0 4

output:

6

result:

ok single line: '6'

Test #34:

score: 0
Accepted
time: 0ms
memory: 3676kb

input:

0 1 1

output:

0

result:

ok single line: '0'

Test #35:

score: 0
Accepted
time: 0ms
memory: 3548kb

input:

0 1 2

output:

5

result:

ok single line: '5'

Test #36:

score: 0
Accepted
time: 0ms
memory: 3736kb

input:

0 1 3

output:

5

result:

ok single line: '5'

Test #37:

score: 0
Accepted
time: 0ms
memory: 3692kb

input:

0 1 4

output:

8

result:

ok single line: '8'

Test #38:

score: 0
Accepted
time: 0ms
memory: 3600kb

input:

0 2 1

output:

0

result:

ok single line: '0'