Submission #1301314
Source Code Expand
#include <algorithm> #include <bitset> #include <cassert> #include <cctype> #include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #include <deque> #include <functional> #include <iomanip> #include <iostream> #include <list> #include <map> #include <numeric> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <utility> #include <vector> #define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++) using namespace std; typedef long long int ll; typedef vector<int> VI; typedef vector<ll> VL; typedef pair<int, int> PI; const ll mod = 1e9 + 7; int calc(VI x) { int n = x.size(); int ma = 0; if (n == 1) { return x[0]; } REP(i, 1, n - 1) { x[i] = 1 - x[i]; } VI acc1(n + 1), acc2(n + 1); REP(i, 0, n) { acc1[i + 1] = acc1[i] + x[i]; } for (int i = n - 1; i >= 0; --i) { acc2[i] = acc2[i + 1] + x[i]; } REP(i, 0, n - 1) { int last; if (x[i] == x[i + 1]) { last = 1; } else { last = 2; } ma = max(ma, last + acc1[i] + acc2[i + 2]); } return ma; } int main(void){ int m, n; cin >> m >> n; vector<VI> a(m, VI(n)); REP(i, 0, m) { REP(j, 0, n) { cin >> a[i][j]; } } int tot = 0; REP(i, 0, m) { if (i >= 1) { REP(j, 0, n) { a[i][j] = 1 - a[i][j]; } } tot += calc(a[i]); } cout << tot << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - チョコレート |
User | kobae964 |
Language | C++14 (GCC 5.4.1) |
Score | 250 |
Code Size | 1397 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 250 / 250 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_min_00.txt, 00_min_01.txt, 00_teuchi_01.txt, 00_teuchi_02.txt, 01_or_12.txt, 01_or_13.txt, 01_or_14.txt, 01_or_15.txt, 01_or_16.txt, 01_or_17.txt, 01_or_18.txt, 01_or_19.txt, 01_or_20.txt, 01_or_21.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 01_random_12.txt, 01_random_13.txt, 01_random_14.txt, 01_random_15.txt, 01_random_16.txt, 01_random_17.txt, 01_random_18.txt, 01_random_19.txt, 01_random_20.txt, 01_random_21.txt, 01_random_22.txt, 01_random_23.txt, 01_random_24.txt, 01_random_25.txt, 01_random_26.txt, 01_random_27.txt, 01_random_28.txt, 01_random_29.txt, 01_random_30.txt, 01_random_31.txt, 02_oc_22.txt, 02_oc_23.txt, 02_oc_24.txt, 02_oc_25.txt, 02_oc_26.txt, 02_oc_27.txt, 02_oc_28.txt, 02_oc_29.txt, 02_oc_30.txt, 02_oc_31.txt, 03_random_02.txt, 03_random_03.txt, 03_random_04.txt, 03_random_05.txt, 03_random_06.txt, 03_random_07.txt, 03_random_08.txt, 03_random_09.txt, 03_random_10.txt, 03_random_11.txt, 10_asi_24.txt, 10_random_00.txt, 10_random_01.txt, 10_random_02.txt, 10_random_03.txt, 10_random_04.txt, 10_random_05.txt, 10_random_06.txt, 10_random_07.txt, 10_random_08.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_min_00.txt | AC | 1 ms | 256 KB |
00_min_01.txt | AC | 1 ms | 256 KB |
00_teuchi_01.txt | AC | 1 ms | 256 KB |
00_teuchi_02.txt | AC | 1 ms | 256 KB |
01_or_12.txt | AC | 1 ms | 256 KB |
01_or_13.txt | AC | 1 ms | 256 KB |
01_or_14.txt | AC | 1 ms | 256 KB |
01_or_15.txt | AC | 1 ms | 256 KB |
01_or_16.txt | AC | 1 ms | 256 KB |
01_or_17.txt | AC | 1 ms | 256 KB |
01_or_18.txt | AC | 1 ms | 256 KB |
01_or_19.txt | AC | 1 ms | 256 KB |
01_or_20.txt | AC | 1 ms | 256 KB |
01_or_21.txt | AC | 1 ms | 256 KB |
01_random_00.txt | AC | 1 ms | 256 KB |
01_random_01.txt | AC | 1 ms | 256 KB |
01_random_02.txt | AC | 3 ms | 256 KB |
01_random_03.txt | AC | 3 ms | 256 KB |
01_random_04.txt | AC | 3 ms | 256 KB |
01_random_05.txt | AC | 3 ms | 256 KB |
01_random_06.txt | AC | 3 ms | 256 KB |
01_random_07.txt | AC | 3 ms | 256 KB |
01_random_08.txt | AC | 3 ms | 256 KB |
01_random_09.txt | AC | 3 ms | 256 KB |
01_random_10.txt | AC | 3 ms | 256 KB |
01_random_11.txt | AC | 3 ms | 256 KB |
01_random_12.txt | AC | 1 ms | 256 KB |
01_random_13.txt | AC | 1 ms | 256 KB |
01_random_14.txt | AC | 1 ms | 256 KB |
01_random_15.txt | AC | 1 ms | 256 KB |
01_random_16.txt | AC | 1 ms | 256 KB |
01_random_17.txt | AC | 1 ms | 256 KB |
01_random_18.txt | AC | 1 ms | 256 KB |
01_random_19.txt | AC | 1 ms | 256 KB |
01_random_20.txt | AC | 1 ms | 256 KB |
01_random_21.txt | AC | 1 ms | 256 KB |
01_random_22.txt | AC | 1 ms | 256 KB |
01_random_23.txt | AC | 1 ms | 256 KB |
01_random_24.txt | AC | 1 ms | 256 KB |
01_random_25.txt | AC | 1 ms | 256 KB |
01_random_26.txt | AC | 1 ms | 256 KB |
01_random_27.txt | AC | 1 ms | 256 KB |
01_random_28.txt | AC | 1 ms | 256 KB |
01_random_29.txt | AC | 1 ms | 256 KB |
01_random_30.txt | AC | 1 ms | 256 KB |
01_random_31.txt | AC | 1 ms | 256 KB |
02_oc_22.txt | AC | 1 ms | 256 KB |
02_oc_23.txt | AC | 1 ms | 256 KB |
02_oc_24.txt | AC | 1 ms | 256 KB |
02_oc_25.txt | AC | 1 ms | 256 KB |
02_oc_26.txt | AC | 1 ms | 256 KB |
02_oc_27.txt | AC | 1 ms | 256 KB |
02_oc_28.txt | AC | 1 ms | 256 KB |
02_oc_29.txt | AC | 1 ms | 256 KB |
02_oc_30.txt | AC | 1 ms | 256 KB |
02_oc_31.txt | AC | 1 ms | 256 KB |
03_random_02.txt | AC | 3 ms | 256 KB |
03_random_03.txt | AC | 3 ms | 256 KB |
03_random_04.txt | AC | 3 ms | 256 KB |
03_random_05.txt | AC | 3 ms | 256 KB |
03_random_06.txt | AC | 3 ms | 256 KB |
03_random_07.txt | AC | 3 ms | 256 KB |
03_random_08.txt | AC | 3 ms | 256 KB |
03_random_09.txt | AC | 3 ms | 256 KB |
03_random_10.txt | AC | 3 ms | 256 KB |
03_random_11.txt | AC | 3 ms | 256 KB |
10_asi_24.txt | AC | 3 ms | 256 KB |
10_random_00.txt | AC | 1 ms | 256 KB |
10_random_01.txt | AC | 3 ms | 256 KB |
10_random_02.txt | AC | 1 ms | 256 KB |
10_random_03.txt | AC | 1 ms | 256 KB |
10_random_04.txt | AC | 1 ms | 256 KB |
10_random_05.txt | AC | 1 ms | 256 KB |
10_random_06.txt | AC | 1 ms | 256 KB |
10_random_07.txt | AC | 1 ms | 256 KB |
10_random_08.txt | AC | 1 ms | 256 KB |