| 提出番号 | 170 |
|---|---|
| 提出者 | tone_back |
| 言語 | C++ |
| 提出日時 | 2017-07-05 21:30:40 |
| 問題名 | (13)エセ数列 |
| 結果 | WA |
| 点数 | 0% |
| テストケース | 結果 | 得点 | 実行時間 | メモリ使用量 |
|---|---|---|---|---|
| 1 | AC | 100% | 2ms | 8288KB |
| 2 | AC | 100% | 1ms | 8304KB |
| 3 | WA | 0% | 798ms | 20144KB |
| 4 | WA | 0% | 412ms | 20144KB |
| 5 | WA | 0% | 763ms | 20144KB |
| 6 | AC | 100% | 389ms | 20144KB |
| 7 | WA | 0% | 398ms | 20144KB |
| 8 | AC | 100% | 710ms | 20144KB |
| 9 | AC | 100% | 642ms | 20144KB |
| 10 | WA | 0% | 519ms | 20144KB |
| 11 | WA | 0% | 727ms | 20144KB |
| 12 | AC | 100% | 574ms | 20144KB |
| 13 | AC | 100% | 390ms | 20144KB |
| 14 | AC | 100% | 444ms | 20144KB |
| 15 | WA | 0% | 396ms | 20144KB |
| 16 | AC | 100% | 397ms | 20144KB |
| 17 | AC | 100% | 524ms | 20144KB |
| 18 | WA | 0% | 457ms | 20144KB |
| 19 | AC | 100% | 394ms | 20144KB |
| 20 | WA | 0% | 391ms | 20144KB |
| 21 | WA | 0% | 537ms | 20144KB |
| 22 | AC | 100% | 395ms | 20144KB |
| 23 | AC | 100% | 394ms | 20144KB |
| 24 | WA | 0% | 394ms | 20144KB |
| 25 | AC | 100% | 403ms | 20144KB |
| 26 | WA | 0% | 393ms | 20144KB |
| 27 | AC | 100% | 397ms | 20144KB |
| 28 | WA | 0% | 487ms | 20144KB |
| 29 | AC | 100% | 398ms | 20144KB |
| 30 | AC | 100% | 393ms | 20144KB |
#define _USE_MATH_DEFINES
typedef long long ll;
const ll MD = 1000000007;
#include <iostream>
#include <math.h>
#include <climits>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <string>
using namespace std;
/* sample input
*/
int main()
{
int n, m;
int query;
int *a;
int *answer;
cin >> n >> m;
a = new int[n*m];
for (int i = 0; i < n*m; i++){
cin >> a[(i / m)*m + i%m];
}
cin >> query;
answer = new int[query];
int ai, bi;
for (int i = 0; i < query; i++){
cin >> ai >> bi;
answer[i] = 0;
answer[i] = a[(ai - 1)*m + (bi - 1)] + a[(ai)*m + (bi - 1)] + a[(ai - 2)*m + (bi - 1)] + a[(ai - 1)*m + (bi)] + a[(ai - 1)*m + (bi - 2)];
//cout << answer [i]<< endl;
}
for (int i = 0; i < query; i++){
cout << answer[i] << endl;
}
delete[] a;
delete[] answer;
return 0;
}