oj.uz

Submission #949134

# Submission time Handle Problem Language Result Execution time Memory
949134 2024-03-19T01:57:53 Z yeediot Stray Cat (JOI20_stray) C++14
4 / 100
 336 ms 524288 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];
int a;
void dfs(int v,int pa,int cur){
    for(auto [u,id]:adj[v]){
        if(u==pa)continue;
        x[id]=cur;
        dfs(u,v,(cur+1)%a);
    }
}
vector<int> Mark(int N, int M, int A, int B,std::vector<int> U, std::vector<int> V) {
    a=A;
    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});
    }
    dfs(0,0,0);
    for(int i=0;i<M;i++){
        X[i]=x[i];
    }
    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);
}
int a,b;
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 dfs(int, int, int)':
Anthony.cpp:50:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   50 |     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:58:1: warning: control reaches end of non-void function [-Wreturn-type]
   58 | }
      | ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 16256 KB Output is correct
2 Correct 1 ms 1304 KB Output is correct
3 Correct 28 ms 15412 KB Output is correct
4 Correct 37 ms 18160 KB Output is correct
5 Correct 37 ms 18324 KB Output is correct
6 Correct 26 ms 16208 KB Output is correct
7 Correct 28 ms 16208 KB Output is correct
8 Correct 40 ms 17480 KB Output is correct
9 Correct 35 ms 17472 KB Output is correct

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 16256 KB Output is correct
2 Correct 1 ms 1304 KB Output is correct
3 Correct 28 ms 15412 KB Output is correct
4 Correct 37 ms 18160 KB Output is correct
5 Correct 37 ms 18324 KB Output is correct
6 Correct 26 ms 16208 KB Output is correct
7 Correct 28 ms 16208 KB Output is correct
8 Correct 40 ms 17480 KB Output is correct
9 Correct 35 ms 17472 KB Output is correct
10 Runtime error 336 ms 524288 KB Execution killed with signal 9
11 Halted 0 ms 0 KB -

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 13684 KB Output is correct
2 Correct 1 ms 1304 KB Output is correct
3 Correct 25 ms 12712 KB Output is correct
4 Correct 39 ms 15652 KB Output is correct
5 Correct 33 ms 15732 KB Output is correct
6 Correct 27 ms 13428 KB Output is correct
7 Correct 26 ms 13424 KB Output is correct
8 Correct 37 ms 14720 KB Output is correct
9 Correct 36 ms 14704 KB Output is correct
10 Correct 30 ms 14448 KB Output is correct
11 Correct 28 ms 14452 KB Output is correct
12 Correct 28 ms 14488 KB Output is correct
13 Correct 28 ms 14388 KB Output is correct
14 Correct 31 ms 14708 KB Output is correct
15 Correct 31 ms 14652 KB Output is correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 13684 KB Output is correct
2 Correct 1 ms 1304 KB Output is correct
3 Correct 25 ms 12712 KB Output is correct
4 Correct 39 ms 15652 KB Output is correct
5 Correct 33 ms 15732 KB Output is correct
6 Correct 27 ms 13428 KB Output is correct
7 Correct 26 ms 13424 KB Output is correct
8 Correct 37 ms 14720 KB Output is correct
9 Correct 36 ms 14704 KB Output is correct
10 Correct 30 ms 14448 KB Output is correct
11 Correct 28 ms 14452 KB Output is correct
12 Correct 28 ms 14488 KB Output is correct
13 Correct 28 ms 14388 KB Output is correct
14 Correct 31 ms 14708 KB Output is correct
15 Correct 31 ms 14652 KB Output is correct
16 Runtime error 330 ms 524288 KB Execution killed with signal 9
17 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

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

Subtask #7
0 / 9.0

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