oj.uz

Submission #411020

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

typedef pair<int,int> P;
vector<P> adj[100000];
vector<int> ret;
int dist[100000];
int pr[100000];

namespace {


}

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 {
                    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:30: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]
   30 |         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 18124 KB Output is correct
2 Correct 4 ms 3820 KB Output is correct
3 Correct 46 ms 17436 KB Output is correct
4 Correct 61 ms 18972 KB Output is correct
5 Correct 57 ms 19140 KB Output is correct
6 Correct 44 ms 17908 KB Output is correct
7 Correct 46 ms 17916 KB Output is correct
8 Correct 60 ms 18384 KB Output is correct
9 Correct 52 ms 18560 KB Output is correct

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 18124 KB Output is correct
2 Correct 4 ms 3820 KB Output is correct
3 Correct 46 ms 17436 KB Output is correct
4 Correct 61 ms 18972 KB Output is correct
5 Correct 57 ms 19140 KB Output is correct
6 Correct 44 ms 17908 KB Output is correct
7 Correct 46 ms 17916 KB Output is correct
8 Correct 60 ms 18384 KB Output is correct
9 Correct 52 ms 18560 KB Output is correct
10 Incorrect 39 ms 16456 KB Wrong Answer [6]
11 Halted 0 ms 0 KB -

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 15620 KB Output is correct
2 Correct 3 ms 3692 KB Output is correct
3 Correct 38 ms 15312 KB Output is correct
4 Correct 57 ms 17000 KB Output is correct
5 Correct 54 ms 16804 KB Output is correct
6 Correct 41 ms 15636 KB Output is correct
7 Correct 45 ms 15616 KB Output is correct
8 Correct 50 ms 16128 KB Output is correct
9 Correct 52 ms 16280 KB Output is correct
10 Correct 54 ms 15976 KB Output is correct
11 Correct 49 ms 16052 KB Output is correct
12 Correct 47 ms 15980 KB Output is correct
13 Correct 46 ms 15952 KB Output is correct
14 Correct 55 ms 16320 KB Output is correct
15 Correct 55 ms 16324 KB Output is correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 15620 KB Output is correct
2 Correct 3 ms 3692 KB Output is correct
3 Correct 38 ms 15312 KB Output is correct
4 Correct 57 ms 17000 KB Output is correct
5 Correct 54 ms 16804 KB Output is correct
6 Correct 41 ms 15636 KB Output is correct
7 Correct 45 ms 15616 KB Output is correct
8 Correct 50 ms 16128 KB Output is correct
9 Correct 52 ms 16280 KB Output is correct
10 Correct 54 ms 15976 KB Output is correct
11 Correct 49 ms 16052 KB Output is correct
12 Correct 47 ms 15980 KB Output is correct
13 Correct 46 ms 15952 KB Output is correct
14 Correct 55 ms 16320 KB Output is correct
15 Correct 55 ms 16324 KB Output is correct
16 Correct 37 ms 14572 KB Output is correct
17 Correct 38 ms 14524 KB Output is correct
18 Incorrect 38 ms 14464 KB Wrong Answer [6]
19 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 3700 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 5064 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

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