답안 #380985

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
380985	2021-03-24T03:06:14 Z	arwaeystoamneg	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	361 ms	89708 KB

joi2019_ho_t1

/*
ID: awesome35
LANG: C++14
TASK: vans
*/
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//  998244353
const ld pi = 3.1415926535;

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
}
/*
#ifndef arwaeystoamneg
#include ".h"
#endif*/
#ifdef arwaeystoamneg
#endif
int main()
{
	setIO("");
	int n, m;
	cin >> n >> m;
	vector<string>a(n);
	trav(x, a)cin >> x;
	vector<vi> O(n, vi(m)), I(n, vi(m));
	F0R(i, n)R0F(j, m)
	{
		if (a[i][j] == 'O')O[i][j] = 1;
		if (j != m - 1)O[i][j] += O[i][j + 1];
	}
	F0R(j, m)
	{
		R0F(i, n)
		{
			if (a[i][j] == 'I')I[i][j] = 1;
			if (i != n - 1)I[i][j] += I[i + 1][j];
		}
	}
	ll ans = 0;
	F0R(i, n)
	{
		F0R(j, m)
		{
			if (a[i][j] == 'J')
			{
				ans += O[i][j] * I[i][j];
			}
		}
	}
	cout << ans << endl;
}

Compilation message

joi2019_ho_t1.cpp: In function 'void setIO(std::string)':
joi2019_ho_t1.cpp:53:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   53 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:55:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   55 |    freopen((s + ".out").c_str(), "w", stdout);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	492 KB	Output is correct
8	Correct	1 ms	492 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	492 KB	Output is correct

Subtask #2
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	492 KB	Output is correct
8	Correct	1 ms	492 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	492 KB	Output is correct
14	Correct	6 ms	2284 KB	Output is correct
15	Correct	1 ms	512 KB	Output is correct
16	Correct	3 ms	1644 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	8 ms	2796 KB	Output is correct
19	Correct	6 ms	2796 KB	Output is correct
20	Correct	5 ms	2924 KB	Output is correct
21	Correct	8 ms	2796 KB	Output is correct
22	Correct	5 ms	2796 KB	Output is correct
23	Correct	5 ms	2796 KB	Output is correct
24	Correct	9 ms	2924 KB	Output is correct
25	Correct	6 ms	2796 KB	Output is correct
26	Correct	5 ms	2796 KB	Output is correct

Subtask #3
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	492 KB	Output is correct
8	Correct	1 ms	492 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	492 KB	Output is correct
14	Correct	6 ms	2284 KB	Output is correct
15	Correct	1 ms	512 KB	Output is correct
16	Correct	3 ms	1644 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	8 ms	2796 KB	Output is correct
19	Correct	6 ms	2796 KB	Output is correct
20	Correct	5 ms	2924 KB	Output is correct
21	Correct	8 ms	2796 KB	Output is correct
22	Correct	5 ms	2796 KB	Output is correct
23	Correct	5 ms	2796 KB	Output is correct
24	Correct	9 ms	2924 KB	Output is correct
25	Correct	6 ms	2796 KB	Output is correct
26	Correct	5 ms	2796 KB	Output is correct
27	Correct	339 ms	84668 KB	Output is correct
28	Correct	2 ms	876 KB	Output is correct
29	Correct	13 ms	6764 KB	Output is correct
30	Correct	1 ms	620 KB	Output is correct
31	Correct	252 ms	62484 KB	Output is correct
32	Correct	312 ms	89324 KB	Output is correct
33	Correct	327 ms	89324 KB	Output is correct
34	Correct	272 ms	72172 KB	Output is correct
35	Correct	313 ms	89068 KB	Output is correct
36	Correct	284 ms	89452 KB	Output is correct
37	Correct	361 ms	89708 KB	Output is correct
38	Correct	196 ms	61804 KB	Output is correct
39	Correct	199 ms	62188 KB	Output is correct

답안 #380985

Compilation message

Subtask #1 20.0 / 20.0

Subtask #2 30.0 / 30.0

Subtask #3 50.0 / 50.0

Subtask #1
20.0 / 20.0

Subtask #2
30.0 / 30.0

Subtask #3
50.0 / 50.0