제출 #906261

#제출 시각아이디문제언어결과실행 시간메모리
906261StillOnQiCondensationTracks in the Snow (BOI13_tracks)C++14
2.19 / 100
244 ms33492 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<ll> vll; #define all(x) (x).begin(), (x).end() #define inf 1000000007 #define llmax LLONG_MAX #define pi 3.141592653589793238462643383279502884197169399 long long binpow(long long a, long long b) { long long res = 1; while (b > 0) { if (b & 1) res = res * a; a = a * a; b >>= 1; } return res; } ll ncr(int n, int r) { if (n < r) return 0; long long p = 1, k = 1; if (n - r < r) r = n - r; if (r != 0) { while (r) { p *= n; k *= r; long long m = __gcd(p, k); p /= m; k /= m; n--; r--; } } else p = 1; return p; } vector <ll> vcreate(int n){ vector <ll> v(n); for (int i = 0; i < n; i++) { cin>>v[i]; } return v; } const int MOD=998244353; ll ModExp(ll x, ll n, ll m) { assert(n >= 0); x %= m; // note: m * m must be less than 2^63 to avoid ll overflow ll res = 1; while (n > 0) { if (n % 2 == 1) { res = res * x % m; } x = x * x % m; n /= 2; } return res; } char grid[4500][4500]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); //freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout); /* ll T; cin>>T; for(ll i=0; i<T; i++) { } */ int n{},m{}; cin>>n>>m; int ans{0}; set<char> s; for(int i{0}; i<n; i++) { for(int j{0}; j<m; j++) { cin>>grid[i][j]; s.insert(grid[i][j]); } } if(s.size()==3) cout<<2<<endl; else cout<<1<<endl; }

컴파일 시 표준 에러 (stderr) 메시지

tracks.cpp: In function 'int main()':
tracks.cpp:88:9: warning: unused variable 'ans' [-Wunused-variable]
   88 |     int ans{0};
      |         ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...