oj.uz

Submission #234370

# Submission time Handle Problem Language Result Execution time Memory
234370 2020-05-24T06:10:18 Z aloo123 Tracks in the Snow (BOI13_tracks) C++14
2.1875 / 100
 337 ms 16120 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define all(x) (x).begin() , (x).end()
#define f first
#define s second
#define pr(x) cout<<x<<endl;
#define pr2(x,y) cout<<x<<" "<<y<<endl;
#define pr3(x,y,z) cout<<x<<" "<<y<<endl;
#define prv(v) for(auto x:v) cout<<x<<" ";
#define ffs fflush(stdout);
#define int ll
#define sz(x) (ll)x.size()
using namespace std;
 

const ll MOD = 1e9+7;
const ll INF = 1e9;
const ll LOG = 29;
#define PI 3.141592653589793238 
 
 
long long binpow(long long a, long long b) {
     a%=MOD;    
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = (res * a);
        a = (a * a);
 
        
        b >>= 1;
    }
     res%=MOD;
    return res;
}

const ll N =(1e6+5);
char grid[4005][4005];
void solve(){
    ll n,m;
    cin>>n>> m;
    set<char> se;
    for(int i = 1;i<= n;i++){
        for(int j = 1;j <= m;j++){
            char c;
            cin >> c;
            if(c == '.') continue;
            se.in(c);
        }
    }
    cout<<sz(se)<<endl;
}   

   




 
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    
       

    ll t=1;
   //cin>>t;
    while(t--){
        solve();
    }    
     
}

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 512 KB Output isn't correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Incorrect 5 ms 384 KB Output isn't correct
4 Incorrect 8 ms 512 KB Output isn't correct
5 Incorrect 6 ms 384 KB Output isn't correct
6 Incorrect 5 ms 384 KB Output isn't correct
7 Incorrect 5 ms 384 KB Output isn't correct
8 Incorrect 5 ms 384 KB Output isn't correct
9 Incorrect 5 ms 384 KB Output isn't correct
10 Incorrect 6 ms 384 KB Output isn't correct
11 Incorrect 5 ms 384 KB Output isn't correct
12 Incorrect 6 ms 384 KB Output isn't correct
13 Incorrect 6 ms 384 KB Output isn't correct
14 Incorrect 6 ms 384 KB Output isn't correct
15 Incorrect 10 ms 640 KB Output isn't correct
16 Incorrect 11 ms 512 KB Output isn't correct
17 Incorrect 10 ms 640 KB Output isn't correct
18 Incorrect 8 ms 512 KB Output isn't correct

Subtask #2
2.1875 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 384 KB Output isn't correct
2 Incorrect 33 ms 1912 KB Output isn't correct
3 Incorrect 265 ms 15992 KB Output isn't correct
4 Incorrect 72 ms 3960 KB Output isn't correct
5 Incorrect 137 ms 9208 KB Output isn't correct
6 Incorrect 274 ms 16120 KB Output isn't correct
7 Incorrect 6 ms 384 KB Output isn't correct
8 Incorrect 6 ms 384 KB Output isn't correct
9 Incorrect 6 ms 384 KB Output isn't correct
10 Incorrect 5 ms 384 KB Output isn't correct
11 Incorrect 5 ms 384 KB Output isn't correct
12 Incorrect 5 ms 512 KB Output isn't correct
13 Incorrect 31 ms 1912 KB Output isn't correct
14 Incorrect 22 ms 1280 KB Output isn't correct
15 Incorrect 24 ms 1280 KB Output isn't correct
16 Incorrect 16 ms 1024 KB Output isn't correct
17 Incorrect 75 ms 4344 KB Output isn't correct
18 Incorrect 85 ms 4216 KB Output isn't correct
19 Incorrect 69 ms 3960 KB Output isn't correct
20 Incorrect 59 ms 3704 KB Output isn't correct
21 Incorrect 148 ms 9484 KB Output isn't correct
22 Incorrect 149 ms 9360 KB Output isn't correct
23 Incorrect 156 ms 7928 KB Output isn't correct
24 Incorrect 155 ms 9208 KB Output isn't correct
25 Incorrect 337 ms 16096 KB Output isn't correct
26 Correct 193 ms 12304 KB Output is correct
27 Incorrect 293 ms 16040 KB Output isn't correct
28 Incorrect 281 ms 16028 KB Output isn't correct
29 Incorrect 287 ms 16024 KB Output isn't correct
30 Incorrect 301 ms 15784 KB Output isn't correct
31 Incorrect 238 ms 10360 KB Output isn't correct
32 Incorrect 242 ms 15992 KB Output isn't correct