oj.uz

Submission #949146

# Submission time Handle Problem Language Result Execution time Memory
949146 2024-03-19T02:26:04 Z yeediot Stray Cat (JOI20_stray) C++14
15 / 100
 43 ms 17104 KB 
#include "Anthony.h"
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
const int mxn=2e4+5;
vector<int>x(mxn);
vector<pii>adj[mxn];
long long dis[mxn];
int a,n,m,b;
void bfs(){
    queue<int>q;
    memset(dis,0x3f3f3f3f,sizeof(dis));
    q.push(0);
    dis[0]=0;
    while(sz(q)){
        auto v=q.front();
        q.pop();
        for(auto [u,id]:adj[v]){
            if(dis[u]>dis[v]+1){
                dis[u]=dis[v]+1;
                q.push(u);
            }
        }
    }
}
vector<int> Mark(int N, int M, int A, int B,std::vector<int> U, std::vector<int> V) {
    a=A,n=N,m=M,b=B;
    vector<int> X(M);
    for(int i=0;i<M;i++){
        adj[U[i]].pb({V[i],i});
        adj[V[i]].pb({U[i],i});
    }
    bfs();
    if(A>=3){
        for(int i=0;i<M;i++){
            X[i]=min(dis[V[i]],dis[U[i]])%A;
        }
    }
    return X;
}

#include "Catherine.h"
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
namespace {
    int a,b;
}  // namespace

void Init(int A, int B) {
    a=A,b=B;
}
int Move(std::vector<int> y) {
    for(int i=0;i<a;i++){
        if(y[i] and y[(i+1)%a]){
            return i;
        }
    }
    for(int i=0;i<a;i++){
        if(y[i])return i;
    }
}

Compilation message

Anthony.cpp: In function 'void bfs()':
Anthony.cpp:58:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   58 |         for(auto [u,id]:adj[v]){
      |                  ^
Anthony.cpp: In function 'void setIO(std::string)':
Anthony.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Anthony.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Catherine.cpp: In function 'void setIO(std::string)':
Catherine.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Catherine.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:61:1: warning: control reaches end of non-void function [-Wreturn-type]
   61 | }
      | ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 15736 KB Output is correct
2 Correct 1 ms 1552 KB Output is correct
3 Correct 25 ms 15236 KB Output is correct
4 Correct 36 ms 17104 KB Output is correct
5 Correct 38 ms 16712 KB Output is correct
6 Correct 30 ms 15476 KB Output is correct
7 Correct 28 ms 15556 KB Output is correct
8 Correct 38 ms 16164 KB Output is correct
9 Correct 34 ms 16168 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 15736 KB Output is correct
2 Correct 1 ms 1552 KB Output is correct
3 Correct 25 ms 15236 KB Output is correct
4 Correct 36 ms 17104 KB Output is correct
5 Correct 38 ms 16712 KB Output is correct
6 Correct 30 ms 15476 KB Output is correct
7 Correct 28 ms 15556 KB Output is correct
8 Correct 38 ms 16164 KB Output is correct
9 Correct 34 ms 16168 KB Output is correct
10 Correct 26 ms 14064 KB Output is correct
11 Correct 27 ms 14112 KB Output is correct
12 Correct 27 ms 14132 KB Output is correct
13 Correct 26 ms 13968 KB Output is correct
14 Correct 27 ms 14396 KB Output is correct
15 Correct 30 ms 14596 KB Output is correct
16 Correct 33 ms 16680 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 13304 KB Output is correct
2 Correct 1 ms 1552 KB Output is correct
3 Correct 26 ms 12936 KB Output is correct
4 Correct 33 ms 14928 KB Output is correct
5 Correct 43 ms 14624 KB Output is correct
6 Correct 37 ms 13108 KB Output is correct
7 Correct 26 ms 13136 KB Output is correct
8 Correct 31 ms 13856 KB Output is correct
9 Correct 31 ms 13948 KB Output is correct
10 Correct 30 ms 13700 KB Output is correct
11 Correct 28 ms 13688 KB Output is correct
12 Correct 37 ms 13800 KB Output is correct
13 Correct 31 ms 13724 KB Output is correct
14 Correct 31 ms 14048 KB Output is correct
15 Correct 33 ms 13900 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 13304 KB Output is correct
2 Correct 1 ms 1552 KB Output is correct
3 Correct 26 ms 12936 KB Output is correct
4 Correct 33 ms 14928 KB Output is correct
5 Correct 43 ms 14624 KB Output is correct
6 Correct 37 ms 13108 KB Output is correct
7 Correct 26 ms 13136 KB Output is correct
8 Correct 31 ms 13856 KB Output is correct
9 Correct 31 ms 13948 KB Output is correct
10 Correct 30 ms 13700 KB Output is correct
11 Correct 28 ms 13688 KB Output is correct
12 Correct 37 ms 13800 KB Output is correct
13 Correct 31 ms 13724 KB Output is correct
14 Correct 31 ms 14048 KB Output is correct
15 Correct 33 ms 13900 KB Output is correct
16 Correct 24 ms 11884 KB Output is correct
17 Correct 24 ms 11896 KB Output is correct
18 Correct 24 ms 11672 KB Output is correct
19 Correct 26 ms 11600 KB Output is correct
20 Correct 28 ms 12380 KB Output is correct
21 Correct 28 ms 12136 KB Output is correct
22 Correct 30 ms 14196 KB Output is correct
23 Correct 26 ms 11892 KB Output is correct
24 Correct 24 ms 11888 KB Output is correct

Subtask #5
0 / 5.0

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

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 11096 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 11376 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -