Submission #152496

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
152496	2019-09-08T08:31:17 Z	PedroBigMan	Lozinke (COCI17_lozinke)	C++14	55 / 100	396 ms	1528 KB

lozinke

#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())
        {
            it++;
            ans+=(ll) (upper_bound(str.begin(),str.end(),*it)-lower_bound(str.begin(),str.end(),*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

55.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	376 KB	Output isn't correct
2	Incorrect	2 ms	376 KB	Output isn't correct
3	Incorrect	3 ms	376 KB	Output isn't correct
4	Incorrect	4 ms	376 KB	Output isn't correct
5	Incorrect	13 ms	504 KB	Output isn't correct
6	Correct	21 ms	376 KB	Output is correct
7	Incorrect	26 ms	504 KB	Output isn't correct
8	Correct	35 ms	504 KB	Output is correct
9	Incorrect	111 ms	1016 KB	Output isn't correct
10	Correct	188 ms	1012 KB	Output is correct
11	Incorrect	180 ms	1112 KB	Output isn't correct
12	Correct	373 ms	1016 KB	Output is correct
13	Correct	315 ms	1520 KB	Output is correct
14	Incorrect	288 ms	1524 KB	Output isn't correct
15	Correct	396 ms	1524 KB	Output is correct
16	Correct	277 ms	1520 KB	Output is correct
17	Correct	91 ms	1520 KB	Output is correct
18	Correct	71 ms	1528 KB	Output is correct
19	Correct	317 ms	1520 KB	Output is correct
20	Correct	155 ms	1500 KB	Output is correct