답안 #449903

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
449903 2021-08-02T09:23:50 Z Khizri Tracks in the Snow (BOI13_tracks) C++17
0 / 100
332 ms 16024 KB
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=4000+5;
int t=1,n,m,a,b;
char arr[mxn][mxn];
void solve(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>arr[i][j];
			if(arr[i][j]=='R'){
				a=1;
			}
			else if(arr[i][j]!='.'){
				b=1;
			}
		}
	}
	cout<<11<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 2124 KB Output isn't correct
2 Incorrect 0 ms 332 KB Output isn't correct
3 Incorrect 1 ms 460 KB Output isn't correct
4 Incorrect 4 ms 2252 KB Output isn't correct
5 Incorrect 3 ms 1356 KB Output isn't correct
6 Incorrect 0 ms 332 KB Output isn't correct
7 Incorrect 1 ms 460 KB Output isn't correct
8 Incorrect 1 ms 460 KB Output isn't correct
9 Incorrect 1 ms 716 KB Output isn't correct
10 Incorrect 2 ms 1228 KB Output isn't correct
11 Incorrect 2 ms 1100 KB Output isn't correct
12 Incorrect 3 ms 1356 KB Output isn't correct
13 Incorrect 2 ms 1356 KB Output isn't correct
14 Incorrect 3 ms 1356 KB Output isn't correct
15 Incorrect 7 ms 2252 KB Output isn't correct
16 Incorrect 8 ms 2124 KB Output isn't correct
17 Incorrect 6 ms 2116 KB Output isn't correct
18 Incorrect 4 ms 2124 KB Output isn't correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 15180 KB Output isn't correct
2 Incorrect 32 ms 5188 KB Output isn't correct
3 Incorrect 283 ms 15904 KB Output isn't correct
4 Incorrect 82 ms 7620 KB Output isn't correct
5 Incorrect 144 ms 11976 KB Output isn't correct
6 Incorrect 295 ms 15884 KB Output isn't correct
7 Incorrect 9 ms 15948 KB Output isn't correct
8 Incorrect 8 ms 15308 KB Output isn't correct
9 Incorrect 2 ms 332 KB Output isn't correct
10 Incorrect 1 ms 332 KB Output isn't correct
11 Incorrect 7 ms 15692 KB Output isn't correct
12 Incorrect 1 ms 844 KB Output isn't correct
13 Incorrect 32 ms 5188 KB Output isn't correct
14 Incorrect 19 ms 3856 KB Output isn't correct
15 Incorrect 22 ms 4172 KB Output isn't correct
16 Incorrect 14 ms 1836 KB Output isn't correct
17 Incorrect 80 ms 8092 KB Output isn't correct
18 Incorrect 87 ms 8112 KB Output isn't correct
19 Incorrect 70 ms 7640 KB Output isn't correct
20 Incorrect 63 ms 7112 KB Output isn't correct
21 Incorrect 170 ms 12488 KB Output isn't correct
22 Incorrect 141 ms 11952 KB Output isn't correct
23 Incorrect 147 ms 9980 KB Output isn't correct
24 Incorrect 169 ms 12612 KB Output isn't correct
25 Incorrect 332 ms 15976 KB Output isn't correct
26 Incorrect 206 ms 13972 KB Output isn't correct
27 Incorrect 258 ms 15888 KB Output isn't correct
28 Incorrect 293 ms 15920 KB Output isn't correct
29 Incorrect 301 ms 16024 KB Output isn't correct
30 Incorrect 267 ms 15624 KB Output isn't correct
31 Incorrect 271 ms 12784 KB Output isn't correct
32 Incorrect 260 ms 15960 KB Output isn't correct