Submission #1926785


Source Code Expand

Copy
import java.util.*;
import java.io.*;
import java.math.*;
 
 
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
 
public class Main{ 
 
 
    static long mod=1000000007;
    static int dx[]={1,-1,0,0};
    static int dy[]={0,0,1,-1};
    // static int dx[]={1,-1,0,0,1,1,-1,-1};
    // static int dy[]={0,0,1,-1,1,-1,1,-1};
    // PriorityQueue<Integer> que = new PriorityQueue<Integer>(); 
    //HashMap<Integer,Integer> map = new HashMap<Integer,Integer>();
 
    public  static void main(String[] args)   throws Exception, IOException{
     
        
        Reader sc = new Reader(System.in);
        PrintWriter out=new PrintWriter(System.out);
     
        // int n=sc.nextInt();
        // long n=sc.nextLong();
        // char c[][] = new char[h][w];
        // long a[] = new long [n];
        // for (int i=0; i<n; i++) {a[i]=sc.nextInct();}
        int a=sc.nextInt();
        int b=sc.nextInt(),x=0;

        char c[] = sc.nextString().toCharArray();
        for (int i=0;i<c.length ;i++ ) {
            if(c[i]=='-')x++;
        }

        out.println((x==1 && c[a]=='-')?"Yes":"No" );
        out.flush();
    }

    static void db(Object... os){
     
        System.err.println(Arrays.deepToString(os));
     
    }
     
    static boolean validpos(int x,int y,int r, int c){
        
        return x<r && 0<=x && y<c && 0<=y;
        
    }
     
    static boolean bit(long x,int k){
        // weather k-th bit (from right) be one or zero
        return  ( 0 < ( (x>>k) & 1 )  )  ? true:false;
    }    
}

class XY {
    int x,y,d;
    XY(int x, int y, int d) {
        this.x=x;
        this.y=y;
        this.d=d;
    } 
}
 
class P implements Comparable<P>{
    int x,y;
    P(int x, int y) {
        this.x=x;
        this.y=y;
    } 
      
    public int compareTo(P p){
        return -x + p.x;//des
    } 
}
 
class Reader
{ 
    private BufferedReader x;
    private StringTokenizer st;
    
    public Reader(InputStream in)
    {
        x = new BufferedReader(new InputStreamReader(in));
        st = null;
    }
    public String nextString() throws IOException
    {
        while( st==null || !st.hasMoreTokens() )
            st = new StringTokenizer(x.readLine());
        return st.nextToken();
    }
    public int nextInt() throws IOException
    {
        return Integer.parseInt(nextString());
    }
    public long nextLong() throws IOException
    {
        return Long.parseLong(nextString());
    }
    public double nextDouble() throws IOException
    {
        return Double.parseDouble(nextString());
    }
}

Submission Info

Submission Time
Task B - Postal Code
User mukku
Language Java8 (OpenJDK 1.8.0)
Score 200
Code Size 2725 Byte
Status AC
Exec Time 72 ms
Memory 22868 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 19
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
01.txt AC 71 ms 17620 KB
02.txt AC 70 ms 17748 KB
03.txt AC 71 ms 19924 KB
04.txt AC 70 ms 21204 KB
05.txt AC 71 ms 20052 KB
06.txt AC 72 ms 20564 KB
07.txt AC 69 ms 17748 KB
08.txt AC 72 ms 21204 KB
09.txt AC 71 ms 20564 KB
10.txt AC 69 ms 19284 KB
11.txt AC 72 ms 18900 KB
12.txt AC 71 ms 20948 KB
13.txt AC 70 ms 21204 KB
14.txt AC 70 ms 21204 KB
15.txt AC 71 ms 17620 KB
16.txt AC 72 ms 19924 KB
sample_01.txt AC 72 ms 22868 KB
sample_02.txt AC 71 ms 18772 KB
sample_03.txt AC 71 ms 18900 KB