제출 #635737

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
635737	2022-08-26 18:09:20	Bruteforceman	Zamjena (COCI18_zamjena)	C++11	14 / 70	38 ms	3156 KiB

zamjena

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
    #pragma GCC optimize("Ofast")
    #include <bits/stdc++.h>
    #include <ext/pb_ds/assoc_container.hpp>
    #include <ext/pb_ds/tree_policy.hpp>
    using namespace std ;
    using namespace __gnu_pbds;
     
    #define int long long
    #define endl '\n'
    #define ordered_set tree<pair < int ,int >,null_type,less<pair < int ,int >>,rb_tree_tag,tree_order_statistics_node_update>
    #define all(a) a.begin() , a.end()
    #define alr(a) a.rbegin() , a.rend()
    bool check(string x){
        return(x[0] >= '0' && x[0] <= '9');
    }
    signed main(){
        ios_base::sync_with_stdio(0), cin.tie(0),cout.tie(0);
     
        int n ;
        cin >> n ;
        vector < string > a(n) , b(n);
        map < string , string > mp ;
        for( auto &i : a )
            cin >> i;
        for( auto &i : b )
            cin >> i;
        for( int i = 0 ; i < n ; i++ )
            mp[a[i]] = mp[b[i]] = "inf";
        for( int re = 0 ; re < 10 ; re++ ) {
            for( int i = 0 ; i < n ; i++ ){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 14 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 14