oj.uz

답안 #449899

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
449899 2021-08-02T09:21:50 Z Khizri Tracks in the Snow (BOI13_tracks) C++17
0 / 100
 341 ms 15984 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<<3<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Subtask #1
0 / 30.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 820 KB Output isn't correct
10 Incorrect 3 ms 1228 KB Output isn't correct
11 Incorrect 2 ms 1152 KB Output isn't correct
12 Incorrect 3 ms 1356 KB Output isn't correct
13 Incorrect 3 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 7 ms 2124 KB Output isn't correct
17 Incorrect 7 ms 2128 KB Output isn't correct
18 Incorrect 4 ms 2256 KB Output isn't correct

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 15248 KB Output isn't correct
2 Incorrect 32 ms 5200 KB Output isn't correct
3 Incorrect 311 ms 15896 KB Output isn't correct
4 Incorrect 75 ms 7672 KB Output isn't correct
5 Incorrect 144 ms 11968 KB Output isn't correct
6 Incorrect 298 ms 15936 KB Output isn't correct
7 Incorrect 7 ms 15948 KB Output isn't correct
8 Incorrect 7 ms 15180 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 33 ms 5136 KB Output isn't correct
14 Incorrect 22 ms 3836 KB Output isn't correct
15 Incorrect 22 ms 4216 KB Output isn't correct
16 Incorrect 13 ms 1868 KB Output isn't correct
17 Incorrect 78 ms 8088 KB Output isn't correct
18 Incorrect 96 ms 8052 KB Output isn't correct
19 Incorrect 80 ms 7620 KB Output isn't correct
20 Incorrect 64 ms 7108 KB Output isn't correct
21 Incorrect 164 ms 12412 KB Output isn't correct
22 Incorrect 160 ms 12080 KB Output isn't correct
23 Incorrect 163 ms 10128 KB Output isn't correct
24 Incorrect 173 ms 12404 KB Output isn't correct
25 Incorrect 341 ms 15900 KB Output isn't correct
26 Incorrect 195 ms 13920 KB Output isn't correct
27 Incorrect 258 ms 15984 KB Output isn't correct
28 Incorrect 300 ms 15960 KB Output isn't correct
29 Incorrect 299 ms 15980 KB Output isn't correct
30 Incorrect 284 ms 15668 KB Output isn't correct
31 Incorrect 260 ms 12776 KB Output isn't correct
32 Incorrect 267 ms 15876 KB Output isn't correct