This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <unordered_set>
using namespace std;
#define ll long long
#define ff first
#define ss second
ll n, m, m1, m2, k;
ll MOD = 1e9 + 7;
ll INF = 1e18 + 7;
ll ttt;
ll cnt = 0;
int main()
{
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m - 1; j++) {
int x;
cin >> x;
cnt += (x == 0 ? 1 : 0);
}
}
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < m; j++) {
int x;
cin >> x;
cnt += (x == 0 ? 1 : 0);
}
}
cout << -(cnt - 1) << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |