제출 #1186153

#제출 시각아이디문제언어결과실행 시간메모리
1186153yoruonivampTracks in the Snow (BOI13_tracks)C++20
2.19 / 100
100 ms18188 KiB
// YoruoniVamp - VTUBE // Pragma Credit to Discord: pxsithexahydride #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,no-stack-protector,inline-small-functions,inline,unsafe-math-optimizations,omit-frame-pointer,inline-functions-called-once") #include <bits/stdc++.h> #pragma GCC target("avx2,fma,popcnt,lzcnt,bmi,bmi2,sse4.2,tune=native") using namespace std; #define endl '\n' #define ll long long #define ld long double #define ull unsigned ll #define cint const int #define cf const float cint mxA = 1e6+5, MOD = 1e9+7, INF = 0x3f3f3f3f; cint d4x[4] = {0, 1, 0, -1}, d4y[4] = {1, 0, -1, 0}; cint d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1}, d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1}; void wait(int ms){ clock_t endwait; endwait = clock() + ms; while(clock()<endwait){} } void solve(){ int n, m; cin >> n >> m; string grid[n]; set<char> cnt; for(int i = 0; i < n; i++) cin >> grid[i]; for(int i = 0; i < n; i++){ for(char c: grid[i]) if(c!='.') cnt.insert(c); } cout << cnt.size(); return; } int main(){ cin.tie(nullptr)->sync_with_stdio(0);cout.tie(0); // freopen("", "r", stdin); // freopen("", "w", stdout); int t = 1; // cin >> t; while(t--) solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...