B : matrix
Score : 60->100
Diff : 2
Comment :
Examing 1 : Easy.
Examing 2 : (Quickly coding)
Examing 3 : (Completed)
Examing 4 : (Submit)
After Examing 1 :


After Examing 2 : ????
(Code : )
#include
using namespace std;
int main() {
freopen("matrix.in", "r", stdin);
freopen("matrix.out", "w", stdout);
int k;cin >> k;
int matrix[k][k], ty, tx, rmin[k], cmin[k];
fill(rmin, rmin+k, INT_MAX/2);
fill(cmin, cmin+k, INT_MAX/2);
for (int i=0;i<k;i++) {
for (int j=0;j> matrix[i][j];
if (matrix[i][j] == -1) {ty=i;tx=j;continue;}
rmin[i] = min(rmin[i], matrix[i][j]);
}
}
for (int i=0;i<k;i++) {
for (int j=0;j<k;j++) matrix[i][j] -= rmin[i];
}
for (int i=0;i<k;i++) {
for (int j=0;j<k;j++) {
if (matrix[i][j] < 0) continue;
cmin[j] = min(cmin[j], matrix[i][j]);
}
}
for (int i=0;i<k;i++) {
for (int j=0;j<k;j++) matrix[i][j] -= cmin[j];
}
cout << 0-matrix[ty][tx]-1;
return 0;
}
Change : cin >> matrix[i][j]
To : scanf("%d ", &matrix[i][j])

After Examing 3 : ¿¿¿¿
After Examing 4 : AHHHHHHHHHHHHHHHHHHHH
Conclusion : DO NOT USE CIN/COUT WHEN THE CASE IS VERY VERY BIG.