oj.uz

답안 #808722

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
808722 2023-08-05T09:54:51 Z vjudge1 Bitaro the Brave (JOI19_ho_t1) C++17
0 / 100
 1 ms 300 KB 
#include<bits/stdc++.h>
using namespace std;
int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int h,w;
    cin >> h >> w;
    vector<int> J[h], O[h],I[h];
    map<int,int>mp;
    for (int i = 0; i < h; i++)
    {
        string s;
        cin >> s;
        for (int j = 0; j < w; j++)
        {
            if (s[j] == 'J')
            {
                J[i].push_back(j);
            }
            else if (s[j] == 'O')
            {
                O[i].push_back(j);
            }
            else
            {
            	mp[j]++;
            }
        }
    }
    int ans=0;
    for(int i=0;i<h;i++)
    {
    	for(int j=0;j<J[i].size();j++)
    	{
    		for(int k=0;k<O[i].size();k++)
    		{
    			ans+=mp[J[i][j]];
			}
		}
	}
	cout<<ans;
    return 0;
}

Compilation message

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:33:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |      for(int j=0;j<J[i].size();j++)
      |                  ~^~~~~~~~~~~~
joi2019_ho_t1.cpp:35:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |       for(int k=0;k<O[i].size();k++)
      |                   ~^~~~~~~~~~~~

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -