답안 #667082

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
667082	2022-11-30T11:05:17 Z	zhing_zhou	Programiranje (COCI17_programiranje)	Java 11	0 / 80	70 ms	8576 KB

programiranje

import java.util.*;
import java.io.*;
public class programiranje
{
    static class Reader {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;
  
        public Reader()
        {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }
  
        public Reader(String file_name) throws IOException
        {
            din = new DataInputStream(
                new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }
  
        public String readLine() throws IOException
        {
            byte[] buf = new byte[64]; // line length
            int cnt = 0, c;
            while ((c = read()) != -1) {
                if (c == '\n') {
                    if (cnt != 0) {
                        break;
                    }
                    else {
                        continue;
                    }
                }
                buf[cnt++] = (byte)c;
            }
            return new String(buf, 0, cnt);
        }
  
        public int nextInt() throws IOException
        {
            int ret = 0;
            byte c = read();
            while (c <= ' ') {
                c = read();
            }
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
  
            if (neg)
                return -ret;
            return ret;
        }
  
        public long nextLong() throws IOException
        {
            long ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
            if (neg)
                return -ret;
            return ret;
        }
  
        public double nextDouble() throws IOException
        {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
  
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
  
            if (c == '.') {
                while ((c = read()) >= '0' && c <= '9') {
                    ret += (c - '0') / (div *= 10);
                }
            }
  
            if (neg)
                return -ret;
            return ret;
        }
  
        private void fillBuffer() throws IOException
        {
            bytesRead = din.read(buffer, bufferPointer = 0,
                                 BUFFER_SIZE);
            if (bytesRead == -1)
                buffer[0] = -1;
        }
  
        private byte read() throws IOException
        {
            if (bufferPointer == bytesRead)
                fillBuffer();
            return buffer[bufferPointer++];
        }
  
        public void close() throws IOException
        {
            if (din == null)
                return;
            din.close();
        }
    }
    public static void main(String args[]) throws IOException
    {
        Reader sc = new Reader();
        String s = sc.readLine();
        int queries = sc.nextInt();
        int len = s.length();
        int pref[][] = new int[len][26];
        pref[0][s.charAt(0) - 'a'] = 1;
        for(int i = 1; i < s.length(); i++)
        {
            for(int j = 0; j < 26; j++)
            {
                pref[i][j] = pref[i - 1][j];
            }
            pref[i][s.charAt(i) - 'a']++;
        }
        for(int i = 1; i <= queries; i++)
        {
            int l1 = sc.nextInt(), r1 = sc.nextInt(), l2 = sc.nextInt(), r2 = sc.nextInt();
            l1--;
            r1--;
            l2--;
            r2--;
            boolean flag = true;
            for(int j = 0; j < 26; j++)
            {
                int val1 = pref[r1][j];
                if(l1 != 0) val1 -= pref[l1 - 1][j];
                int val2 = pref[r2][j];
                if(l2 != 0) val2 -= pref[l2 - 1][j];
                if(val1 != val2) flag = false;
            }
            if(flag == true)
            {
                System.out.println("DA");
            }
            else
            {
                System.out.println("NE");
            }
        }
    }
}

Subtask #1

0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	56 ms	8252 KB	Execution failed because the return code was nonzero
2	Runtime error	58 ms	8392 KB	Execution failed because the return code was nonzero
3	Runtime error	60 ms	8308 KB	Execution failed because the return code was nonzero
4	Runtime error	60 ms	8556 KB	Execution failed because the return code was nonzero
5	Runtime error	70 ms	8256 KB	Execution failed because the return code was nonzero
6	Runtime error	56 ms	8292 KB	Execution failed because the return code was nonzero
7	Runtime error	57 ms	8576 KB	Execution failed because the return code was nonzero
8	Runtime error	56 ms	8356 KB	Execution failed because the return code was nonzero
9	Runtime error	55 ms	8452 KB	Execution failed because the return code was nonzero
10	Runtime error	59 ms	8344 KB	Execution failed because the return code was nonzero