Submission #997395


Source Code Expand

#include <vector>
#include <iostream>
#include <algorithm>
#pragma warning(disable : 4996)
using namespace std;
int n, m;
int main() {
	scanf("%d%d", &n, &m);
	vector<vector<int> > a(n, vector<int>(m));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			scanf("%d", &a[i][j]);
		}
	}
	bool flag = true;
	for (int i = 1; i < n; i++) {
		if (a[i - 1][0] > a[i][0]) flag = false;
	}
	if (!flag) {
		cout << -1 << endl;
	}
	else {
		int cnt = 0;
		for (int i = 1; i < n; i++) {
			while (a[i - 1] >= a[i]) {
				int sum = a[i][0];
				for (int j = 1; j < m; j++) {
					sum += a[i][j];
					a[i][j] = sum;
				}
				cnt++;
			}
		}
		cout << cnt << endl;
	}
	return 0;
}

Submission Info

Submission Time
Task B - Takahashi the Magician
User square1001
Language C++14 (GCC 5.4.1)
Score 200
Code Size 717 Byte
Status WA
Exec Time 2102 ms
Memory 4224 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:8:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
                       ^
./Main.cpp:12:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &a[i][j]);
                         ^

Judge Result

Set Name Sample subtask1 subtask2 All
Score / Max Score 0 / 0 200 / 200 0 / 800 0 / 200
Status
AC × 3
AC × 27
AC × 33
WA × 1
TLE × 1
AC × 58
WA × 2
TLE × 9
Set Name Test Cases
Sample sample_1.txt, sample_2.txt, sample_3.txt
subtask1 sample_1.txt, sample_3.txt, hack_1.txt, hack_2.txt, hack_3.txt, hack_4.txt, hack_5.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_2.txt, subtask_1_20.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt
subtask2 sample_1.txt, sample_2.txt, sample_3.txt, hack_1.txt, hack_2.txt, hack_3.txt, hack_4.txt, hack_5.txt, subtask_2_1.txt, subtask_2_10.txt, subtask_2_11.txt, subtask_2_12.txt, subtask_2_13.txt, subtask_2_14.txt, subtask_2_15.txt, subtask_2_16.txt, subtask_2_17.txt, subtask_2_18.txt, subtask_2_19.txt, subtask_2_2.txt, subtask_2_20.txt, subtask_2_21.txt, subtask_2_22.txt, subtask_2_23.txt, subtask_2_24.txt, subtask_2_25.txt, subtask_2_26.txt, subtask_2_27.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt
All sample_1.txt, sample_2.txt, sample_3.txt, hack_1.txt, hack_2.txt, hack_3.txt, hack_4.txt, hack_5.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_2.txt, subtask_1_20.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt, subtask_2_1.txt, subtask_2_10.txt, subtask_2_11.txt, subtask_2_12.txt, subtask_2_13.txt, subtask_2_14.txt, subtask_2_15.txt, subtask_2_16.txt, subtask_2_17.txt, subtask_2_18.txt, subtask_2_19.txt, subtask_2_2.txt, subtask_2_20.txt, subtask_2_21.txt, subtask_2_22.txt, subtask_2_23.txt, subtask_2_24.txt, subtask_2_25.txt, subtask_2_26.txt, subtask_2_27.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_10.txt, subtask_3_11.txt, subtask_3_12.txt, subtask_3_13.txt, subtask_3_14.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt
Case Name Status Exec Time Memory
hack_1.txt AC 2 ms 256 KB
hack_2.txt AC 2 ms 256 KB
hack_3.txt AC 2 ms 256 KB
hack_4.txt AC 2 ms 256 KB
hack_5.txt AC 2 ms 256 KB
sample_1.txt AC 2 ms 256 KB
sample_2.txt AC 2 ms 256 KB
sample_3.txt AC 2 ms 256 KB
subtask_1_1.txt AC 2 ms 256 KB
subtask_1_10.txt AC 2 ms 256 KB
subtask_1_11.txt AC 112 ms 4224 KB
subtask_1_12.txt AC 3 ms 256 KB
subtask_1_13.txt AC 3 ms 256 KB
subtask_1_14.txt AC 2 ms 256 KB
subtask_1_15.txt AC 115 ms 4224 KB
subtask_1_16.txt AC 118 ms 4224 KB
subtask_1_17.txt AC 118 ms 4224 KB
subtask_1_18.txt AC 116 ms 4224 KB
subtask_1_19.txt AC 2 ms 256 KB
subtask_1_2.txt AC 2 ms 256 KB
subtask_1_20.txt AC 3 ms 256 KB
subtask_1_3.txt AC 2 ms 256 KB
subtask_1_4.txt AC 3 ms 256 KB
subtask_1_5.txt AC 3 ms 256 KB
subtask_1_6.txt AC 3 ms 256 KB
subtask_1_7.txt AC 3 ms 256 KB
subtask_1_8.txt AC 112 ms 4224 KB
subtask_1_9.txt AC 42 ms 2176 KB
subtask_2_1.txt AC 14 ms 640 KB
subtask_2_10.txt AC 18 ms 896 KB
subtask_2_11.txt AC 456 ms 4224 KB
subtask_2_12.txt AC 272 ms 4224 KB
subtask_2_13.txt AC 361 ms 4224 KB
subtask_2_14.txt AC 271 ms 4224 KB
subtask_2_15.txt AC 3 ms 256 KB
subtask_2_16.txt AC 81 ms 4224 KB
subtask_2_17.txt AC 81 ms 4224 KB
subtask_2_18.txt AC 298 ms 4224 KB
subtask_2_19.txt TLE 2102 ms 256 KB
subtask_2_2.txt AC 108 ms 4224 KB
subtask_2_20.txt AC 2 ms 256 KB
subtask_2_21.txt AC 3 ms 256 KB
subtask_2_22.txt AC 3 ms 256 KB
subtask_2_23.txt AC 3 ms 256 KB
subtask_2_24.txt AC 3 ms 256 KB
subtask_2_25.txt WA 2 ms 256 KB
subtask_2_26.txt AC 3 ms 256 KB
subtask_2_27.txt AC 3 ms 256 KB
subtask_2_3.txt AC 139 ms 4224 KB
subtask_2_4.txt AC 56 ms 2176 KB
subtask_2_5.txt AC 266 ms 4224 KB
subtask_2_6.txt AC 515 ms 4224 KB
subtask_2_7.txt AC 39 ms 1792 KB
subtask_2_8.txt AC 7 ms 512 KB
subtask_2_9.txt AC 23 ms 1152 KB
subtask_3_1.txt AC 3 ms 256 KB
subtask_3_10.txt TLE 2102 ms 4224 KB
subtask_3_11.txt TLE 2102 ms 4224 KB
subtask_3_12.txt AC 118 ms 4224 KB
subtask_3_13.txt AC 3 ms 256 KB
subtask_3_14.txt TLE 2102 ms 256 KB
subtask_3_2.txt AC 3 ms 256 KB
subtask_3_3.txt TLE 2102 ms 4224 KB
subtask_3_4.txt TLE 2102 ms 4224 KB
subtask_3_5.txt TLE 2102 ms 4224 KB
subtask_3_6.txt TLE 2102 ms 4224 KB
subtask_3_7.txt AC 390 ms 4224 KB
subtask_3_8.txt WA 230 ms 4224 KB
subtask_3_9.txt TLE 2102 ms 4224 KB