# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
157667 | 2019-10-12T17:02:58 Z | InfiniteJest | Bitaro the Brave (JOI19_ho_t1) | C++14 | 1000 ms | 127932 KB |
#include <iostream> #include <fstream> #include <vector> #include <queue> #include <algorithm> #include <math.h> #define pb push_back #define mp make_pair #define fi first #define se second using namespace std; ifstream in("input.txt"); ofstream out("output.txt"); typedef long long ll; int h,w; char tab[5000][5000]; int pref[5000][5000]; int prefb[5000][5000]; int sump[5000]; vector<pair<int,int> > v; int main(){ cin>>h>>w; for(int i=0;i<h;i++){ int sum=0; for(int y=0;y<w;y++){ cin>>tab[i][y]; if(tab[i][y]=='O')sum++; else if(tab[i][y]=='I')sump[y]++; else v.pb(mp(i,y)); prefb[i][y]=sum; pref[i][y]=sump[y]; } } /*for(int i=0;i<w;i++){ int sum=0; for(int y=0;y<h;y++){ if(tab[y][i]=='I')sum++; pref[y][i]=sum; } }*/ ll tot=0; for(int i=0;i<v.size();i++)tot+=(prefb[v[i].fi][w-1]-prefb[v[i].fi][v[i].se])*(pref[h-1][v[i].se]-pref[v[i].fi][v[i].se]); cout<<tot; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 4 ms | 1660 KB | Output is correct |
6 | Correct | 4 ms | 1656 KB | Output is correct |
7 | Correct | 4 ms | 1528 KB | Output is correct |
8 | Correct | 4 ms | 1656 KB | Output is correct |
9 | Correct | 4 ms | 1784 KB | Output is correct |
10 | Correct | 4 ms | 1528 KB | Output is correct |
11 | Correct | 5 ms | 1784 KB | Output is correct |
12 | Correct | 4 ms | 1656 KB | Output is correct |
13 | Correct | 4 ms | 1528 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 4 ms | 1660 KB | Output is correct |
6 | Correct | 4 ms | 1656 KB | Output is correct |
7 | Correct | 4 ms | 1528 KB | Output is correct |
8 | Correct | 4 ms | 1656 KB | Output is correct |
9 | Correct | 4 ms | 1784 KB | Output is correct |
10 | Correct | 4 ms | 1528 KB | Output is correct |
11 | Correct | 5 ms | 1784 KB | Output is correct |
12 | Correct | 4 ms | 1656 KB | Output is correct |
13 | Correct | 4 ms | 1528 KB | Output is correct |
14 | Correct | 31 ms | 8816 KB | Output is correct |
15 | Correct | 7 ms | 5496 KB | Output is correct |
16 | Correct | 17 ms | 5232 KB | Output is correct |
17 | Correct | 2 ms | 504 KB | Output is correct |
18 | Correct | 38 ms | 9356 KB | Output is correct |
19 | Correct | 34 ms | 8824 KB | Output is correct |
20 | Correct | 36 ms | 9320 KB | Output is correct |
21 | Correct | 37 ms | 9324 KB | Output is correct |
22 | Correct | 35 ms | 9196 KB | Output is correct |
23 | Correct | 34 ms | 9196 KB | Output is correct |
24 | Correct | 37 ms | 9576 KB | Output is correct |
25 | Correct | 34 ms | 8820 KB | Output is correct |
26 | Correct | 34 ms | 9196 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 4 ms | 1660 KB | Output is correct |
6 | Correct | 4 ms | 1656 KB | Output is correct |
7 | Correct | 4 ms | 1528 KB | Output is correct |
8 | Correct | 4 ms | 1656 KB | Output is correct |
9 | Correct | 4 ms | 1784 KB | Output is correct |
10 | Correct | 4 ms | 1528 KB | Output is correct |
11 | Correct | 5 ms | 1784 KB | Output is correct |
12 | Correct | 4 ms | 1656 KB | Output is correct |
13 | Correct | 4 ms | 1528 KB | Output is correct |
14 | Correct | 31 ms | 8816 KB | Output is correct |
15 | Correct | 7 ms | 5496 KB | Output is correct |
16 | Correct | 17 ms | 5232 KB | Output is correct |
17 | Correct | 2 ms | 504 KB | Output is correct |
18 | Correct | 38 ms | 9356 KB | Output is correct |
19 | Correct | 34 ms | 8824 KB | Output is correct |
20 | Correct | 36 ms | 9320 KB | Output is correct |
21 | Correct | 37 ms | 9324 KB | Output is correct |
22 | Correct | 35 ms | 9196 KB | Output is correct |
23 | Correct | 34 ms | 9196 KB | Output is correct |
24 | Correct | 37 ms | 9576 KB | Output is correct |
25 | Correct | 34 ms | 8820 KB | Output is correct |
26 | Correct | 34 ms | 9196 KB | Output is correct |
27 | Execution timed out | 1072 ms | 127932 KB | Time limit exceeded |
28 | Halted | 0 ms | 0 KB | - |