oj.uz

답안 #152498

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
152498 2019-09-08T08:32:37 Z PedroBigMan Lozinke (COCI17_lozinke) C++14
100 / 100
 405 ms 1528 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <set>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define INF ((ll) pow(2,63) -1)
#define si signed
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
ll N, ans; vector<string> str; string s,t; bool eq; set<string> sub; set<string>:: iterator it;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>N; string cur;
    REP(i,0,N) {cin>>cur; str.pb(cur);}
    ans=0;
    sort(str.begin(),str.end());
    REP(i,0,N)
    {
        sub.clear();
        REP(l,0,str[i].size())
        {
            cur="";
            REP(r,l,str[i].size())
            {
                cur+=str[i][r]; sub.insert(cur);   
            }
        }
        it=sub.begin();
        REP(j,0,sub.size())
        {
            ans+=(ll) (upper_bound(str.begin(),str.end(),*it)-lower_bound(str.begin(),str.end(),*it));
            it++;
        }
    }
    cout<<ans-N<<endl;
    return 0;
}

Compilation message

lozinke.cpp: In function 'void Out(std::vector<long long int>)':
lozinke.cpp:11:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
lozinke.cpp:21:29:
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                             ~~~~~~~~~~~~
lozinke.cpp:21:25: note: in expansion of macro 'REP'
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                         ^~~
lozinke.cpp: In function 'int main()':
lozinke.cpp:11:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
lozinke.cpp:35:13:
         REP(l,0,str[i].size())
             ~~~~~~~~~~~~~~~~~    
lozinke.cpp:35:9: note: in expansion of macro 'REP'
         REP(l,0,str[i].size())
         ^~~
lozinke.cpp:11:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
lozinke.cpp:38:17:
             REP(r,l,str[i].size())
                 ~~~~~~~~~~~~~~~~~
lozinke.cpp:38:13: note: in expansion of macro 'REP'
             REP(r,l,str[i].size())
             ^~~
lozinke.cpp:11:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
lozinke.cpp:44:13:
         REP(j,0,sub.size())
             ~~~~~~~~~~~~~~       
lozinke.cpp:44:9: note: in expansion of macro 'REP'
         REP(j,0,sub.size())
         ^~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 13 ms 376 KB Output is correct
6 Correct 21 ms 536 KB Output is correct
7 Correct 26 ms 504 KB Output is correct
8 Correct 36 ms 504 KB Output is correct
9 Correct 113 ms 1016 KB Output is correct
10 Correct 196 ms 1016 KB Output is correct
11 Correct 185 ms 1016 KB Output is correct
12 Correct 375 ms 1016 KB Output is correct
13 Correct 325 ms 1524 KB Output is correct
14 Correct 299 ms 1524 KB Output is correct
15 Correct 405 ms 1524 KB Output is correct
16 Correct 288 ms 1528 KB Output is correct
17 Correct 93 ms 1524 KB Output is correct
18 Correct 72 ms 1524 KB Output is correct
19 Correct 326 ms 1524 KB Output is correct
20 Correct 157 ms 1520 KB Output is correct