oj.uz

답안 #994026

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
994026 2024-06-07T03:15:54 Z vjudge1 Kartomat (COCI17_kartomat) C++17
80 / 80
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
int const N=2e5+5;
int const mod=1e9+7;

void solve(){
	int n;
	cin>>n;
	string arr[n];
	for (int i = 0; i < n; ++i)
		cin>>arr[i];
	string s;
	cin>>s;
	string ans[4]={"********","********","********","********"};
	for(int i=0;i<n;i++){
		if(s.length()>=arr[i].length())
			continue;
		bool b=1;
		for(int j=0;j<s.length();j++)
			if(arr[i][j]!=s[j])
				b=0;
		if(b==0)
			continue;
		int v=arr[i][int(s.length())]-'A';
		v+=3;
		ans[v/8][v%8]='A'+v-3;
	}
	for (int i = 0; i < 4; ++i)
		cout<<ans[i]<<endl;
}

int main(){
	int t=1;
	// cin>>t;
	while(t--)
		solve();
	return 0;
}

Compilation message

kartomat.cpp: In function 'void solve()':
kartomat.cpp:21:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |   for(int j=0;j<s.length();j++)
      |               ~^~~~~~~~~~~

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct