oj.uz

Submission #411026

# Submission time Handle Problem Language Result Execution time Memory
411026 2021-05-24T06:52:40 Z 조영욱(#7633) Stray Cat (JOI20_stray) C++17
4 / 100
 61 ms 22936 KB 
#include "Anthony.h"
#include <bits/stdc++.h>
using namespace std;

typedef pair<int,int> P;

namespace {
vector<P> adj[100000];
vector<int> ret;
int dist[100000];
int pr[100000];

}

vector<int> Mark(int n,int m,int a,int b,vector<int> u,vector<int> v) {
    for(int i=0;i<m;i++) {
        adj[u[i]].push_back(P(v[i],i));
        adj[v[i]].push_back(P(u[i],i));
    }
    ret.resize(m);
    queue<int> q;
    q.push(0);
    memset(dist,-1,sizeof(dist));
    dist[0]=0;
    memset(pr,0,sizeof(pr));
    while (!q.empty()) {
        int now=q.front();
        q.pop();
        for(int i=0;i<adj[now].size();i++) {
            int nt=adj[now][i].first;
            if (dist[nt]==-1) {
                q.push(nt);
                dist[nt]=dist[now]+1;
                ret[adj[now][i].second]=dist[now]%3;
                pr[nt]=now;
            }
            else {
                if (nt==pr[now]) {
                    continue;
                }
                if (dist[now]==dist[nt]+1) {
                    ret[adj[now][i].second]=(dist[now]+2)%3;
                }
                else if (dist[now]==dist[nt]) {
                    ret[adj[now][i].second]=dist[now]%3;
                }
            }
        }
    }
    return ret;
}

#include "Catherine.h"
#include <bits/stdc++.h>
using namespace std;

void Init(int A, int B) {

}

int Move(vector<int> y) {
    vector<int> vec;
    for(int i=0;i<y.size();i++) {
        if (y[i]!=0) {
            vec.push_back(i);
        }
    }
    if (vec.size()==1) {
        return vec[0];
    }
    if (y[vec[0]]!=1||y[vec[1]]!=1) {
        if (y[vec[0]]==1) {
            return vec[0];
        }
        if (y[vec[1]]==1) {
            return vec[1];
        }
    }
    if ((vec[0]+1)%3==vec[1]) {
        return vec[0];
    }
    else {
        return vec[1];
    }
}

Compilation message

Anthony.cpp: In function 'std::vector<int> Mark(int, int, int, int, std::vector<int>, std::vector<int>)':
Anthony.cpp:29:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |         for(int i=0;i<adj[now].size();i++) {
      |                     ~^~~~~~~~~~~~~~~~

Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:11:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |     for(int i=0;i<y.size();i++) {
      |                 ~^~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 18032 KB Output is correct
2 Correct 3 ms 3692 KB Output is correct
3 Correct 38 ms 17428 KB Output is correct
4 Correct 61 ms 19164 KB Output is correct
5 Correct 59 ms 19052 KB Output is correct
6 Correct 45 ms 17900 KB Output is correct
7 Correct 52 ms 17788 KB Output is correct
8 Correct 53 ms 18488 KB Output is correct
9 Correct 55 ms 18528 KB Output is correct

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 18032 KB Output is correct
2 Correct 3 ms 3692 KB Output is correct
3 Correct 38 ms 17428 KB Output is correct
4 Correct 61 ms 19164 KB Output is correct
5 Correct 59 ms 19052 KB Output is correct
6 Correct 45 ms 17900 KB Output is correct
7 Correct 52 ms 17788 KB Output is correct
8 Correct 53 ms 18488 KB Output is correct
9 Correct 55 ms 18528 KB Output is correct
10 Correct 46 ms 16000 KB Output is correct
11 Correct 43 ms 16304 KB Output is correct
12 Incorrect 40 ms 16460 KB Wrong Answer [6]
13 Halted 0 ms 0 KB -

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 15660 KB Output is correct
2 Correct 3 ms 3692 KB Output is correct
3 Correct 36 ms 15308 KB Output is correct
4 Correct 57 ms 16872 KB Output is correct
5 Correct 60 ms 16932 KB Output is correct
6 Correct 47 ms 15648 KB Output is correct
7 Correct 41 ms 15668 KB Output is correct
8 Correct 60 ms 16336 KB Output is correct
9 Correct 49 ms 16264 KB Output is correct
10 Correct 47 ms 16084 KB Output is correct
11 Correct 49 ms 16060 KB Output is correct
12 Correct 51 ms 16004 KB Output is correct
13 Correct 46 ms 16064 KB Output is correct
14 Correct 50 ms 16172 KB Output is correct
15 Correct 49 ms 16240 KB Output is correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 15660 KB Output is correct
2 Correct 3 ms 3692 KB Output is correct
3 Correct 36 ms 15308 KB Output is correct
4 Correct 57 ms 16872 KB Output is correct
5 Correct 60 ms 16932 KB Output is correct
6 Correct 47 ms 15648 KB Output is correct
7 Correct 41 ms 15668 KB Output is correct
8 Correct 60 ms 16336 KB Output is correct
9 Correct 49 ms 16264 KB Output is correct
10 Correct 47 ms 16084 KB Output is correct
11 Correct 49 ms 16060 KB Output is correct
12 Correct 51 ms 16004 KB Output is correct
13 Correct 46 ms 16064 KB Output is correct
14 Correct 50 ms 16172 KB Output is correct
15 Correct 49 ms 16240 KB Output is correct
16 Correct 39 ms 14128 KB Output is correct
17 Correct 38 ms 14140 KB Output is correct
18 Runtime error 51 ms 22936 KB Execution killed with signal 11
19 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 3692 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 4888 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 4884 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -