結果
| 問題 | No.3033 Test of Russian |
| ユーザー |
 smiken_61
|
| 提出日時 | 2018-04-02 14:12:40 |
| 言語 | C++11 (gcc 11.4.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 15,347 bytes |
| コンパイル時間 | 1,749 ms |
| コンパイル使用メモリ | 163,132 KB |
| 実行使用メモリ | 6,944 KB |
| 最終ジャッジ日時 | 2024-06-26 06:35:44 |
| 合計ジャッジ時間 | 1,940 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,812 KB |
| testcase_01 | AC | 1 ms
6,940 KB |
| testcase_02 | AC | 2 ms
6,940 KB |
| testcase_03 | WA | - |
| testcase_04 | AC | 2 ms
6,944 KB |
| testcase_05 | WA | - |
| testcase_06 | AC | 1 ms
6,944 KB |
| testcase_07 | AC | 1 ms
6,940 KB |
ソースコード
#include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<cstring>
#include<string>
#include <math.h>
#include<algorithm>
// #include <boost/multiprecision/cpp_int.hpp>
#include<functional>
#define int long long
#define inf 1000000007
#define pa pair<int,int>
#define ll long long
#define pal pair<double,double>
#define ppap pair<pa,int>
#define ssa pair<string,int>
#define mp make_pair
#define pb push_back
#define EPS (1e-8)
#define equals(a,b) (fabs((a)-(b))<EPS)
int dx[4]={0,-1,0,1};
int dy[4]={1,0,-1,0};
using namespace std;
class pa3{
public:
int x,y,z;
pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
bool operator < (const pa3 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
return z<p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa3 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
return z>p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa3 &p) const{
return x==p.x && y==p.y && z==p.z;
}
bool operator != (const pa3 &p) const{
return !( x==p.x && y==p.y && z==p.z);
}
};
class pa4{
public:
double x;
int y,z,w;
pa4(double x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
bool operator < (const pa4 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
if(z!=p.z)return z<p.z;
return w<p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa4 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
if(z!=p.z)return z>p.z;
return w>p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa4 &p) const{
return x==p.x && y==p.y && z==p.z &&w==p.w;
}
};
class pa2{
public:
int x,y;
pa2(int x=0,int y=0):x(x),y(y) {}
pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
pa2 operator * (int a) {return pa2(x*a,y*a);}
bool operator < (const pa2 &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa2 &p) const{
return x != p.x ? x>p.x: y>p.y;
}
bool operator == (const pa2 &p) const{
return abs(x-p.x)==0 && abs(y-p.y)==0;
}
bool operator != (const pa2 &p) const{
return !(abs(x-p.x)==0 && abs(y-p.y)==0);
}
};
#define ppa pair<int,pas>
class Point{
public:
double x,y;
Point(double x=0,double y=0):x(x),y(y) {}
Point operator + (Point p) {return Point(x+p.x,y+p.y);}
Point operator - (Point p) {return Point(x-p.x,y-p.y);}
Point operator * (double a) {return Point(x*a,y*a);}
Point operator / (double a) {return Point(x/a,y/a);}
double absv() {return sqrt(norm());}
double norm() {return x*x+y*y;}
bool operator < (const Point &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const Point &p) const{
return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
}
};
typedef Point Vector;
#define pl pair<int,pas>
struct Segment{
Point p1,p2;
};
double dot(Vector a,Vector b){
return a.x*b.x+a.y*b.y;
}
double cross(Vector a,Vector b){
return a.x*b.y-a.y*b.x;
}
bool parareru(Point a,Point b,Point c,Point d){
// if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
return abs(cross(a-b,d-c))<EPS;
}
double distance_ls_p(Point a, Point b, Point c) {
if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
return abs(cross(b-a, c-a)) / (b-a).absv();
}
bool is_intersected_ls(Segment a,Segment b) {
if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&¶reru((a.p2),(a.p1),(a.p1),(b.p1))){
// cout<<"sss"<<endl;
if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
return false;
}
else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
}
double segment_dis(Segment a,Segment b){
if(is_intersected_ls(a,b))return 0;
double r=distance_ls_p(a.p1, a.p2, b.p1);
r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
return r;
}
Point intersection_ls(Segment a, Segment b) {
Point ba = b.p2-b.p1;
double d1 = abs(cross(ba, a.p1-b.p1));
double d2 = abs(cross(ba, a.p2-b.p1));
double t = d1 / (d1 + d2);
return a.p1 + (a.p2-a.p1) * t;
}
string itos( int i ) {
ostringstream s ;
s << i ;
return s.str() ;
}
int gcd(int v,int b){
if(v>b) return gcd(b,v);
if(v==b) return b;
if(b%v==0) return v;
return gcd(v,b%v);
}
double distans(double x1,double y1,double x2,double y2){
double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
return sqrt(rr);
}
/*
int pr[1000010];
int inv[1000010];
int beki(int wa,int rr,int warukazu){
if(rr==0) return 1%warukazu;
if(rr==1) return wa%warukazu;
if(rr%2==1) return (beki(wa,rr-1,warukazu)*wa)%warukazu;
int zx=beki(wa,rr/2,warukazu);
return (zx*zx)%warukazu;
}
double bekid(double w,int r){
if(r==0) return 1.0;
if(r==1) return w;
if(r%2) return bekid(w,r-1)*w;
double f=bekid(w,r/2);
return f*f;
}
int comb(int nn,int rr){
int r=pr[nn]*inv[rr];
r%=inf;
r*=inv[nn-rr];
r%=inf;
return r;
}
void gya(int ert){
pr[0]=1;
for(int i=1;i<=ert;i++){
pr[i]=(pr[i-1]*i)%inf;
}
for(int i=0;i<=ert;i++) inv[i]=beki(pr[i],inf-2,inf);
}
*/
//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
//sort(ve.begin(),ve.end(),greater<int>());
//----------------kokomade tenpure------------
//vector<double> ans(100000000),ans2(100000000)
/*
struct Segmin{
// 1
// 2 3
// 4 5 6 7
private:
public:
// (1<<15)=32768
// 1<<16 = 65536
// 1<<17 = 131072
// 1<<18 = 262144
int cor=(1<<17);
vector<pa> vec;
void shoki1(){
vec.resize(2*cor+3, mp(0,0));
for(int i=cor;i<2*cor;i++)vec[i].second=1;
}
void shoki2(){
for(int i=cor-1;i>0;i--) {
if(vec[2*i].first<vec[2*i+1].first) vec[i]=vec[2*i];
else if(vec[2*i].first>vec[2*i+1].first)vec[i]=vec[2*i+1];
else vec[i]=mp(vec[2*i].first,vec[2*i].second+vec[2*i+1].second);
}
}
void updadd(int x,int w){
//x 項目に w加算
x+=cor;
vec[x].first+=w;
while(1){
x/=2;
if(x==0) break;
if(vec[2*x].first<vec[2*x+1].first) vec[x]=vec[2*x];
else if(vec[2*x].first>vec[2*x+1].first) vec[x]=vec[2*x+1];
else vec[x]=mp(vec[2*x].first,vec[2*x].second+vec[2*x+1].second);
}
}
void updchan(int x,int w){
//x項目をwに変更
x+=cor;
vec[x].first=w;
while(1){
x/=2;
if(x==0) break;
if(vec[2*x].first<vec[2*x+1].first) vec[x]=vec[2*x];
else if(vec[2*x].first>vec[2*x+1].first) vec[x]=vec[2*x+1];
else vec[x]=mp(vec[2*x].first,vec[2*x].second+vec[2*x+1].second);
}
}
// [a,b)
// k-th node
// k no kukanha [l,r)
pa segmin(int a,int b,int k=1,int l=0,int r=-10){
if(r<0)r=cor;
// cout<<a<<" "<<b<<" "<<k<<" "<<l<<" "<<r<<endl;
if(a<=l && r<=b){
return vec[k];
}
if(r<=a || b<=l){
return mp((1ll<<31)-1,-1);
}
pa v1=segmin(a,b,k*2,l,(l+r)/2),v2=segmin(a,b,k*2+1,(l+r)/2,r);
if(v1.first<v2.first)return v1;
else if(v1.first>v2.first) return v2;
else return mp(v1.first,v1.second+v2.second);
}
};
struct Segmax{
// 1
// 2 3
// 4 5 6 7
private:
public:
// (1<<15)=32768
// 1<<16 = 65536
// 1<<17 = 131072
// 1<<18 = 262144
int cor=(1<<17);
vector<pa> vec;
void shoki1(){
vec.resize(2*cor+3, mp(0,0));
for(int i=cor;i<2*cor;i++)vec[i].second=1;
}
void shoki2(){
for(int i=cor-1;i>0;i--) {
if(vec[2*i].first>vec[2*i+1].first) vec[i]=vec[2*i];
else if(vec[2*i].first<vec[2*i+1].first)vec[i]=vec[2*i+1];
else vec[i]=mp(vec[2*i].first,vec[2*i].second+vec[2*i+1].second);
}
}
void updadd(int x,int w){
//x 項目に w加算
x+=cor;
vec[x].first+=w;
while(1){
x/=2;
if(x==0) break;
if(vec[2*x].first>=vec[2*x+1].first) vec[x]=vec[2*x];
else vec[x]=vec[2*x+1];
}
}
void updchan(int x,int w){
//x項目をwに変更
x+=cor;
vec[x].first=w;
while(1){
x/=2;
if(x==0) break;
if(vec[2*x].first>vec[2*x+1].first) vec[x]=vec[2*x];
else if(vec[2*x].first<vec[2*x+1].first) vec[x]=vec[2*x+1];
else vec[x]=mp(vec[2*x].first,vec[2*x].second+vec[2*x+1].second);
}
}
// [a,b)
// k-th node
// k no kukanha [l,r)
pa segmax(int a,int b,int k=1,int l=0,int r=-10){
if(r<0)r=cor;
// cout<<a<<" "<<b<<" "<<k<<" "<<l<<" "<<r<<endl;
if(a<=l && r<=b){
return vec[k];
}
if(r<=a || b<=l){
return mp(-(1ll<<31),-1);
}
pa v1=segmax(a,b,k*2,l,(l+r)/2),v2=segmax(a,b,k*2+1,(l+r)/2,r);
if(v1.first>v2.first)return v1;
else if(v1.first<v2.first) return v2;
else return mp(v1.first,v1.second+v2.second);
}
};
*/
int n,m,x;
signed main(){
cin>>n>>m>>x;
if(x<3) cout<<"NO"<<endl;
else{
if(m>=3) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
}