# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
133443 | 2019-07-20T17:12:29 Z | Zex | Vještica (COCI16_vjestica) | C++11 | 31 ms | 1044 KB |
#include<bits/stdc++.h> using namespace std; #define LL long long #define INF INT_MAX #define output for(int i=0;i<sizex;i++) { for(int j=0;j<sizey;j++) { cout << moveChart[i][j] << " "; }cout<<endl; }cout<<endl; int N; int main(){ ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int maxLen = -1; cin >> N; vector <string> str(N); for(int i=0;i<N;i++) { cin >> str[i]; sort( str[i].begin(), str[i].end() ); maxLen = max( maxLen, int(str[i].length()) ); } int res = 1; set <char> S; for(int i=0;i<maxLen;i++){ S.clear(); for(int j=0;j<N;j++){ if( str[j].length() <= i ) continue; S.insert( str[j][i] ); } res += S.size(); } cout << res << endl; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Incorrect | 2 ms | 376 KB | Output isn't correct |
3 | Incorrect | 2 ms | 376 KB | Output isn't correct |
4 | Incorrect | 3 ms | 376 KB | Output isn't correct |
5 | Incorrect | 8 ms | 504 KB | Output isn't correct |
6 | Incorrect | 20 ms | 760 KB | Output isn't correct |
7 | Incorrect | 30 ms | 1016 KB | Output isn't correct |
8 | Incorrect | 30 ms | 1016 KB | Output isn't correct |
9 | Incorrect | 31 ms | 1016 KB | Output isn't correct |
10 | Incorrect | 31 ms | 1044 KB | Output isn't correct |