Submission #2111639
Source Code Expand
#include <cstdio> #include <vector> #include <algorithm> #define all(v) (v).begin(), (v).end() using namespace std; int main() { int is_possible = true; typedef vector <int> v_int; vector <v_int> matrix (4, v_int(4, 0)); for(int i = 1; i <= 3; i++) for(int j = 1; j <= 3; j++) scanf("%d", &matrix[i][j]); vector <int> row_sum(4, 0); for(int i = 1; i <= 3; i++) for(int j = 1; j <= 3; j++) row_sum[i] += matrix[i][j]; sort(all(row_sum)); vector <int> A(4); vector <int> column_sum(4, 0); for(int i = 1; i <= 3; i++) for(int j = 1; j <= 3; j++) column_sum[j] += matrix[i][j]; sort(all(column_sum)); vector <int> B(4); if( !((row_sum[1] - row_sum[2])%3 == 0 && (row_sum[2] - row_sum[3])%3 == 0 && (row_sum[1] - row_sum[3])%3 == 0) ) { is_possible = false; //printf("R"); } if( !((column_sum[1] - column_sum[2])%3 == 0 && (column_sum[2] - column_sum[3])%3 == 0 && (column_sum[1] - column_sum[3])%3 == 0) ) { is_possible = false; //printf("C"); } if( matrix[1][1] + matrix[3][3] != matrix[3][1] + matrix[1][3]) { is_possible = false; } printf(is_possible ? "Yes\n" : "No\n"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Takahashi's Information |
User | Saikat |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1330 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:17:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &matrix[i][j]); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt |
All | in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in01.txt | AC | 1 ms | 256 KB |
in02.txt | AC | 1 ms | 256 KB |
in03.txt | AC | 1 ms | 256 KB |
in04.txt | AC | 1 ms | 256 KB |
in05.txt | AC | 1 ms | 256 KB |
in06.txt | AC | 1 ms | 256 KB |
in07.txt | AC | 1 ms | 256 KB |
in08.txt | AC | 1 ms | 256 KB |
in09.txt | AC | 1 ms | 256 KB |
in10.txt | AC | 1 ms | 256 KB |
in11.txt | AC | 1 ms | 256 KB |
in12.txt | AC | 1 ms | 256 KB |
in13.txt | AC | 1 ms | 256 KB |
in14.txt | AC | 1 ms | 256 KB |
in15.txt | AC | 1 ms | 256 KB |
in16.txt | AC | 1 ms | 256 KB |
in17.txt | AC | 1 ms | 256 KB |
in18.txt | AC | 1 ms | 256 KB |
in19.txt | AC | 1 ms | 256 KB |
in20.txt | AC | 1 ms | 256 KB |
sample_1.txt | AC | 1 ms | 256 KB |
sample_2.txt | AC | 1 ms | 256 KB |
sample_3.txt | AC | 1 ms | 256 KB |
sample_4.txt | AC | 1 ms | 256 KB |