oj.uz

답안 #547456

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547456 2022-04-10T18:41:47 Z Olympia Vještica (COCI16_vjestica) C++17
0 / 160
 14 ms 1236 KB 
#include <cmath>
#include <iostream>
#include <set>
#include <climits>
#include <algorithm>
#include <cassert>
#include <vector>
#include <iomanip>
#include <type_traits>
#include <string>
#include <queue>
#include <map>

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using namespace std;
int lcp (string& s, string& t) {
    for (int i = 0; i < min(s.length(), t.length()); i++) if (s[i] != t[i]) return i;
    return min(s.length(), t.length());
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    vector<string> vec(n); for (int i = 0; i < n; i++) cin >> vec[i];
    for (int i = 0; i < n; i++) sort(vec[i].begin(), vec[i].end());
    sort(vec.begin(), vec.end());
    int ans = 0;
    for (int i = 0; i < n; i++) {
        ans += vec[i].size();
    }
    for (int i = 1; i < n; i++) {
        ans -= lcp(vec[i], vec[i - 1]);
    }
    cout << ans + 1;
}

Compilation message

vjestica.cpp:15: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   15 | #pragma GCC optimization ("O3")
      | 
vjestica.cpp:16: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   16 | #pragma GCC optimization ("unroll-loops")
      | 
vjestica.cpp: In function 'int lcp(std::string&, std::string&)':
vjestica.cpp:19:23: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
   19 |     for (int i = 0; i < min(s.length(), t.length()); i++) if (s[i] != t[i]) return i;
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Incorrect 1 ms 340 KB Output isn't correct
5 Incorrect 2 ms 468 KB Output isn't correct
6 Incorrect 8 ms 852 KB Output isn't correct
7 Incorrect 13 ms 1108 KB Output isn't correct
8 Incorrect 14 ms 1228 KB Output isn't correct
9 Incorrect 13 ms 1236 KB Output isn't correct
10 Incorrect 13 ms 1236 KB Output isn't correct